./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:09:55,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:09:55,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:09:55,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:09:55,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:09:55,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:09:55,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:09:55,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:09:55,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:09:55,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:09:55,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:09:55,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:09:55,375 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:09:55,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:09:55,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:09:55,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:09:55,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:09:55,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:09:55,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:09:55,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:09:55,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:09:55,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:09:55,381 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:09:55,382 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:09:55,382 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:09:55,382 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:09:55,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:09:55,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:09:55,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:09:55,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:09:55,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:09:55,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:09:55,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:09:55,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:09:55,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:09:55,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:09:55,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:09:55,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:09:55,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:09:55,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:09:55,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:09:55,387 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-clean/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-clean/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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2024-10-11 17:09:55,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:09:55,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:09:55,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:09:55,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:09:55,619 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:09:55,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2024-10-11 17:09:56,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:09:57,058 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:09:57,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2024-10-11 17:09:57,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6731464a/a724070936874d7c8e25d5a05d43199c/FLAG9f6cc7d95 [2024-10-11 17:09:57,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6731464a/a724070936874d7c8e25d5a05d43199c [2024-10-11 17:09:57,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:09:57,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:09:57,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:09:57,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:09:57,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:09:57,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc3f649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57, skipping insertion in model container [2024-10-11 17:09:57,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:09:57,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:09:57,714 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:09:57,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:09:57,792 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:09:57,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57 WrapperNode [2024-10-11 17:09:57,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:09:57,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:09:57,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:09:57,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:09:57,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,824 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2024-10-11 17:09:57,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:09:57,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:09:57,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:09:57,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:09:57,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:09:57,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:09:57,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:09:57,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:09:57,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (1/1) ... [2024-10-11 17:09:57,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:09:57,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:09:57,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:09:57,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:09:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:09:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:09:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:09:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:09:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:09:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 17:09:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 17:09:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:09:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:09:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:09:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:09:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:09:57,909 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:09:58,032 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:09:58,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:09:58,263 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:09:58,263 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:09:58,302 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:09:58,302 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 17:09:58,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:09:58 BoogieIcfgContainer [2024-10-11 17:09:58,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:09:58,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:09:58,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:09:58,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:09:58,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:09:57" (1/3) ... [2024-10-11 17:09:58,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8dc304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:09:58, skipping insertion in model container [2024-10-11 17:09:58,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:57" (2/3) ... [2024-10-11 17:09:58,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8dc304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:09:58, skipping insertion in model container [2024-10-11 17:09:58,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:09:58" (3/3) ... [2024-10-11 17:09:58,311 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2024-10-11 17:09:58,324 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:09:58,324 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 17:09:58,324 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:09:58,370 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:09:58,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 147 transitions, 301 flow [2024-10-11 17:09:58,453 INFO L124 PetriNetUnfolderBase]: 19/206 cut-off events. [2024-10-11 17:09:58,454 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:09:58,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 206 events. 19/206 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 628 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2024-10-11 17:09:58,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 147 transitions, 301 flow [2024-10-11 17:09:58,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 147 transitions, 301 flow [2024-10-11 17:09:58,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:09:58,471 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;@52510ddf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:09:58,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 17:09:58,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:09:58,481 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2024-10-11 17:09:58,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:09:58,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:58,482 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:09:58,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:09:58,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1629330204, now seen corresponding path program 1 times [2024-10-11 17:09:58,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:58,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538775165] [2024-10-11 17:09:58,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:58,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:09:58,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:58,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538775165] [2024-10-11 17:09:58,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538775165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:58,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:58,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:09:58,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72677385] [2024-10-11 17:09:58,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:58,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:09:58,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:58,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:09:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:09:58,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 147 [2024-10-11 17:09:58,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 147 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-10-11 17:09:58,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:58,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 147 [2024-10-11 17:09:58,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:58,955 INFO L124 PetriNetUnfolderBase]: 48/531 cut-off events. [2024-10-11 17:09:58,955 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:09:58,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 531 events. 48/531 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2501 event pairs, 35 based on Foata normal form. 62/538 useless extension candidates. Maximal degree in co-relation 575. Up to 108 conditions per place. [2024-10-11 17:09:58,959 INFO L140 encePairwiseOnDemand]: 132/147 looper letters, 22 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2024-10-11 17:09:58,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 139 transitions, 333 flow [2024-10-11 17:09:58,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:09:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:09:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2024-10-11 17:09:58,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-10-11 17:09:58,972 INFO L175 Difference]: Start difference. First operand has 137 places, 147 transitions, 301 flow. Second operand 3 states and 392 transitions. [2024-10-11 17:09:58,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 139 transitions, 333 flow [2024-10-11 17:09:58,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 139 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:09:58,979 INFO L231 Difference]: Finished difference. Result has 138 places, 133 transitions, 281 flow [2024-10-11 17:09:58,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=138, PETRI_TRANSITIONS=133} [2024-10-11 17:09:58,983 INFO L277 CegarLoopForPetriNet]: 137 programPoint places, 1 predicate places. [2024-10-11 17:09:58,984 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 133 transitions, 281 flow [2024-10-11 17:09:58,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-10-11 17:09:58,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:58,985 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:09:58,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:09:58,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:09:58,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:58,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1109750366, now seen corresponding path program 1 times [2024-10-11 17:09:58,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:58,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406565575] [2024-10-11 17:09:58,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:58,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:09:59,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:59,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406565575] [2024-10-11 17:09:59,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406565575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:59,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:59,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:09:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089074677] [2024-10-11 17:09:59,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:59,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:09:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:09:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:09:59,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 147 [2024-10-11 17:09:59,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 133 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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-10-11 17:09:59,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:59,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 147 [2024-10-11 17:09:59,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:59,682 INFO L124 PetriNetUnfolderBase]: 108/637 cut-off events. [2024-10-11 17:09:59,682 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-11 17:09:59,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 637 events. 108/637 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3633 event pairs, 7 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 831. Up to 181 conditions per place. [2024-10-11 17:09:59,688 INFO L140 encePairwiseOnDemand]: 141/147 looper letters, 48 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2024-10-11 17:09:59,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 433 flow [2024-10-11 17:09:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:09:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:09:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2024-10-11 17:09:59,693 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2024-10-11 17:09:59,694 INFO L175 Difference]: Start difference. First operand has 138 places, 133 transitions, 281 flow. Second operand 6 states and 678 transitions. [2024-10-11 17:09:59,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 433 flow [2024-10-11 17:09:59,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 156 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:09:59,698 INFO L231 Difference]: Finished difference. Result has 140 places, 132 transitions, 285 flow [2024-10-11 17:09:59,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=140, PETRI_TRANSITIONS=132} [2024-10-11 17:09:59,699 INFO L277 CegarLoopForPetriNet]: 137 programPoint places, 3 predicate places. [2024-10-11 17:09:59,699 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 132 transitions, 285 flow [2024-10-11 17:09:59,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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-10-11 17:09:59,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:59,700 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:09:59,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:09:59,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:09:59,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:59,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1567470371, now seen corresponding path program 1 times [2024-10-11 17:09:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:59,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610857351] [2024-10-11 17:09:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:59,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:09:59,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:59,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610857351] [2024-10-11 17:09:59,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610857351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:59,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:59,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:09:59,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90356566] [2024-10-11 17:09:59,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:59,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:09:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:59,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:09:59,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:09:59,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2024-10-11 17:09:59,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 132 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-10-11 17:09:59,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:59,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2024-10-11 17:09:59,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:59,851 INFO L124 PetriNetUnfolderBase]: 91/795 cut-off events. [2024-10-11 17:09:59,851 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:09:59,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 795 events. 91/795 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4698 event pairs, 30 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 962. Up to 125 conditions per place. [2024-10-11 17:09:59,856 INFO L140 encePairwiseOnDemand]: 138/147 looper letters, 30 selfloop transitions, 6 changer transitions 0/145 dead transitions. [2024-10-11 17:09:59,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 145 transitions, 386 flow [2024-10-11 17:09:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:09:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:09:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2024-10-11 17:09:59,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8435374149659864 [2024-10-11 17:09:59,858 INFO L175 Difference]: Start difference. First operand has 140 places, 132 transitions, 285 flow. Second operand 3 states and 372 transitions. [2024-10-11 17:09:59,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 145 transitions, 386 flow [2024-10-11 17:09:59,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 145 transitions, 376 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:09:59,862 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 313 flow [2024-10-11 17:09:59,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2024-10-11 17:09:59,863 INFO L277 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2024-10-11 17:09:59,874 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 313 flow [2024-10-11 17:09:59,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-10-11 17:09:59,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:59,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:09:59,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:09:59,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:09:59,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1800401091, now seen corresponding path program 1 times [2024-10-11 17:09:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367051206] [2024-10-11 17:09:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:09:59,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:59,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367051206] [2024-10-11 17:09:59,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367051206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:59,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:59,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:09:59,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589769146] [2024-10-11 17:09:59,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:59,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:09:59,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:59,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:09:59,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:09:59,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 147 [2024-10-11 17:09:59,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 134 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-10-11 17:09:59,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:59,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 147 [2024-10-11 17:09:59,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:00,003 INFO L124 PetriNetUnfolderBase]: 94/797 cut-off events. [2024-10-11 17:10:00,004 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-10-11 17:10:00,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 797 events. 94/797 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4756 event pairs, 60 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 1062. Up to 189 conditions per place. [2024-10-11 17:10:00,008 INFO L140 encePairwiseOnDemand]: 142/147 looper letters, 27 selfloop transitions, 4 changer transitions 0/141 dead transitions. [2024-10-11 17:10:00,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 141 transitions, 393 flow [2024-10-11 17:10:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2024-10-11 17:10:00,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8344671201814059 [2024-10-11 17:10:00,010 INFO L175 Difference]: Start difference. First operand has 137 places, 134 transitions, 313 flow. Second operand 3 states and 368 transitions. [2024-10-11 17:10:00,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 141 transitions, 393 flow [2024-10-11 17:10:00,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 141 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:00,014 INFO L231 Difference]: Finished difference. Result has 139 places, 137 transitions, 333 flow [2024-10-11 17:10:00,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=139, PETRI_TRANSITIONS=137} [2024-10-11 17:10:00,015 INFO L277 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2024-10-11 17:10:00,016 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 137 transitions, 333 flow [2024-10-11 17:10:00,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-10-11 17:10:00,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:00,016 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:00,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:10:00,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:00,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:00,018 INFO L85 PathProgramCache]: Analyzing trace with hash 660933758, now seen corresponding path program 1 times [2024-10-11 17:10:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:00,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152978826] [2024-10-11 17:10:00,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:00,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:00,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:10:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:00,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:10:00,064 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:10:00,065 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-11 17:10:00,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-11 17:10:00,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-11 17:10:00,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-11 17:10:00,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-11 17:10:00,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-11 17:10:00,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-11 17:10:00,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-11 17:10:00,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-11 17:10:00,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-11 17:10:00,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-11 17:10:00,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-11 17:10:00,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:10:00,069 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 17:10:00,071 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:10:00,071 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:10:00,093 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:10:00,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 196 transitions, 408 flow [2024-10-11 17:10:00,122 INFO L124 PetriNetUnfolderBase]: 34/342 cut-off events. [2024-10-11 17:10:00,123 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:10:00,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 342 events. 34/342 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1167 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 208. Up to 8 conditions per place. [2024-10-11 17:10:00,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 196 transitions, 408 flow [2024-10-11 17:10:00,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 196 transitions, 408 flow [2024-10-11 17:10:00,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:00,130 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;@52510ddf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:00,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 17:10:00,135 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:00,135 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2024-10-11 17:10:00,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:00,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:00,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:00,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:00,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash 149931292, now seen corresponding path program 1 times [2024-10-11 17:10:00,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:00,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490444046] [2024-10-11 17:10:00,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:00,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:00,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490444046] [2024-10-11 17:10:00,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490444046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:00,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:00,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421803373] [2024-10-11 17:10:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:00,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:00,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:00,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:00,189 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 196 [2024-10-11 17:10:00,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 196 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-10-11 17:10:00,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:00,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 196 [2024-10-11 17:10:00,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:00,581 INFO L124 PetriNetUnfolderBase]: 788/4305 cut-off events. [2024-10-11 17:10:00,581 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-10-11 17:10:00,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5658 conditions, 4305 events. 788/4305 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 41159 event pairs, 348 based on Foata normal form. 749/4668 useless extension candidates. Maximal degree in co-relation 721. Up to 1303 conditions per place. [2024-10-11 17:10:00,600 INFO L140 encePairwiseOnDemand]: 175/196 looper letters, 31 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2024-10-11 17:10:00,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 183 transitions, 448 flow [2024-10-11 17:10:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2024-10-11 17:10:00,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8707482993197279 [2024-10-11 17:10:00,602 INFO L175 Difference]: Start difference. First operand has 181 places, 196 transitions, 408 flow. Second operand 3 states and 512 transitions. [2024-10-11 17:10:00,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 183 transitions, 448 flow [2024-10-11 17:10:00,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 183 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:00,605 INFO L231 Difference]: Finished difference. Result has 182 places, 177 transitions, 380 flow [2024-10-11 17:10:00,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=182, PETRI_TRANSITIONS=177} [2024-10-11 17:10:00,607 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 1 predicate places. [2024-10-11 17:10:00,607 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 177 transitions, 380 flow [2024-10-11 17:10:00,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-10-11 17:10:00,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:00,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:00,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:10:00,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:00,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1177923550, now seen corresponding path program 1 times [2024-10-11 17:10:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:00,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115637598] [2024-10-11 17:10:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:00,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:00,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115637598] [2024-10-11 17:10:00,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115637598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:00,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:00,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:00,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727675158] [2024-10-11 17:10:00,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:00,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:00,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:00,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:00,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:00,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 196 [2024-10-11 17:10:00,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 177 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 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-10-11 17:10:00,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:00,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 196 [2024-10-11 17:10:00,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:01,458 INFO L124 PetriNetUnfolderBase]: 1718/5680 cut-off events. [2024-10-11 17:10:01,459 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-10-11 17:10:01,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8692 conditions, 5680 events. 1718/5680 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 54009 event pairs, 222 based on Foata normal form. 0/5288 useless extension candidates. Maximal degree in co-relation 1233. Up to 2015 conditions per place. [2024-10-11 17:10:01,488 INFO L140 encePairwiseOnDemand]: 190/196 looper letters, 80 selfloop transitions, 6 changer transitions 0/224 dead transitions. [2024-10-11 17:10:01,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 224 transitions, 646 flow [2024-10-11 17:10:01,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2024-10-11 17:10:01,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.782312925170068 [2024-10-11 17:10:01,491 INFO L175 Difference]: Start difference. First operand has 182 places, 177 transitions, 380 flow. Second operand 6 states and 920 transitions. [2024-10-11 17:10:01,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 224 transitions, 646 flow [2024-10-11 17:10:01,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 224 transitions, 644 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:10:01,496 INFO L231 Difference]: Finished difference. Result has 185 places, 176 transitions, 388 flow [2024-10-11 17:10:01,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=388, PETRI_PLACES=185, PETRI_TRANSITIONS=176} [2024-10-11 17:10:01,497 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 4 predicate places. [2024-10-11 17:10:01,498 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 176 transitions, 388 flow [2024-10-11 17:10:01,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 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-10-11 17:10:01,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:01,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:01,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:10:01,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:01,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1892525488, now seen corresponding path program 1 times [2024-10-11 17:10:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:01,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925581141] [2024-10-11 17:10:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:01,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:01,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925581141] [2024-10-11 17:10:01,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925581141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:01,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:01,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:01,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682174123] [2024-10-11 17:10:01,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:01,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:01,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:01,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:01,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:01,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 196 [2024-10-11 17:10:01,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 176 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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-10-11 17:10:01,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:01,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 196 [2024-10-11 17:10:01,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:02,786 INFO L124 PetriNetUnfolderBase]: 3893/14603 cut-off events. [2024-10-11 17:10:02,786 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-10-11 17:10:02,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21154 conditions, 14603 events. 3893/14603 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 164191 event pairs, 1530 based on Foata normal form. 0/13062 useless extension candidates. Maximal degree in co-relation 20044. Up to 3516 conditions per place. [2024-10-11 17:10:02,860 INFO L140 encePairwiseOnDemand]: 177/196 looper letters, 58 selfloop transitions, 14 changer transitions 0/209 dead transitions. [2024-10-11 17:10:02,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 209 transitions, 609 flow [2024-10-11 17:10:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2024-10-11 17:10:02,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8350340136054422 [2024-10-11 17:10:02,862 INFO L175 Difference]: Start difference. First operand has 185 places, 176 transitions, 388 flow. Second operand 3 states and 491 transitions. [2024-10-11 17:10:02,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 209 transitions, 609 flow [2024-10-11 17:10:02,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 209 transitions, 597 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:10:02,866 INFO L231 Difference]: Finished difference. Result has 184 places, 190 transitions, 498 flow [2024-10-11 17:10:02,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=184, PETRI_TRANSITIONS=190} [2024-10-11 17:10:02,867 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 3 predicate places. [2024-10-11 17:10:02,867 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 190 transitions, 498 flow [2024-10-11 17:10:02,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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-10-11 17:10:02,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:02,868 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:02,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:10:02,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:02,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1628660468, now seen corresponding path program 1 times [2024-10-11 17:10:02,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:02,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601490478] [2024-10-11 17:10:02,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:02,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601490478] [2024-10-11 17:10:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601490478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:02,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:02,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627402197] [2024-10-11 17:10:02,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:02,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:02,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:02,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:02,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 196 [2024-10-11 17:10:02,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 190 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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-10-11 17:10:02,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:02,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 196 [2024-10-11 17:10:02,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:04,339 INFO L124 PetriNetUnfolderBase]: 4020/16456 cut-off events. [2024-10-11 17:10:04,340 INFO L125 PetriNetUnfolderBase]: For 4426/4601 co-relation queries the response was YES. [2024-10-11 17:10:04,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27144 conditions, 16456 events. 4020/16456 cut-off events. For 4426/4601 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 193973 event pairs, 2411 based on Foata normal form. 46/14958 useless extension candidates. Maximal degree in co-relation 13739. Up to 5498 conditions per place. [2024-10-11 17:10:04,412 INFO L140 encePairwiseOnDemand]: 187/196 looper letters, 52 selfloop transitions, 14 changer transitions 0/214 dead transitions. [2024-10-11 17:10:04,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 214 transitions, 716 flow [2024-10-11 17:10:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2024-10-11 17:10:04,414 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8248299319727891 [2024-10-11 17:10:04,414 INFO L175 Difference]: Start difference. First operand has 184 places, 190 transitions, 498 flow. Second operand 3 states and 485 transitions. [2024-10-11 17:10:04,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 214 transitions, 716 flow [2024-10-11 17:10:04,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 214 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:04,422 INFO L231 Difference]: Finished difference. Result has 186 places, 202 transitions, 596 flow [2024-10-11 17:10:04,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=186, PETRI_TRANSITIONS=202} [2024-10-11 17:10:04,423 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 5 predicate places. [2024-10-11 17:10:04,423 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 202 transitions, 596 flow [2024-10-11 17:10:04,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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-10-11 17:10:04,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:04,424 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:04,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:10:04,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:04,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1927464448, now seen corresponding path program 1 times [2024-10-11 17:10:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:04,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270665116] [2024-10-11 17:10:04,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270665116] [2024-10-11 17:10:04,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270665116] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:10:04,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412112849] [2024-10-11 17:10:04,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:04,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:10:04,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:10:04,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:10:04,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:10:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:04,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:10:04,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:10:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:04,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:10:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:04,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412112849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:10:04,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:10:04,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:10:04,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321347222] [2024-10-11 17:10:04,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:10:04,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:10:04,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:04,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:10:04,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:10:04,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 196 [2024-10-11 17:10:04,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 202 transitions, 596 flow. Second operand has 10 states, 10 states have (on average 150.5) internal successors, (1505), 10 states have internal predecessors, (1505), 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-10-11 17:10:04,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:04,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 196 [2024-10-11 17:10:04,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:05,001 INFO L124 PetriNetUnfolderBase]: 675/2887 cut-off events. [2024-10-11 17:10:05,001 INFO L125 PetriNetUnfolderBase]: For 266/283 co-relation queries the response was YES. [2024-10-11 17:10:05,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4500 conditions, 2887 events. 675/2887 cut-off events. For 266/283 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 24860 event pairs, 56 based on Foata normal form. 106/2870 useless extension candidates. Maximal degree in co-relation 2700. Up to 458 conditions per place. [2024-10-11 17:10:05,020 INFO L140 encePairwiseOnDemand]: 191/196 looper letters, 72 selfloop transitions, 7 changer transitions 0/209 dead transitions. [2024-10-11 17:10:05,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 209 transitions, 722 flow [2024-10-11 17:10:05,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:10:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:10:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1413 transitions. [2024-10-11 17:10:05,023 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8010204081632653 [2024-10-11 17:10:05,023 INFO L175 Difference]: Start difference. First operand has 186 places, 202 transitions, 596 flow. Second operand 9 states and 1413 transitions. [2024-10-11 17:10:05,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 209 transitions, 722 flow [2024-10-11 17:10:05,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 209 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:05,028 INFO L231 Difference]: Finished difference. Result has 149 places, 153 transitions, 446 flow [2024-10-11 17:10:05,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=446, PETRI_PLACES=149, PETRI_TRANSITIONS=153} [2024-10-11 17:10:05,028 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, -32 predicate places. [2024-10-11 17:10:05,029 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 153 transitions, 446 flow [2024-10-11 17:10:05,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 150.5) internal successors, (1505), 10 states have internal predecessors, (1505), 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-10-11 17:10:05,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:05,030 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:05,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:10:05,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 17:10:05,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:05,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash 573959911, now seen corresponding path program 1 times [2024-10-11 17:10:05,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:05,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499862417] [2024-10-11 17:10:05,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:10:05,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:05,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499862417] [2024-10-11 17:10:05,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499862417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:05,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:05,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824396023] [2024-10-11 17:10:05,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:05,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:05,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:05,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:05,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 196 [2024-10-11 17:10:05,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 153 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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-10-11 17:10:05,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:05,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 196 [2024-10-11 17:10:05,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:05,478 INFO L124 PetriNetUnfolderBase]: 260/1294 cut-off events. [2024-10-11 17:10:05,479 INFO L125 PetriNetUnfolderBase]: For 451/472 co-relation queries the response was YES. [2024-10-11 17:10:05,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 1294 events. 260/1294 cut-off events. For 451/472 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8678 event pairs, 132 based on Foata normal form. 7/1209 useless extension candidates. Maximal degree in co-relation 2262. Up to 459 conditions per place. [2024-10-11 17:10:05,488 INFO L140 encePairwiseOnDemand]: 188/196 looper letters, 42 selfloop transitions, 12 changer transitions 0/167 dead transitions. [2024-10-11 17:10:05,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 167 transitions, 598 flow [2024-10-11 17:10:05,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2024-10-11 17:10:05,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8010204081632653 [2024-10-11 17:10:05,490 INFO L175 Difference]: Start difference. First operand has 149 places, 153 transitions, 446 flow. Second operand 3 states and 471 transitions. [2024-10-11 17:10:05,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 167 transitions, 598 flow [2024-10-11 17:10:05,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 167 transitions, 583 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-11 17:10:05,495 INFO L231 Difference]: Finished difference. Result has 148 places, 161 transitions, 529 flow [2024-10-11 17:10:05,495 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=148, PETRI_TRANSITIONS=161} [2024-10-11 17:10:05,496 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, -33 predicate places. [2024-10-11 17:10:05,496 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 161 transitions, 529 flow [2024-10-11 17:10:05,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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-10-11 17:10:05,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:05,497 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:05,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:10:05,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:05,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:05,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1794930462, now seen corresponding path program 1 times [2024-10-11 17:10:05,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:05,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063951480] [2024-10-11 17:10:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:05,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:05,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:05,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063951480] [2024-10-11 17:10:05,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063951480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:05,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:05,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880137598] [2024-10-11 17:10:05,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:05,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:05,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:05,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:05,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:05,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 196 [2024-10-11 17:10:05,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 161 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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-10-11 17:10:05,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:05,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 196 [2024-10-11 17:10:05,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:05,729 INFO L124 PetriNetUnfolderBase]: 291/1366 cut-off events. [2024-10-11 17:10:05,729 INFO L125 PetriNetUnfolderBase]: For 1163/1198 co-relation queries the response was YES. [2024-10-11 17:10:05,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 1366 events. 291/1366 cut-off events. For 1163/1198 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9336 event pairs, 134 based on Foata normal form. 9/1299 useless extension candidates. Maximal degree in co-relation 2719. Up to 501 conditions per place. [2024-10-11 17:10:05,740 INFO L140 encePairwiseOnDemand]: 188/196 looper letters, 49 selfloop transitions, 12 changer transitions 0/176 dead transitions. [2024-10-11 17:10:05,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 176 transitions, 718 flow [2024-10-11 17:10:05,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2024-10-11 17:10:05,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8027210884353742 [2024-10-11 17:10:05,742 INFO L175 Difference]: Start difference. First operand has 148 places, 161 transitions, 529 flow. Second operand 3 states and 472 transitions. [2024-10-11 17:10:05,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 176 transitions, 718 flow [2024-10-11 17:10:05,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 176 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:05,747 INFO L231 Difference]: Finished difference. Result has 150 places, 169 transitions, 615 flow [2024-10-11 17:10:05,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=150, PETRI_TRANSITIONS=169} [2024-10-11 17:10:05,747 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, -31 predicate places. [2024-10-11 17:10:05,747 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 169 transitions, 615 flow [2024-10-11 17:10:05,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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-10-11 17:10:05,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:05,748 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:05,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:10:05,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:05,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:05,749 INFO L85 PathProgramCache]: Analyzing trace with hash 508953308, now seen corresponding path program 1 times [2024-10-11 17:10:05,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:05,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228393145] [2024-10-11 17:10:05,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:05,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:05,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:10:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:05,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:10:05,793 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:10:05,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-10-11 17:10:05,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-11 17:10:05,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-11 17:10:05,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-11 17:10:05,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-11 17:10:05,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-11 17:10:05,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-11 17:10:05,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-10-11 17:10:05,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-11 17:10:05,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-11 17:10:05,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-11 17:10:05,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-11 17:10:05,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-11 17:10:05,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-11 17:10:05,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-11 17:10:05,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-11 17:10:05,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:10:05,795 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:05,796 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:10:05,796 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:10:05,817 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:10:05,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 245 transitions, 517 flow [2024-10-11 17:10:05,868 INFO L124 PetriNetUnfolderBase]: 54/523 cut-off events. [2024-10-11 17:10:05,869 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-11 17:10:05,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 523 events. 54/523 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1974 event pairs, 1 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 350. Up to 16 conditions per place. [2024-10-11 17:10:05,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 245 transitions, 517 flow [2024-10-11 17:10:05,875 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 245 transitions, 517 flow [2024-10-11 17:10:05,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:05,876 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;@52510ddf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:05,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 17:10:05,880 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:05,880 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2024-10-11 17:10:05,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:05,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:05,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:05,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:05,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash -625575524, now seen corresponding path program 1 times [2024-10-11 17:10:05,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:05,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002574810] [2024-10-11 17:10:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:05,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:05,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002574810] [2024-10-11 17:10:05,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002574810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:05,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:05,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:05,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165461788] [2024-10-11 17:10:05,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:05,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:05,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:05,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:05,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 245 [2024-10-11 17:10:05,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 245 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 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-10-11 17:10:05,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:05,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 245 [2024-10-11 17:10:05,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:09,273 INFO L124 PetriNetUnfolderBase]: 8948/35254 cut-off events. [2024-10-11 17:10:09,273 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2024-10-11 17:10:09,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48492 conditions, 35254 events. 8948/35254 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 458910 event pairs, 5659 based on Foata normal form. 7668/39699 useless extension candidates. Maximal degree in co-relation 6249. Up to 12802 conditions per place. [2024-10-11 17:10:09,474 INFO L140 encePairwiseOnDemand]: 218/245 looper letters, 39 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2024-10-11 17:10:09,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 226 transitions, 561 flow [2024-10-11 17:10:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2024-10-11 17:10:09,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8585034013605443 [2024-10-11 17:10:09,476 INFO L175 Difference]: Start difference. First operand has 225 places, 245 transitions, 517 flow. Second operand 3 states and 631 transitions. [2024-10-11 17:10:09,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 226 transitions, 561 flow [2024-10-11 17:10:09,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 226 transitions, 561 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:09,479 INFO L231 Difference]: Finished difference. Result has 226 places, 220 transitions, 477 flow [2024-10-11 17:10:09,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=226, PETRI_TRANSITIONS=220} [2024-10-11 17:10:09,480 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 1 predicate places. [2024-10-11 17:10:09,480 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 220 transitions, 477 flow [2024-10-11 17:10:09,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 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-10-11 17:10:09,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:09,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:09,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:10:09,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:09,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 884343618, now seen corresponding path program 1 times [2024-10-11 17:10:09,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:09,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807381393] [2024-10-11 17:10:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:09,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:09,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:09,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807381393] [2024-10-11 17:10:09,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807381393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:09,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:09,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:09,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406714839] [2024-10-11 17:10:09,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:09,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:09,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:09,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:09,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 245 [2024-10-11 17:10:09,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 220 transitions, 477 flow. Second operand has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 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-10-11 17:10:09,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:09,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 245 [2024-10-11 17:10:09,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:14,791 INFO L124 PetriNetUnfolderBase]: 19555/52048 cut-off events. [2024-10-11 17:10:14,792 INFO L125 PetriNetUnfolderBase]: For 1359/1359 co-relation queries the response was YES. [2024-10-11 17:10:14,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81208 conditions, 52048 events. 19555/52048 cut-off events. For 1359/1359 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 636389 event pairs, 2086 based on Foata normal form. 0/48476 useless extension candidates. Maximal degree in co-relation 76339. Up to 20048 conditions per place. [2024-10-11 17:10:15,106 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 112 selfloop transitions, 6 changer transitions 0/291 dead transitions. [2024-10-11 17:10:15,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 291 transitions, 855 flow [2024-10-11 17:10:15,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1162 transitions. [2024-10-11 17:10:15,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7904761904761904 [2024-10-11 17:10:15,109 INFO L175 Difference]: Start difference. First operand has 226 places, 220 transitions, 477 flow. Second operand 6 states and 1162 transitions. [2024-10-11 17:10:15,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 291 transitions, 855 flow [2024-10-11 17:10:15,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 291 transitions, 853 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:10:15,113 INFO L231 Difference]: Finished difference. Result has 229 places, 219 transitions, 485 flow [2024-10-11 17:10:15,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=229, PETRI_TRANSITIONS=219} [2024-10-11 17:10:15,115 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 4 predicate places. [2024-10-11 17:10:15,115 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 219 transitions, 485 flow [2024-10-11 17:10:15,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 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-10-11 17:10:15,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:15,115 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:15,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:10:15,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:15,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash 533651924, now seen corresponding path program 1 times [2024-10-11 17:10:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498220857] [2024-10-11 17:10:15,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:15,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:15,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498220857] [2024-10-11 17:10:15,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498220857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:15,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:15,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:15,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767649942] [2024-10-11 17:10:15,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:15,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:15,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:15,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:15,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:15,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 245 [2024-10-11 17:10:15,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 219 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-10-11 17:10:15,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:15,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 245 [2024-10-11 17:10:15,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand