./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/pthread-lit/fkp2013-2.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/pthread-lit/fkp2013-2.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 e812004a84a4494a04d3a026bee09dbf1dbf7d202520f02258b12ac817a7a74e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:02:00,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:02:00,170 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:02:00,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:02:00,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:02:00,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:02:00,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:02:00,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:02:00,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:02:00,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:02:00,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:02:00,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:02:00,204 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:02:00,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:02:00,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:02:00,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:02:00,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:02:00,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:02:00,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:02:00,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:02:00,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:02:00,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:02:00,207 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:02:00,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:02:00,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:02:00,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:02:00,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:02:00,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:02:00,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:02:00,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:02:00,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:02:00,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:00,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:02:00,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:02:00,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:02:00,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:02:00,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:02:00,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:02:00,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:02:00,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:02:00,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:02:00,211 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 -> e812004a84a4494a04d3a026bee09dbf1dbf7d202520f02258b12ac817a7a74e [2024-10-11 17:02:00,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:02:00,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:02:00,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:02:00,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:02:00,443 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:02:00,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/fkp2013-2.i [2024-10-11 17:02:01,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:02:01,992 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:02:01,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/fkp2013-2.i [2024-10-11 17:02:02,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/39edeaffe/97e542b040164eec8c8827ee8d40bcb4/FLAG00f8859d9 [2024-10-11 17:02:02,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/39edeaffe/97e542b040164eec8c8827ee8d40bcb4 [2024-10-11 17:02:02,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:02:02,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:02:02,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:02,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:02:02,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:02:02,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@459d839a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02, skipping insertion in model container [2024-10-11 17:02:02,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:02:02,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:02,385 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:02:02,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:02,513 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:02:02,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02 WrapperNode [2024-10-11 17:02:02,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:02,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:02,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:02:02,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:02:02,519 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:02:02" (1/1) ... [2024-10-11 17:02:02,528 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:02:02" (1/1) ... [2024-10-11 17:02:02,544 INFO L138 Inliner]: procedures = 171, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2024-10-11 17:02:02,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:02,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:02:02,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:02:02,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:02:02,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:02:02,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:02:02,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:02:02,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:02:02,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02" (1/1) ... [2024-10-11 17:02:02,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:02,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:02:02,597 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:02:02,600 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:02:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-11 17:02:02,641 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-11 17:02:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-11 17:02:02,642 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-11 17:02:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:02:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:02:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:02:02,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:02:02,645 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:02:02,757 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:02:02,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:02:02,886 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:02:02,886 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:02:02,904 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:02:02,905 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 17:02:02,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:02 BoogieIcfgContainer [2024-10-11 17:02:02,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:02:02,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:02:02,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:02:02,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:02:02,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:02:02" (1/3) ... [2024-10-11 17:02:02,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508274cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:02, skipping insertion in model container [2024-10-11 17:02:02,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:02" (2/3) ... [2024-10-11 17:02:02,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508274cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:02, skipping insertion in model container [2024-10-11 17:02:02,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:02" (3/3) ... [2024-10-11 17:02:02,915 INFO L112 eAbstractionObserver]: Analyzing ICFG fkp2013-2.i [2024-10-11 17:02:02,931 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:02:02,932 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 17:02:02,932 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:02:02,981 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:03,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 79 transitions, 166 flow [2024-10-11 17:02:03,058 INFO L124 PetriNetUnfolderBase]: 4/89 cut-off events. [2024-10-11 17:02:03,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:03,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 4/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2024-10-11 17:02:03,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 79 transitions, 166 flow [2024-10-11 17:02:03,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 78 transitions, 163 flow [2024-10-11 17:02:03,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:03,088 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;@31ab9491, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:03,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-11 17:02:03,093 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:03,097 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-10-11 17:02:03,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:03,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:03,098 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:02:03,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:02:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash 492523335, now seen corresponding path program 1 times [2024-10-11 17:02:03,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:03,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616998074] [2024-10-11 17:02:03,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:03,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:03,305 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:02:03,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616998074] [2024-10-11 17:02:03,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616998074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:03,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:03,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:03,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123803321] [2024-10-11 17:02:03,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:03,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:03,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:03,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 79 [2024-10-11 17:02:03,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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:02:03,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:03,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 79 [2024-10-11 17:02:03,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:03,427 INFO L124 PetriNetUnfolderBase]: 11/187 cut-off events. [2024-10-11 17:02:03,427 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:02:03,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 187 events. 11/187 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 717 event pairs, 11 based on Foata normal form. 18/178 useless extension candidates. Maximal degree in co-relation 194. Up to 31 conditions per place. [2024-10-11 17:02:03,430 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 9 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-10-11 17:02:03,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 173 flow [2024-10-11 17:02:03,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2024-10-11 17:02:03,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8607594936708861 [2024-10-11 17:02:03,446 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 163 flow. Second operand 3 states and 204 transitions. [2024-10-11 17:02:03,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 173 flow [2024-10-11 17:02:03,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:03,452 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 154 flow [2024-10-11 17:02:03,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2024-10-11 17:02:03,457 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, -2 predicate places. [2024-10-11 17:02:03,457 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 154 flow [2024-10-11 17:02:03,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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:02:03,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:03,458 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] [2024-10-11 17:02:03,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:02:03,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:02:03,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash 612279905, now seen corresponding path program 1 times [2024-10-11 17:02:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:03,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706709431] [2024-10-11 17:02:03,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:03,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:03,514 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:02:03,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:03,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706709431] [2024-10-11 17:02:03,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706709431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:03,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:03,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131616692] [2024-10-11 17:02:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:03,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:03,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:03,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:03,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:03,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 79 [2024-10-11 17:02:03,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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:02:03,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:03,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 79 [2024-10-11 17:02:03,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:03,597 INFO L124 PetriNetUnfolderBase]: 7/165 cut-off events. [2024-10-11 17:02:03,597 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:02:03,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 165 events. 7/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 620 event pairs, 3 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 179. Up to 19 conditions per place. [2024-10-11 17:02:03,600 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 9 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2024-10-11 17:02:03,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 189 flow [2024-10-11 17:02:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2024-10-11 17:02:03,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8860759493670886 [2024-10-11 17:02:03,603 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 154 flow. Second operand 3 states and 210 transitions. [2024-10-11 17:02:03,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 189 flow [2024-10-11 17:02:03,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:03,608 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 178 flow [2024-10-11 17:02:03,608 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2024-10-11 17:02:03,609 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, -1 predicate places. [2024-10-11 17:02:03,609 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 178 flow [2024-10-11 17:02:03,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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:02:03,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:03,610 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:03,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:02:03,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:02:03,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash 217715466, now seen corresponding path program 1 times [2024-10-11 17:02:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:03,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079364759] [2024-10-11 17:02:03,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:03,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:03,712 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:02:03,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:03,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079364759] [2024-10-11 17:02:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079364759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:03,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:03,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:03,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901546721] [2024-10-11 17:02:03,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:03,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:03,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:03,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:03,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:03,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 79 [2024-10-11 17:02:03,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:02:03,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:03,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 79 [2024-10-11 17:02:03,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:03,781 INFO L124 PetriNetUnfolderBase]: 6/179 cut-off events. [2024-10-11 17:02:03,782 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2024-10-11 17:02:03,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 179 events. 6/179 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 654 event pairs, 2 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 218. Up to 23 conditions per place. [2024-10-11 17:02:03,783 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 11 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2024-10-11 17:02:03,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 77 transitions, 218 flow [2024-10-11 17:02:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2024-10-11 17:02:03,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8818565400843882 [2024-10-11 17:02:03,785 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 178 flow. Second operand 3 states and 209 transitions. [2024-10-11 17:02:03,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 77 transitions, 218 flow [2024-10-11 17:02:03,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:03,787 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 202 flow [2024-10-11 17:02:03,788 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2024-10-11 17:02:03,788 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, 1 predicate places. [2024-10-11 17:02:03,788 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 202 flow [2024-10-11 17:02:03,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:02:03,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:03,789 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:03,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:02:03,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:02:03,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:03,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1414451964, now seen corresponding path program 1 times [2024-10-11 17:02:03,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:03,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206049256] [2024-10-11 17:02:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:03,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:03,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:03,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:03,857 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:03,857 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-11 17:02:03,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-10-11 17:02:03,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-10-11 17:02:03,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-10-11 17:02:03,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-10-11 17:02:03,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-10-11 17:02:03,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-10-11 17:02:03,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-10-11 17:02:03,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-10-11 17:02:03,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:02:03,864 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 17:02:03,867 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:02:03,867 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:02:03,921 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:02:03,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 114 transitions, 248 flow [2024-10-11 17:02:03,945 INFO L124 PetriNetUnfolderBase]: 5/120 cut-off events. [2024-10-11 17:02:03,946 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:02:03,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 120 events. 5/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 127. Up to 6 conditions per place. [2024-10-11 17:02:03,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 114 transitions, 248 flow [2024-10-11 17:02:03,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 199 flow [2024-10-11 17:02:03,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:03,953 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;@31ab9491, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:03,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 17:02:03,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:03,955 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-10-11 17:02:03,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:03,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:03,957 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:02:03,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:02:03,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash -139489401, now seen corresponding path program 1 times [2024-10-11 17:02:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734932874] [2024-10-11 17:02:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:03,994 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:02:03,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734932874] [2024-10-11 17:02:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734932874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:03,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:03,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:03,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543755141] [2024-10-11 17:02:03,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:03,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:03,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:03,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:03,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:04,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2024-10-11 17:02:04,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:04,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:04,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2024-10-11 17:02:04,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:04,108 INFO L124 PetriNetUnfolderBase]: 65/495 cut-off events. [2024-10-11 17:02:04,109 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-10-11 17:02:04,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 495 events. 65/495 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2957 event pairs, 65 based on Foata normal form. 56/469 useless extension candidates. Maximal degree in co-relation 610. Up to 121 conditions per place. [2024-10-11 17:02:04,113 INFO L140 encePairwiseOnDemand]: 108/114 looper letters, 12 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2024-10-11 17:02:04,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 87 transitions, 215 flow [2024-10-11 17:02:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2024-10-11 17:02:04,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2024-10-11 17:02:04,115 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 199 flow. Second operand 3 states and 288 transitions. [2024-10-11 17:02:04,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 87 transitions, 215 flow [2024-10-11 17:02:04,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:02:04,116 INFO L231 Difference]: Finished difference. Result has 96 places, 87 transitions, 190 flow [2024-10-11 17:02:04,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=96, PETRI_TRANSITIONS=87} [2024-10-11 17:02:04,119 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -2 predicate places. [2024-10-11 17:02:04,119 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 87 transitions, 190 flow [2024-10-11 17:02:04,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:02:04,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:04,120 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] [2024-10-11 17:02:04,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:02:04,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:02:04,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:04,121 INFO L85 PathProgramCache]: Analyzing trace with hash 831466125, now seen corresponding path program 1 times [2024-10-11 17:02:04,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:04,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867176846] [2024-10-11 17:02:04,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:04,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:04,153 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:02:04,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:04,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867176846] [2024-10-11 17:02:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867176846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:04,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:04,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:04,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804793759] [2024-10-11 17:02:04,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:04,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:04,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:04,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2024-10-11 17:02:04,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 87 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:02:04,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:04,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2024-10-11 17:02:04,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:04,270 INFO L124 PetriNetUnfolderBase]: 97/647 cut-off events. [2024-10-11 17:02:04,273 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-10-11 17:02:04,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 647 events. 97/647 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4274 event pairs, 36 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 885. Up to 142 conditions per place. [2024-10-11 17:02:04,281 INFO L140 encePairwiseOnDemand]: 103/114 looper letters, 17 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2024-10-11 17:02:04,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 97 transitions, 268 flow [2024-10-11 17:02:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-10-11 17:02:04,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8538011695906432 [2024-10-11 17:02:04,284 INFO L175 Difference]: Start difference. First operand has 96 places, 87 transitions, 190 flow. Second operand 3 states and 292 transitions. [2024-10-11 17:02:04,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 97 transitions, 268 flow [2024-10-11 17:02:04,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:04,286 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 256 flow [2024-10-11 17:02:04,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-10-11 17:02:04,288 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2024-10-11 17:02:04,288 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 256 flow [2024-10-11 17:02:04,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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:02:04,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:04,288 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:04,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:02:04,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:02:04,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash 488728117, now seen corresponding path program 1 times [2024-10-11 17:02:04,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:04,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891649839] [2024-10-11 17:02:04,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:04,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:04,332 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:02:04,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:04,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891649839] [2024-10-11 17:02:04,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891649839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:04,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:04,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:02:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289877984] [2024-10-11 17:02:04,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:04,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:02:04,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:04,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:02:04,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:02:04,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2024-10-11 17:02:04,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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:02:04,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:04,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2024-10-11 17:02:04,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:04,499 INFO L124 PetriNetUnfolderBase]: 200/1033 cut-off events. [2024-10-11 17:02:04,499 INFO L125 PetriNetUnfolderBase]: For 386/394 co-relation queries the response was YES. [2024-10-11 17:02:04,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 1033 events. 200/1033 cut-off events. For 386/394 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7980 event pairs, 61 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 1834. Up to 255 conditions per place. [2024-10-11 17:02:04,508 INFO L140 encePairwiseOnDemand]: 107/114 looper letters, 17 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2024-10-11 17:02:04,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 104 transitions, 351 flow [2024-10-11 17:02:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:02:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:02:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2024-10-11 17:02:04,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8654970760233918 [2024-10-11 17:02:04,510 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 256 flow. Second operand 3 states and 296 transitions. [2024-10-11 17:02:04,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 104 transitions, 351 flow [2024-10-11 17:02:04,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 104 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:02:04,513 INFO L231 Difference]: Finished difference. Result has 100 places, 103 transitions, 326 flow [2024-10-11 17:02:04,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=100, PETRI_TRANSITIONS=103} [2024-10-11 17:02:04,514 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 2 predicate places. [2024-10-11 17:02:04,514 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 103 transitions, 326 flow [2024-10-11 17:02:04,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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:02:04,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:04,515 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:02:04,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:02:04,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-11 17:02:04,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash 610723637, now seen corresponding path program 1 times [2024-10-11 17:02:04,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:04,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714470719] [2024-10-11 17:02:04,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:04,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:04,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:02:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:02:04,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:02:04,533 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:02:04,533 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining) [2024-10-11 17:02:04,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-11 17:02:04,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-11 17:02:04,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-11 17:02:04,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-11 17:02:04,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 12 remaining) [2024-10-11 17:02:04,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining) [2024-10-11 17:02:04,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-11 17:02:04,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-11 17:02:04,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-11 17:02:04,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-11 17:02:04,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-11 17:02:04,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:02:04,535 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 17:02:04,583 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-11 17:02:04,583 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:02:04,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:02:04 BasicIcfg [2024-10-11 17:02:04,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:02:04,590 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:02:04,590 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:02:04,590 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:02:04,591 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:02" (3/4) ... [2024-10-11 17:02:04,592 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:02:04,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:02:04,594 INFO L158 Benchmark]: Toolchain (without parser) took 2559.55ms. Allocated memory is still 186.6MB. Free memory was 118.5MB in the beginning and 107.8MB in the end (delta: 10.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-10-11 17:02:04,594 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:02:04,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.11ms. Allocated memory is still 186.6MB. Free memory was 118.3MB in the beginning and 153.2MB in the end (delta: -34.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:02:04,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.11ms. Allocated memory is still 186.6MB. Free memory was 153.2MB in the beginning and 151.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:02:04,595 INFO L158 Benchmark]: Boogie Preprocessor took 20.08ms. Allocated memory is still 186.6MB. Free memory was 151.1MB in the beginning and 149.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:02:04,595 INFO L158 Benchmark]: RCFGBuilder took 341.25ms. Allocated memory is still 186.6MB. Free memory was 149.6MB in the beginning and 135.6MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:02:04,595 INFO L158 Benchmark]: TraceAbstraction took 1681.07ms. Allocated memory is still 186.6MB. Free memory was 134.9MB in the beginning and 108.9MB in the end (delta: 26.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-10-11 17:02:04,595 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 186.6MB. Free memory was 108.9MB in the beginning and 107.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:02:04,600 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.19ms. Allocated memory is still 109.1MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.11ms. Allocated memory is still 186.6MB. Free memory was 118.3MB in the beginning and 153.2MB in the end (delta: -34.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.11ms. Allocated memory is still 186.6MB. Free memory was 153.2MB in the beginning and 151.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.08ms. Allocated memory is still 186.6MB. Free memory was 151.1MB in the beginning and 149.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.25ms. Allocated memory is still 186.6MB. Free memory was 149.6MB in the beginning and 135.6MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1681.07ms. Allocated memory is still 186.6MB. Free memory was 134.9MB in the beginning and 108.9MB in the end (delta: 26.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 186.6MB. Free memory was 108.9MB in the beginning and 107.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 699]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int x; VAL [x=0] [L709] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={49:51}, argc=52, x=0] [L710] 0 int i; VAL [\old(argc)=52, \old(argv)={49:51}, argc=52, x=0] [L711] 0 x = 0 VAL [\old(argc)=52, \old(argv)={49:51}, argc=52, x=0] [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={49:51}, argc=52, t1=-1, x=0] [L713] 0 i = 0 VAL [\old(argc)=52, \old(argv)={49:51}, argc=52, i=0, t1=-1, x=0] [L713] COND TRUE 0 i < 50 VAL [\old(argc)=52, \old(argv)={49:51}, argc=52, i=0, t1=-1, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(arg)={0:0}, \old(argc)=52, \old(argv)={49:51}, argc=52, i=0, t1=-1, t2=0, x=0] [L699] 1 x <= 50 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, x=0] [L703] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, x=0] [L704] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, t=0, x=0] [L705] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, t=0, x=1] [L699] 1 x <= 50 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, t=0, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [705] and C: x <= 50 [699] - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 712]: 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 5 procedures, 111 locations, 9 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: 0.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 20 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=3, InterpolantAutomatonStates: 9, 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.2s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 144 locations, 12 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: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 8 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=3, InterpolantAutomatonStates: 9, 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.1s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 17:02:04,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE