./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/10-synch_02-thread_nonunique.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/10-synch_02-thread_nonunique.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 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:09:02,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:09:02,124 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:02,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:09:02,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:09:02,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:09:02,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:09:02,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:09:02,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:09:02,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:09:02,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:09:02,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:09:02,167 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:09:02,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:09:02,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:09:02,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:09:02,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:09:02,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:09:02,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:09:02,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:09:02,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:09:02,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:09:02,174 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:09:02,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:09:02,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:09:02,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:09:02,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:09:02,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:09:02,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:09:02,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:09:02,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:09:02,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:09:02,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:09:02,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:09:02,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:09:02,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:09:02,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:09:02,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:09:02,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:09:02,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:09:02,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:09:02,182 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 -> 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba [2024-10-11 17:09:02,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:09:02,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:09:02,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:09:02,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:09:02,482 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:09:02,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i [2024-10-11 17:09:03,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:09:04,112 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:09:04,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i [2024-10-11 17:09:04,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c71fbefbf/0c111de0555e4e9e8773d79895978603/FLAGa72b33deb [2024-10-11 17:09:04,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c71fbefbf/0c111de0555e4e9e8773d79895978603 [2024-10-11 17:09:04,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:09:04,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:09:04,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:09:04,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:09:04,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:09:04,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:09:04" (1/1) ... [2024-10-11 17:09:04,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f21048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:04, skipping insertion in model container [2024-10-11 17:09:04,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:09:04" (1/1) ... [2024-10-11 17:09:04,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:09:04,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:09:04,918 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:09:04,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:09:05,040 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:09:05,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:05 WrapperNode [2024-10-11 17:09:05,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:09:05,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:09:05,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:09:05,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:09:05,049 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:05" (1/1) ... [2024-10-11 17:09:05,068 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:05" (1/1) ... [2024-10-11 17:09:05,091 INFO L138 Inliner]: procedures = 259, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-10-11 17:09:05,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:09:05,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:09:05,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:09:05,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:09:05,102 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:05" (1/1) ... [2024-10-11 17:09:05,103 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:05" (1/1) ... [2024-10-11 17:09:05,106 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:05" (1/1) ... [2024-10-11 17:09:05,106 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:05" (1/1) ... [2024-10-11 17:09:05,114 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:05" (1/1) ... [2024-10-11 17:09:05,120 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:05" (1/1) ... [2024-10-11 17:09:05,121 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:05" (1/1) ... [2024-10-11 17:09:05,123 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:05" (1/1) ... [2024-10-11 17:09:05,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:09:05,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:09:05,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:09:05,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:09:05,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:05" (1/1) ... [2024-10-11 17:09:05,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:09:05,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:09:05,163 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:05,170 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:05,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:09:05,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:09:05,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:09:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:09:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 17:09:05,214 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 17:09:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:09:05,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:09:05,215 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:05,435 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:09:05,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:09:05,600 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:09:05,600 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:09:05,612 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:09:05,613 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:09:05,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:09:05 BoogieIcfgContainer [2024-10-11 17:09:05,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:09:05,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:09:05,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:09:05,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:09:05,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:09:04" (1/3) ... [2024-10-11 17:09:05,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d613f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:09:05, skipping insertion in model container [2024-10-11 17:09:05,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:05" (2/3) ... [2024-10-11 17:09:05,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d613f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:09:05, skipping insertion in model container [2024-10-11 17:09:05,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:09:05" (3/3) ... [2024-10-11 17:09:05,624 INFO L112 eAbstractionObserver]: Analyzing ICFG 10-synch_02-thread_nonunique.i [2024-10-11 17:09:05,640 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:09:05,640 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 17:09:05,640 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:09:05,691 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:09:05,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 119 flow [2024-10-11 17:09:05,759 INFO L124 PetriNetUnfolderBase]: 5/86 cut-off events. [2024-10-11 17:09:05,763 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:09:05,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 86 events. 5/86 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 42. Up to 4 conditions per place. [2024-10-11 17:09:05,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 56 transitions, 119 flow [2024-10-11 17:09:05,772 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 56 transitions, 119 flow [2024-10-11 17:09:05,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:09:05,791 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;@545b635, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:09:05,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 17:09:05,804 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:09:05,804 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-10-11 17:09:05,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:09:05,804 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:05,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:09:05,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 17:09:05,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:05,811 INFO L85 PathProgramCache]: Analyzing trace with hash -556190281, now seen corresponding path program 1 times [2024-10-11 17:09:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641335977] [2024-10-11 17:09:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:06,081 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:06,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:06,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641335977] [2024-10-11 17:09:06,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641335977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:06,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:06,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:09:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124905796] [2024-10-11 17:09:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:06,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:09:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:06,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:09:06,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:09:06,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 56 [2024-10-11 17:09:06,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:06,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:06,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 56 [2024-10-11 17:09:06,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:06,235 INFO L124 PetriNetUnfolderBase]: 0/73 cut-off events. [2024-10-11 17:09:06,235 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:09:06,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 73 events. 0/73 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 2/70 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2024-10-11 17:09:06,238 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 5 selfloop transitions, 4 changer transitions 7/54 dead transitions. [2024-10-11 17:09:06,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 137 flow [2024-10-11 17:09:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:09:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:09:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-10-11 17:09:06,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2024-10-11 17:09:06,251 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 119 flow. Second operand 3 states and 146 transitions. [2024-10-11 17:09:06,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 137 flow [2024-10-11 17:09:06,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 137 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:09:06,257 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 115 flow [2024-10-11 17:09:06,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-10-11 17:09:06,264 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2024-10-11 17:09:06,264 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 115 flow [2024-10-11 17:09:06,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:06,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:06,265 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:09:06,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:09:06,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 17:09:06,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2059474795, now seen corresponding path program 1 times [2024-10-11 17:09:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:06,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578907595] [2024-10-11 17:09:06,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:06,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:06,794 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:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:06,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578907595] [2024-10-11 17:09:06,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578907595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:06,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:06,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:09:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802939904] [2024-10-11 17:09:06,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:06,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:09:06,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:06,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:09:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:09:06,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2024-10-11 17:09:06,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 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:06,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:06,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2024-10-11 17:09:06,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:06,988 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2024-10-11 17:09:06,988 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 17:09:06,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 64 events. 0/64 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 0. Up to 21 conditions per place. [2024-10-11 17:09:06,989 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 15 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2024-10-11 17:09:06,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 153 flow [2024-10-11 17:09:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:09:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:09:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-10-11 17:09:06,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2024-10-11 17:09:06,995 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 115 flow. Second operand 6 states and 207 transitions. [2024-10-11 17:09:06,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 153 flow [2024-10-11 17:09:06,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:09:06,998 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 115 flow [2024-10-11 17:09:07,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-10-11 17:09:07,002 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2024-10-11 17:09:07,003 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 115 flow [2024-10-11 17:09:07,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 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:07,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:07,004 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] [2024-10-11 17:09:07,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:09:07,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 17:09:07,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1180462258, now seen corresponding path program 1 times [2024-10-11 17:09:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444328106] [2024-10-11 17:09:07,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:07,060 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:07,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:07,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444328106] [2024-10-11 17:09:07,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444328106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:07,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:07,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:09:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776753861] [2024-10-11 17:09:07,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:07,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:09:07,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:07,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:09:07,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:09:07,072 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 56 [2024-10-11 17:09:07,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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:07,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:07,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 56 [2024-10-11 17:09:07,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:07,096 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2024-10-11 17:09:07,096 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-10-11 17:09:07,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 63 events. 0/63 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-10-11 17:09:07,097 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 4 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2024-10-11 17:09:07,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 125 flow [2024-10-11 17:09:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:09:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:09:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-10-11 17:09:07,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2024-10-11 17:09:07,104 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 115 flow. Second operand 3 states and 148 transitions. [2024-10-11 17:09:07,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 125 flow [2024-10-11 17:09:07,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 115 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:09:07,106 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 107 flow [2024-10-11 17:09:07,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2024-10-11 17:09:07,107 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2024-10-11 17:09:07,109 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 107 flow [2024-10-11 17:09:07,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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:07,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:07,110 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] [2024-10-11 17:09:07,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:09:07,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 17:09:07,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:07,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1951054593, now seen corresponding path program 1 times [2024-10-11 17:09:07,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:07,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023883468] [2024-10-11 17:09:07,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:07,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:07,213 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:09:07,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:07,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023883468] [2024-10-11 17:09:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023883468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:09:07,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837715394] [2024-10-11 17:09:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:07,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:09:07,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:09:07,217 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:09:07,219 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:09:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:07,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:09:07,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:09:07,379 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:09:07,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:09:07,435 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:09:07,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837715394] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:09:07,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:09:07,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:09:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517106162] [2024-10-11 17:09:07,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:09:07,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:09:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:09:07,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:09:07,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 56 [2024-10-11 17:09:07,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 107 flow. Second operand has 10 states, 10 states have (on average 41.3) internal successors, (413), 10 states have internal predecessors, (413), 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:07,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:07,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 56 [2024-10-11 17:09:07,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:07,670 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2024-10-11 17:09:07,671 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:09:07,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 41 events. 0/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 16 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-10-11 17:09:07,671 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 5 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-10-11 17:09:07,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 92 flow [2024-10-11 17:09:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:09:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:09:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2024-10-11 17:09:07,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2024-10-11 17:09:07,674 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 107 flow. Second operand 6 states and 244 transitions. [2024-10-11 17:09:07,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 92 flow [2024-10-11 17:09:07,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 17:09:07,676 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 74 flow [2024-10-11 17:09:07,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-10-11 17:09:07,677 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -17 predicate places. [2024-10-11 17:09:07,677 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 74 flow [2024-10-11 17:09:07,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 41.3) internal successors, (413), 10 states have internal predecessors, (413), 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:07,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:07,678 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] [2024-10-11 17:09:07,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:09:07,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:09:07,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 17:09:07,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash 145983485, now seen corresponding path program 1 times [2024-10-11 17:09:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:07,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551603856] [2024-10-11 17:09:07,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:09:07,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:09:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:09:07,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:09:07,954 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:09:07,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-11 17:09:07,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-10-11 17:09:07,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-10-11 17:09:07,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-10-11 17:09:07,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-10-11 17:09:07,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:09:07,959 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 17:09:07,962 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:09:07,962 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:09:07,982 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:09:07,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 150 flow [2024-10-11 17:09:08,016 INFO L124 PetriNetUnfolderBase]: 10/154 cut-off events. [2024-10-11 17:09:08,016 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:09:08,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 154 events. 10/154 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 300 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 88. Up to 8 conditions per place. [2024-10-11 17:09:08,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 67 transitions, 150 flow [2024-10-11 17:09:08,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 150 flow [2024-10-11 17:09:08,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:09:08,026 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;@545b635, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:09:08,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 17:09:08,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:09:08,035 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-10-11 17:09:08,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:09:08,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:08,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:09:08,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:09:08,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1225650938, now seen corresponding path program 1 times [2024-10-11 17:09:08,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:08,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584088863] [2024-10-11 17:09:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:08,075 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:08,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:08,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584088863] [2024-10-11 17:09:08,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584088863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:08,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:08,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:09:08,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509230284] [2024-10-11 17:09:08,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:08,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:09:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:08,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:09:08,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:09:08,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 67 [2024-10-11 17:09:08,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:08,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:08,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 67 [2024-10-11 17:09:08,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:08,168 INFO L124 PetriNetUnfolderBase]: 2/149 cut-off events. [2024-10-11 17:09:08,168 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 17:09:08,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 149 events. 2/149 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 329 event pairs, 0 based on Foata normal form. 3/142 useless extension candidates. Maximal degree in co-relation 36. Up to 20 conditions per place. [2024-10-11 17:09:08,169 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 13 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-10-11 17:09:08,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 194 flow [2024-10-11 17:09:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:09:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:09:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2024-10-11 17:09:08,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8905472636815921 [2024-10-11 17:09:08,173 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 150 flow. Second operand 3 states and 179 transitions. [2024-10-11 17:09:08,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 194 flow [2024-10-11 17:09:08,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:09:08,175 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 170 flow [2024-10-11 17:09:08,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2024-10-11 17:09:08,177 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2024-10-11 17:09:08,177 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 170 flow [2024-10-11 17:09:08,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:08,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:08,177 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:09:08,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:09:08,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:09:08,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:08,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1637995509, now seen corresponding path program 1 times [2024-10-11 17:09:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:08,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599122607] [2024-10-11 17:09:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:08,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:08,383 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:08,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:08,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599122607] [2024-10-11 17:09:08,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599122607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:08,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:08,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:09:08,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727404204] [2024-10-11 17:09:08,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:08,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:09:08,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:08,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:09:08,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:09:08,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2024-10-11 17:09:08,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 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:08,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:08,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2024-10-11 17:09:08,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:08,528 INFO L124 PetriNetUnfolderBase]: 2/146 cut-off events. [2024-10-11 17:09:08,529 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 17:09:08,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 146 events. 2/146 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 319 event pairs, 1 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 45. Up to 52 conditions per place. [2024-10-11 17:09:08,529 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 20 selfloop transitions, 6 changer transitions 0/66 dead transitions. [2024-10-11 17:09:08,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 220 flow [2024-10-11 17:09:08,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:09:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:09:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 265 transitions. [2024-10-11 17:09:08,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6592039800995025 [2024-10-11 17:09:08,531 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 170 flow. Second operand 6 states and 265 transitions. [2024-10-11 17:09:08,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 220 flow [2024-10-11 17:09:08,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:09:08,534 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 176 flow [2024-10-11 17:09:08,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2024-10-11 17:09:08,535 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-10-11 17:09:08,535 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 176 flow [2024-10-11 17:09:08,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 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:08,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:08,535 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] [2024-10-11 17:09:08,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:09:08,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:09:08,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash -121608859, now seen corresponding path program 1 times [2024-10-11 17:09:08,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:08,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030990685] [2024-10-11 17:09:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:08,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:08,561 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:08,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030990685] [2024-10-11 17:09:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030990685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:08,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:09:08,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142491460] [2024-10-11 17:09:08,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:08,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:09:08,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:08,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:09:08,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:09:08,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 67 [2024-10-11 17:09:08,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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:08,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:08,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 67 [2024-10-11 17:09:08,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:08,630 INFO L124 PetriNetUnfolderBase]: 18/301 cut-off events. [2024-10-11 17:09:08,630 INFO L125 PetriNetUnfolderBase]: For 69/98 co-relation queries the response was YES. [2024-10-11 17:09:08,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 301 events. 18/301 cut-off events. For 69/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1409 event pairs, 8 based on Foata normal form. 3/276 useless extension candidates. Maximal degree in co-relation 174. Up to 34 conditions per place. [2024-10-11 17:09:08,632 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 11 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2024-10-11 17:09:08,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 224 flow [2024-10-11 17:09:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:09:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:09:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2024-10-11 17:09:08,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.900497512437811 [2024-10-11 17:09:08,634 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 176 flow. Second operand 3 states and 181 transitions. [2024-10-11 17:09:08,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 224 flow [2024-10-11 17:09:08,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 212 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:09:08,636 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 194 flow [2024-10-11 17:09:08,636 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2024-10-11 17:09:08,637 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2024-10-11 17:09:08,637 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 194 flow [2024-10-11 17:09:08,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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:08,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:08,638 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] [2024-10-11 17:09:08,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:09:08,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:09:08,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1349972437, now seen corresponding path program 1 times [2024-10-11 17:09:08,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:08,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980545441] [2024-10-11 17:09:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:08,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:08,696 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:09:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:08,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980545441] [2024-10-11 17:09:08,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980545441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:09:08,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948144993] [2024-10-11 17:09:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:08,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:09:08,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:09:08,699 INFO L229 MonitoredProcess]: Starting monitored process 3 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:09:08,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:09:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:08,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:09:08,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:09:08,802 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:09:08,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:09:08,847 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:09:08,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948144993] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:09:08,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:09:08,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:09:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728351592] [2024-10-11 17:09:08,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:09:08,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:09:08,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:08,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:09:08,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:09:09,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 67 [2024-10-11 17:09:09,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 194 flow. Second operand has 10 states, 10 states have (on average 50.3) internal successors, (503), 10 states have internal predecessors, (503), 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:09,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:09,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 67 [2024-10-11 17:09:09,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:09,087 INFO L124 PetriNetUnfolderBase]: 3/85 cut-off events. [2024-10-11 17:09:09,087 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:09:09,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 85 events. 3/85 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 1 based on Foata normal form. 2/82 useless extension candidates. Maximal degree in co-relation 78. Up to 9 conditions per place. [2024-10-11 17:09:09,088 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 7 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2024-10-11 17:09:09,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 168 flow [2024-10-11 17:09:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:09:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:09:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 448 transitions. [2024-10-11 17:09:09,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7429519071310116 [2024-10-11 17:09:09,090 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 194 flow. Second operand 9 states and 448 transitions. [2024-10-11 17:09:09,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 168 flow [2024-10-11 17:09:09,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:09:09,092 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 142 flow [2024-10-11 17:09:09,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=142, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-10-11 17:09:09,092 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2024-10-11 17:09:09,093 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 142 flow [2024-10-11 17:09:09,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 50.3) internal successors, (503), 10 states have internal predecessors, (503), 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:09,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:09,093 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] [2024-10-11 17:09:09,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:09:09,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:09:09,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:09:09,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash 99772284, now seen corresponding path program 1 times [2024-10-11 17:09:09,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:09,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336999644] [2024-10-11 17:09:09,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:09,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:09,326 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:09:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:09,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336999644] [2024-10-11 17:09:09,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336999644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:09,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:09:09,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:09:09,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139539669] [2024-10-11 17:09:09,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:09,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:09:09,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:09,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:09:09,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:09:09,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 67 [2024-10-11 17:09:09,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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:09,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:09,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 67 [2024-10-11 17:09:09,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:09,353 INFO L124 PetriNetUnfolderBase]: 7/111 cut-off events. [2024-10-11 17:09:09,354 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 17:09:09,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 111 events. 7/111 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 303 event pairs, 3 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 137. Up to 19 conditions per place. [2024-10-11 17:09:09,354 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 7 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2024-10-11 17:09:09,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 174 flow [2024-10-11 17:09:09,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:09:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:09:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2024-10-11 17:09:09,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8805970149253731 [2024-10-11 17:09:09,356 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 142 flow. Second operand 3 states and 177 transitions. [2024-10-11 17:09:09,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 174 flow [2024-10-11 17:09:09,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 159 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-11 17:09:09,357 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 163 flow [2024-10-11 17:09:09,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-10-11 17:09:09,358 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-10-11 17:09:09,358 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 163 flow [2024-10-11 17:09:09,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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:09,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:09,359 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] [2024-10-11 17:09:09,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:09:09,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 17:09:09,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1517586101, now seen corresponding path program 1 times [2024-10-11 17:09:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:09,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628403483] [2024-10-11 17:09:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:09,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:09:09,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:09:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:09:09,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:09:09,390 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:09:09,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2024-10-11 17:09:09,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-10-11 17:09:09,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-10-11 17:09:09,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-11 17:09:09,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-10-11 17:09:09,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-10-11 17:09:09,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:09:09,391 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 17:09:09,425 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-11 17:09:09,425 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:09:09,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:09:09 BasicIcfg [2024-10-11 17:09:09,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:09:09,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:09:09,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:09:09,432 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:09:09,432 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:09:05" (3/4) ... [2024-10-11 17:09:09,438 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:09:09,439 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:09:09,439 INFO L158 Benchmark]: Toolchain (without parser) took 5032.30ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 136.6MB in the beginning and 105.0MB in the end (delta: 31.7MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. [2024-10-11 17:09:09,439 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:09:09,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.06ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 106.6MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 17:09:09,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.33ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 104.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:09:09,440 INFO L158 Benchmark]: Boogie Preprocessor took 33.88ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 103.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:09:09,440 INFO L158 Benchmark]: RCFGBuilder took 486.79ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 128.6MB in the end (delta: -25.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 17:09:09,441 INFO L158 Benchmark]: TraceAbstraction took 3814.86ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 127.7MB in the beginning and 105.0MB in the end (delta: 22.7MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2024-10-11 17:09:09,441 INFO L158 Benchmark]: Witness Printer took 6.92ms. Allocated memory is still 228.6MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:09:09,442 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.06ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 106.6MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.33ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 104.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.88ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 103.5MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 486.79ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 128.6MB in the end (delta: -25.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3814.86ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 127.7MB in the beginning and 105.0MB in the end (delta: 22.7MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. * Witness Printer took 6.92ms. Allocated memory is still 228.6MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 919]: Data race detected Data race detected The following path leads to a data race: [L917] 0 int myglobal; VAL [myglobal=0] [L923] 0 pthread_t id[10]; VAL [id={8:0}, myglobal=0] [L924] 0 int i; VAL [id={8:0}, myglobal=0] [L925] 0 i=0 VAL [i=0, id={8:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [i=0, id={8:0}, myglobal=0] [L926] 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [i=0, id={8:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=0, id={8:0}, myglobal=0] [L925] 0 i++ VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L926] 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L919] 2 myglobal=42 VAL [\old(arg)={0:0}, arg={0:0}, myglobal=42] [L919] 1 myglobal=42 VAL [\old(arg)={0:0}, arg={0:0}, myglobal=42] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] and C: myglobal=42 [919] - UnprovableResult [Line: 928]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 64 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 127 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 440 IncrementalHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 36 mSDtfsCounter, 440 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 355 SizeOfPredicates, 2 NumberOfNonLiveVariables, 92 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 74 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 514 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 10 mSDtfsCounter, 514 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 394 SizeOfPredicates, 2 NumberOfNonLiveVariables, 92 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 11/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 17:09:09,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE