./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:51:51,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:51:51,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:51:51,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:51:51,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:51:51,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:51:51,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:51:51,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:51:51,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:51:51,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:51:51,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:51:51,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:51:51,806 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:51:51,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:51:51,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:51:51,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:51:51,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:51:51,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:51:51,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:51:51,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:51:51,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:51:51,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:51:51,814 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:51:51,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:51:51,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:51:51,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:51:51,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:51:51,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:51:51,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:51:51,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:51:51,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:51:51,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:51:51,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:51:51,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:51:51,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:51:51,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:51:51,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:51:51,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:51:51,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:51:51,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:51:51,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:51:51,820 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba [2024-11-19 05:51:52,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:51:52,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:51:52,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:51:52,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:51:52,121 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:51:52,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i [2024-11-19 05:51:53,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:51:53,875 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:51:53,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i [2024-11-19 05:51:53,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec6f2193/ca51d81bc4ec4cab8aa2928264b3be83/FLAG663d29af1 [2024-11-19 05:51:53,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec6f2193/ca51d81bc4ec4cab8aa2928264b3be83 [2024-11-19 05:51:53,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:51:53,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:51:53,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:51:53,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:51:53,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:51:53,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:51:53" (1/1) ... [2024-11-19 05:51:53,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12874180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:53, skipping insertion in model container [2024-11-19 05:51:53,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:51:53" (1/1) ... [2024-11-19 05:51:53,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:51:54,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:51:54,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:51:54,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:51:54,563 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:51:54,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54 WrapperNode [2024-11-19 05:51:54,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:51:54,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:51:54,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:51:54,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:51:54,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,625 INFO L138 Inliner]: procedures = 259, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-11-19 05:51:54,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:51:54,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:51:54,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:51:54,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:51:54,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:51:54,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:51:54,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:51:54,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:51:54,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (1/1) ... [2024-11-19 05:51:54,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:51:54,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:51:54,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:51:54,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:51:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:51:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:51:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:51:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:51:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 05:51:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 05:51:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:51:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:51:54,760 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:51:54,884 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:51:54,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:51:55,001 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:51:55,001 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:51:55,014 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:51:55,014 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 05:51:55,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:51:55 BoogieIcfgContainer [2024-11-19 05:51:55,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:51:55,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:51:55,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:51:55,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:51:55,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:51:53" (1/3) ... [2024-11-19 05:51:55,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29334b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:51:55, skipping insertion in model container [2024-11-19 05:51:55,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:51:54" (2/3) ... [2024-11-19 05:51:55,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29334b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:51:55, skipping insertion in model container [2024-11-19 05:51:55,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:51:55" (3/3) ... [2024-11-19 05:51:55,023 INFO L112 eAbstractionObserver]: Analyzing ICFG 10-synch_02-thread_nonunique.i [2024-11-19 05:51:55,041 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:51:55,041 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 05:51:55,041 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:51:55,093 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 05:51:55,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 119 flow [2024-11-19 05:51:55,221 INFO L124 PetriNetUnfolderBase]: 5/86 cut-off events. [2024-11-19 05:51:55,222 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:51:55,226 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-11-19 05:51:55,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 56 transitions, 119 flow [2024-11-19 05:51:55,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 56 transitions, 119 flow [2024-11-19 05:51:55,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:51:55,245 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;@4e2704c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:51:55,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-19 05:51:55,258 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:51:55,258 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-19 05:51:55,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:51:55,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:55,260 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:51:55,260 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-11-19 05:51:55,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash -556190281, now seen corresponding path program 1 times [2024-11-19 05:51:55,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343978287] [2024-11-19 05:51:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:55,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:51:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343978287] [2024-11-19 05:51:55,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343978287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:51:55,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:51:55,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:51:55,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998234138] [2024-11-19 05:51:55,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:51:55,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:51:55,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:51:55,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:51:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:51:55,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 56 [2024-11-19 05:51:55,641 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-11-19 05:51:55,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:51:55,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 56 [2024-11-19 05:51:55,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:51:55,682 INFO L124 PetriNetUnfolderBase]: 0/73 cut-off events. [2024-11-19 05:51:55,682 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:51:55,683 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-11-19 05:51:55,684 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 5 selfloop transitions, 4 changer transitions 7/54 dead transitions. [2024-11-19 05:51:55,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 137 flow [2024-11-19 05:51:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:51:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:51:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-11-19 05:51:55,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2024-11-19 05:51:55,702 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 119 flow. Second operand 3 states and 146 transitions. [2024-11-19 05:51:55,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 137 flow [2024-11-19 05:51:55,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 137 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:51:55,710 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 115 flow [2024-11-19 05:51:55,712 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-11-19 05:51:55,718 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2024-11-19 05:51:55,718 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 115 flow [2024-11-19 05:51:55,719 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-11-19 05:51:55,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:55,720 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:51:55,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:51:55,720 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-11-19 05:51:55,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:55,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2059474795, now seen corresponding path program 1 times [2024-11-19 05:51:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:55,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931117195] [2024-11-19 05:51:55,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:56,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:51:56,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931117195] [2024-11-19 05:51:56,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931117195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:51:56,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:51:56,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:51:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214795739] [2024-11-19 05:51:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:51:56,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:51:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:51:56,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:51:56,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:51:56,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2024-11-19 05:51:56,476 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-11-19 05:51:56,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:51:56,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2024-11-19 05:51:56,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:51:56,509 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2024-11-19 05:51:56,511 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-19 05:51:56,511 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-11-19 05:51:56,512 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 15 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2024-11-19 05:51:56,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 153 flow [2024-11-19 05:51:56,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:51:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:51:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-11-19 05:51:56,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2024-11-19 05:51:56,514 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 115 flow. Second operand 6 states and 207 transitions. [2024-11-19 05:51:56,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 153 flow [2024-11-19 05:51:56,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:51:56,518 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 115 flow [2024-11-19 05:51:56,519 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-11-19 05:51:56,519 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2024-11-19 05:51:56,519 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 115 flow [2024-11-19 05:51:56,520 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-11-19 05:51:56,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:56,520 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-11-19 05:51:56,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:51:56,521 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-11-19 05:51:56,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1180462258, now seen corresponding path program 1 times [2024-11-19 05:51:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:56,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869631987] [2024-11-19 05:51:56,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:56,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:56,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:51:56,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869631987] [2024-11-19 05:51:56,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869631987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:51:56,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:51:56,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:51:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528311968] [2024-11-19 05:51:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:51:56,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:51:56,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:51:56,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:51:56,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:51:56,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 56 [2024-11-19 05:51:56,583 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-11-19 05:51:56,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:51:56,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 56 [2024-11-19 05:51:56,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:51:56,606 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2024-11-19 05:51:56,607 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-11-19 05:51:56,607 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-11-19 05:51:56,608 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 4 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2024-11-19 05:51:56,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 125 flow [2024-11-19 05:51:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:51:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:51:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-11-19 05:51:56,612 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2024-11-19 05:51:56,612 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 115 flow. Second operand 3 states and 148 transitions. [2024-11-19 05:51:56,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 125 flow [2024-11-19 05:51:56,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 115 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:51:56,614 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 107 flow [2024-11-19 05:51:56,614 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-11-19 05:51:56,615 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2024-11-19 05:51:56,618 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 107 flow [2024-11-19 05:51:56,618 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-11-19 05:51:56,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:56,619 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-11-19 05:51:56,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:51:56,619 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-11-19 05:51:56,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1951054593, now seen corresponding path program 1 times [2024-11-19 05:51:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:56,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180598284] [2024-11-19 05:51:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:56,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:51:56,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180598284] [2024-11-19 05:51:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180598284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:51:56,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327455502] [2024-11-19 05:51:56,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:56,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:51:56,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:51:56,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:51:56,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:51:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:56,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 05:51:56,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:51:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:56,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:51:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:56,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327455502] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:51:56,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:51:56,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 05:51:56,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129090435] [2024-11-19 05:51:56,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:51:56,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:51:56,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:51:56,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:51:56,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:51:57,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 56 [2024-11-19 05:51:57,104 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-11-19 05:51:57,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:51:57,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 56 [2024-11-19 05:51:57,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:51:57,150 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2024-11-19 05:51:57,150 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:51:57,151 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-11-19 05:51:57,151 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 5 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-19 05:51:57,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 92 flow [2024-11-19 05:51:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:51:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:51:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2024-11-19 05:51:57,154 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2024-11-19 05:51:57,154 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 107 flow. Second operand 6 states and 244 transitions. [2024-11-19 05:51:57,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 92 flow [2024-11-19 05:51:57,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 05:51:57,158 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 74 flow [2024-11-19 05:51:57,159 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-11-19 05:51:57,160 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -17 predicate places. [2024-11-19 05:51:57,161 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 74 flow [2024-11-19 05:51:57,161 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-11-19 05:51:57,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:57,161 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-11-19 05:51:57,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 05:51:57,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:51:57,363 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-11-19 05:51:57,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash 145983485, now seen corresponding path program 1 times [2024-11-19 05:51:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:57,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93376851] [2024-11-19 05:51:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:51:57,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:51:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:51:57,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:51:57,426 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:51:57,427 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-19 05:51:57,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-11-19 05:51:57,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-11-19 05:51:57,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-11-19 05:51:57,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-11-19 05:51:57,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:51:57,433 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 05:51:57,436 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:51:57,437 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 05:51:57,460 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:51:57,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 150 flow [2024-11-19 05:51:57,489 INFO L124 PetriNetUnfolderBase]: 10/154 cut-off events. [2024-11-19 05:51:57,490 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:51:57,491 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-11-19 05:51:57,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 67 transitions, 150 flow [2024-11-19 05:51:57,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 150 flow [2024-11-19 05:51:57,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:51:57,495 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;@4e2704c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:51:57,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 05:51:57,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:51:57,501 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-19 05:51:57,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:51:57,502 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:57,502 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:51:57,502 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-11-19 05:51:57,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:57,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1225650938, now seen corresponding path program 1 times [2024-11-19 05:51:57,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:57,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62782548] [2024-11-19 05:51:57,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:57,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:57,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:51:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62782548] [2024-11-19 05:51:57,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62782548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:51:57,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:51:57,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:51:57,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366570528] [2024-11-19 05:51:57,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:51:57,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:51:57,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:51:57,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:51:57,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:51:57,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 67 [2024-11-19 05:51:57,588 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-11-19 05:51:57,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:51:57,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 67 [2024-11-19 05:51:57,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:51:57,635 INFO L124 PetriNetUnfolderBase]: 2/149 cut-off events. [2024-11-19 05:51:57,637 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-19 05:51:57,638 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-11-19 05:51:57,638 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 13 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-11-19 05:51:57,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 194 flow [2024-11-19 05:51:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:51:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:51:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2024-11-19 05:51:57,641 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8905472636815921 [2024-11-19 05:51:57,641 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 150 flow. Second operand 3 states and 179 transitions. [2024-11-19 05:51:57,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 194 flow [2024-11-19 05:51:57,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:51:57,645 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 170 flow [2024-11-19 05:51:57,646 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-11-19 05:51:57,646 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2024-11-19 05:51:57,648 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 170 flow [2024-11-19 05:51:57,648 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-11-19 05:51:57,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:57,649 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:51:57,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:51:57,649 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-11-19 05:51:57,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:57,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1637995509, now seen corresponding path program 1 times [2024-11-19 05:51:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:57,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655435967] [2024-11-19 05:51:57,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:57,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:57,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:51:57,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655435967] [2024-11-19 05:51:57,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655435967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:51:57,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:51:57,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:51:57,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822721295] [2024-11-19 05:51:57,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:51:57,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:51:57,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:51:57,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:51:57,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:51:57,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2024-11-19 05:51:57,964 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-11-19 05:51:57,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:51:57,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2024-11-19 05:51:57,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:51:58,004 INFO L124 PetriNetUnfolderBase]: 2/146 cut-off events. [2024-11-19 05:51:58,004 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-19 05:51:58,005 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-11-19 05:51:58,005 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 20 selfloop transitions, 6 changer transitions 0/66 dead transitions. [2024-11-19 05:51:58,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 220 flow [2024-11-19 05:51:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:51:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:51:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 265 transitions. [2024-11-19 05:51:58,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6592039800995025 [2024-11-19 05:51:58,007 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 170 flow. Second operand 6 states and 265 transitions. [2024-11-19 05:51:58,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 220 flow [2024-11-19 05:51:58,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:51:58,010 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 176 flow [2024-11-19 05:51:58,010 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-11-19 05:51:58,011 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-19 05:51:58,011 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 176 flow [2024-11-19 05:51:58,011 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-11-19 05:51:58,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:58,012 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-11-19 05:51:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:51:58,012 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-11-19 05:51:58,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash -121608859, now seen corresponding path program 1 times [2024-11-19 05:51:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105433465] [2024-11-19 05:51:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:58,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:51:58,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105433465] [2024-11-19 05:51:58,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105433465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:51:58,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:51:58,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:51:58,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33859429] [2024-11-19 05:51:58,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:51:58,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:51:58,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:51:58,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:51:58,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:51:58,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 67 [2024-11-19 05:51:58,045 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-11-19 05:51:58,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:51:58,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 67 [2024-11-19 05:51:58,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:51:58,085 INFO L124 PetriNetUnfolderBase]: 18/301 cut-off events. [2024-11-19 05:51:58,086 INFO L125 PetriNetUnfolderBase]: For 69/98 co-relation queries the response was YES. [2024-11-19 05:51:58,087 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-11-19 05:51:58,089 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 11 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2024-11-19 05:51:58,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 224 flow [2024-11-19 05:51:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:51:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:51:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2024-11-19 05:51:58,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.900497512437811 [2024-11-19 05:51:58,091 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 176 flow. Second operand 3 states and 181 transitions. [2024-11-19 05:51:58,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 224 flow [2024-11-19 05:51:58,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 212 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:51:58,094 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 194 flow [2024-11-19 05:51:58,094 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-11-19 05:51:58,094 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2024-11-19 05:51:58,095 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 194 flow [2024-11-19 05:51:58,095 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-11-19 05:51:58,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:58,095 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-11-19 05:51:58,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:51:58,099 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-11-19 05:51:58,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1349972437, now seen corresponding path program 1 times [2024-11-19 05:51:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456032387] [2024-11-19 05:51:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:58,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:51:58,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456032387] [2024-11-19 05:51:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456032387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:51:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648824796] [2024-11-19 05:51:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:58,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:51:58,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:51:58,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:51:58,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 05:51:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:58,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 05:51:58,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:51:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:58,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:51:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:51:58,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648824796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:51:58,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:51:58,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 05:51:58,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640248120] [2024-11-19 05:51:58,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:51:58,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:51:58,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:51:58,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:51:58,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:51:58,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 67 [2024-11-19 05:51:58,577 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-11-19 05:51:58,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:51:58,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 67 [2024-11-19 05:51:58,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:51:58,634 INFO L124 PetriNetUnfolderBase]: 3/85 cut-off events. [2024-11-19 05:51:58,634 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 05:51:58,634 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-11-19 05:51:58,635 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 7 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2024-11-19 05:51:58,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 168 flow [2024-11-19 05:51:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:51:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 05:51:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 448 transitions. [2024-11-19 05:51:58,639 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7429519071310116 [2024-11-19 05:51:58,639 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 194 flow. Second operand 9 states and 448 transitions. [2024-11-19 05:51:58,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 168 flow [2024-11-19 05:51:58,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:51:58,641 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 142 flow [2024-11-19 05:51:58,641 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-11-19 05:51:58,641 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2024-11-19 05:51:58,641 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 142 flow [2024-11-19 05:51:58,642 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-11-19 05:51:58,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:58,642 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-11-19 05:51:58,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 05:51:58,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 05:51:58,843 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-11-19 05:51:58,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:58,844 INFO L85 PathProgramCache]: Analyzing trace with hash 99772284, now seen corresponding path program 1 times [2024-11-19 05:51:58,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:58,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920943291] [2024-11-19 05:51:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:51:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 05:51:58,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:51:58,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920943291] [2024-11-19 05:51:58,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920943291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:51:58,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:51:58,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:51:58,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82046032] [2024-11-19 05:51:58,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:51:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:51:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:51:58,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:51:58,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:51:58,907 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 67 [2024-11-19 05:51:58,907 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-11-19 05:51:58,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:51:58,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 67 [2024-11-19 05:51:58,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:51:58,923 INFO L124 PetriNetUnfolderBase]: 7/111 cut-off events. [2024-11-19 05:51:58,923 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-19 05:51:58,924 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-11-19 05:51:58,924 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 7 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2024-11-19 05:51:58,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 174 flow [2024-11-19 05:51:58,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:51:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:51:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2024-11-19 05:51:58,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8805970149253731 [2024-11-19 05:51:58,925 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 142 flow. Second operand 3 states and 177 transitions. [2024-11-19 05:51:58,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 174 flow [2024-11-19 05:51:58,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 159 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-19 05:51:58,927 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 163 flow [2024-11-19 05:51:58,927 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-11-19 05:51:58,928 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-11-19 05:51:58,928 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 163 flow [2024-11-19 05:51:58,928 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-11-19 05:51:58,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:51:58,928 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-11-19 05:51:58,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:51:58,929 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-11-19 05:51:58,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:51:58,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1517586101, now seen corresponding path program 1 times [2024-11-19 05:51:58,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:51:58,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834194922] [2024-11-19 05:51:58,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:51:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:51:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:51:58,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:51:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:51:58,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:51:58,955 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:51:58,955 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2024-11-19 05:51:58,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-11-19 05:51:58,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-11-19 05:51:58,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-19 05:51:58,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-11-19 05:51:58,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-11-19 05:51:58,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:51:58,958 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 05:51:58,996 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-19 05:51:58,996 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:51:59,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:51:59 BasicIcfg [2024-11-19 05:51:59,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:51:59,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:51:59,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:51:59,002 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:51:59,003 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:51:55" (3/4) ... [2024-11-19 05:51:59,004 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 05:51:59,055 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:51:59,055 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:51:59,056 INFO L158 Benchmark]: Toolchain (without parser) took 5143.15ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 107.3MB in the beginning and 114.6MB in the end (delta: -7.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-19 05:51:59,056 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 113.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:51:59,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.70ms. Allocated memory is still 146.8MB. Free memory was 106.8MB in the beginning and 77.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 05:51:59,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.91ms. Allocated memory is still 146.8MB. Free memory was 77.4MB in the beginning and 74.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:51:59,059 INFO L158 Benchmark]: Boogie Preprocessor took 44.56ms. Allocated memory is still 146.8MB. Free memory was 74.9MB in the beginning and 73.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:51:59,059 INFO L158 Benchmark]: RCFGBuilder took 343.30ms. Allocated memory is still 146.8MB. Free memory was 73.3MB in the beginning and 60.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 05:51:59,059 INFO L158 Benchmark]: TraceAbstraction took 3984.26ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 59.5MB in the beginning and 119.9MB in the end (delta: -60.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:51:59,059 INFO L158 Benchmark]: Witness Printer took 53.10ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 114.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:51:59,061 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.22ms. Allocated memory is still 113.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 649.70ms. Allocated memory is still 146.8MB. Free memory was 106.8MB in the beginning and 77.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.91ms. Allocated memory is still 146.8MB. Free memory was 77.4MB in the beginning and 74.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.56ms. Allocated memory is still 146.8MB. Free memory was 74.9MB in the beginning and 73.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.30ms. Allocated memory is still 146.8MB. Free memory was 73.3MB in the beginning and 60.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3984.26ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 59.5MB in the beginning and 119.9MB in the end (delta: -60.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 53.10ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 114.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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.3s, 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.5s, 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.4s 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-11-19 05:51:59,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE