./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c -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 bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 13:55:09,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:55:09,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 13:55:09,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:55:09,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:55:09,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:55:09,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:55:09,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:55:09,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:55:09,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:55:09,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:55:09,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:55:09,909 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:55:09,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:55:09,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:55:09,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:55:09,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:55:09,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:55:09,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:55:09,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:55:09,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:55:09,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:55:09,917 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 13:55:09,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:55:09,918 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 13:55:09,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:55:09,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:55:09,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:55:09,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:55:09,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:55:09,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:55:09,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:55:09,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:55:09,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:55:09,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:55:09,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:55:09,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:55:09,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:55:09,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:55:09,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:55:09,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:55:09,923 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 -> bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 [2024-11-20 13:55:10,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:55:10,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:55:10,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:55:10,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:55:10,197 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:55:10,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2024-11-20 13:55:11,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 13:55:11,935 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 13:55:11,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2024-11-20 13:55:11,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa7a43b4/2a09d2eb9cb3406786172ce2eab7178b/FLAG4df9ebb0e [2024-11-20 13:55:12,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa7a43b4/2a09d2eb9cb3406786172ce2eab7178b [2024-11-20 13:55:12,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 13:55:12,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 13:55:12,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 13:55:12,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 13:55:12,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 13:55:12,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478767a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12, skipping insertion in model container [2024-11-20 13:55:12,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 13:55:12,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:55:12,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 13:55:12,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:55:12,644 INFO L204 MainTranslator]: Completed translation [2024-11-20 13:55:12,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12 WrapperNode [2024-11-20 13:55:12,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 13:55:12,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 13:55:12,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 13:55:12,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 13:55:12,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,699 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 207 [2024-11-20 13:55:12,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 13:55:12,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 13:55:12,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 13:55:12,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 13:55:12,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 13:55:12,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 13:55:12,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 13:55:12,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 13:55:12,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (1/1) ... [2024-11-20 13:55:12,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:55:12,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:55:12,781 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-20 13:55:12,783 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-20 13:55:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 13:55:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-20 13:55:12,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-20 13:55:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-20 13:55:12,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-20 13:55:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 13:55:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 13:55:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 13:55:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 13:55:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 13:55:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 13:55:12,862 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 13:55:12,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 13:55:12,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 13:55:13,349 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 13:55:13,349 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 13:55:13,378 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 13:55:13,382 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-20 13:55:13,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:55:13 BoogieIcfgContainer [2024-11-20 13:55:13,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 13:55:13,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 13:55:13,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 13:55:13,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 13:55:13,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:55:12" (1/3) ... [2024-11-20 13:55:13,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373a2a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:55:13, skipping insertion in model container [2024-11-20 13:55:13,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:12" (2/3) ... [2024-11-20 13:55:13,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373a2a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:55:13, skipping insertion in model container [2024-11-20 13:55:13,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:55:13" (3/3) ... [2024-11-20 13:55:13,394 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2024-11-20 13:55:13,413 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 13:55:13,414 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-11-20 13:55:13,414 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 13:55:13,556 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 13:55:13,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 255 transitions, 524 flow [2024-11-20 13:55:13,690 INFO L124 PetriNetUnfolderBase]: 17/253 cut-off events. [2024-11-20 13:55:13,692 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 13:55:13,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 253 events. 17/253 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 527 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 151. Up to 2 conditions per place. [2024-11-20 13:55:13,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 255 transitions, 524 flow [2024-11-20 13:55:13,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 233 transitions, 478 flow [2024-11-20 13:55:13,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:55:13,733 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;@4ba800f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:55:13,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-11-20 13:55:13,744 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:55:13,745 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-20 13:55:13,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:55:13,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:13,746 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] [2024-11-20 13:55:13,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:13,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash 993970068, now seen corresponding path program 1 times [2024-11-20 13:55:13,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:13,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179037449] [2024-11-20 13:55:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:13,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:13,982 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-20 13:55:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179037449] [2024-11-20 13:55:13,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179037449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:13,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:13,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407671125] [2024-11-20 13:55:13,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:13,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:14,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:14,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:14,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 255 [2024-11-20 13:55:14,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 233 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-20 13:55:14,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:14,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 255 [2024-11-20 13:55:14,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:14,239 INFO L124 PetriNetUnfolderBase]: 24/428 cut-off events. [2024-11-20 13:55:14,240 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2024-11-20 13:55:14,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 428 events. 24/428 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1545 event pairs, 11 based on Foata normal form. 26/386 useless extension candidates. Maximal degree in co-relation 358. Up to 40 conditions per place. [2024-11-20 13:55:14,248 INFO L140 encePairwiseOnDemand]: 243/255 looper letters, 13 selfloop transitions, 2 changer transitions 2/223 dead transitions. [2024-11-20 13:55:14,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 223 transitions, 488 flow [2024-11-20 13:55:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2024-11-20 13:55:14,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228758169934641 [2024-11-20 13:55:14,272 INFO L175 Difference]: Start difference. First operand has 225 places, 233 transitions, 478 flow. Second operand 3 states and 706 transitions. [2024-11-20 13:55:14,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 223 transitions, 488 flow [2024-11-20 13:55:14,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 223 transitions, 480 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 13:55:14,283 INFO L231 Difference]: Finished difference. Result has 222 places, 221 transitions, 450 flow [2024-11-20 13:55:14,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=222, PETRI_TRANSITIONS=221} [2024-11-20 13:55:14,291 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -3 predicate places. [2024-11-20 13:55:14,292 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 221 transitions, 450 flow [2024-11-20 13:55:14,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-20 13:55:14,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:14,293 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-20 13:55:14,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 13:55:14,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:14,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1773288271, now seen corresponding path program 1 times [2024-11-20 13:55:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:14,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237464996] [2024-11-20 13:55:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:14,369 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-20 13:55:14,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:14,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237464996] [2024-11-20 13:55:14,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237464996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:14,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:14,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486256785] [2024-11-20 13:55:14,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:14,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:14,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:14,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:14,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 255 [2024-11-20 13:55:14,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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-20 13:55:14,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:14,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 255 [2024-11-20 13:55:14,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:14,504 INFO L124 PetriNetUnfolderBase]: 39/577 cut-off events. [2024-11-20 13:55:14,504 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2024-11-20 13:55:14,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 577 events. 39/577 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2818 event pairs, 19 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 615. Up to 62 conditions per place. [2024-11-20 13:55:14,512 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 13 selfloop transitions, 1 changer transitions 0/218 dead transitions. [2024-11-20 13:55:14,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 218 transitions, 472 flow [2024-11-20 13:55:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2024-11-20 13:55:14,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9124183006535947 [2024-11-20 13:55:14,517 INFO L175 Difference]: Start difference. First operand has 222 places, 221 transitions, 450 flow. Second operand 3 states and 698 transitions. [2024-11-20 13:55:14,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 218 transitions, 472 flow [2024-11-20 13:55:14,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 218 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:14,523 INFO L231 Difference]: Finished difference. Result has 217 places, 218 transitions, 442 flow [2024-11-20 13:55:14,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=217, PETRI_TRANSITIONS=218} [2024-11-20 13:55:14,526 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -8 predicate places. [2024-11-20 13:55:14,526 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 218 transitions, 442 flow [2024-11-20 13:55:14,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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-20 13:55:14,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:14,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:14,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 13:55:14,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:14,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash -670060674, now seen corresponding path program 1 times [2024-11-20 13:55:14,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:14,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152402377] [2024-11-20 13:55:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:14,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:15,133 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-20 13:55:15,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152402377] [2024-11-20 13:55:15,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152402377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:15,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:15,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:55:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649453632] [2024-11-20 13:55:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:15,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:55:15,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:15,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:55:15,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:55:15,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 255 [2024-11-20 13:55:15,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 218 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 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-20 13:55:15,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:15,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 255 [2024-11-20 13:55:15,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:15,509 INFO L124 PetriNetUnfolderBase]: 120/846 cut-off events. [2024-11-20 13:55:15,509 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-20 13:55:15,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 846 events. 120/846 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4418 event pairs, 65 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 1018. Up to 191 conditions per place. [2024-11-20 13:55:15,516 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 27 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2024-11-20 13:55:15,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 217 transitions, 504 flow [2024-11-20 13:55:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:55:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:55:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1299 transitions. [2024-11-20 13:55:15,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8490196078431372 [2024-11-20 13:55:15,521 INFO L175 Difference]: Start difference. First operand has 217 places, 218 transitions, 442 flow. Second operand 6 states and 1299 transitions. [2024-11-20 13:55:15,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 217 transitions, 504 flow [2024-11-20 13:55:15,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 217 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:55:15,526 INFO L231 Difference]: Finished difference. Result has 220 places, 217 transitions, 449 flow [2024-11-20 13:55:15,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=220, PETRI_TRANSITIONS=217} [2024-11-20 13:55:15,527 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -5 predicate places. [2024-11-20 13:55:15,528 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 217 transitions, 449 flow [2024-11-20 13:55:15,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 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-20 13:55:15,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:15,529 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:15,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 13:55:15,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:15,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash -257925273, now seen corresponding path program 1 times [2024-11-20 13:55:15,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:15,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038109292] [2024-11-20 13:55:15,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:15,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:15,581 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-20 13:55:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038109292] [2024-11-20 13:55:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038109292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:15,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:15,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:15,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942579525] [2024-11-20 13:55:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:15,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:15,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:15,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:15,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:15,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 255 [2024-11-20 13:55:15,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 217 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-20 13:55:15,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:15,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 255 [2024-11-20 13:55:15,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:15,668 INFO L124 PetriNetUnfolderBase]: 26/374 cut-off events. [2024-11-20 13:55:15,668 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-20 13:55:15,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 374 events. 26/374 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1334 event pairs, 14 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 412. Up to 42 conditions per place. [2024-11-20 13:55:15,671 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 13 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2024-11-20 13:55:15,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 216 transitions, 477 flow [2024-11-20 13:55:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions. [2024-11-20 13:55:15,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9111111111111111 [2024-11-20 13:55:15,674 INFO L175 Difference]: Start difference. First operand has 220 places, 217 transitions, 449 flow. Second operand 3 states and 697 transitions. [2024-11-20 13:55:15,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 216 transitions, 477 flow [2024-11-20 13:55:15,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 216 transitions, 467 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 13:55:15,678 INFO L231 Difference]: Finished difference. Result has 216 places, 216 transitions, 441 flow [2024-11-20 13:55:15,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=216, PETRI_TRANSITIONS=216} [2024-11-20 13:55:15,680 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -9 predicate places. [2024-11-20 13:55:15,680 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 216 transitions, 441 flow [2024-11-20 13:55:15,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-20 13:55:15,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:15,681 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:15,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 13:55:15,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:15,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2022366058, now seen corresponding path program 1 times [2024-11-20 13:55:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801408080] [2024-11-20 13:55:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:55:15,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:15,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801408080] [2024-11-20 13:55:15,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801408080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:15,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:15,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 13:55:15,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135792497] [2024-11-20 13:55:15,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:15,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:15,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:15,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 255 [2024-11-20 13:55:15,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 216 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-20 13:55:15,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:15,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 255 [2024-11-20 13:55:15,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:15,878 INFO L124 PetriNetUnfolderBase]: 32/493 cut-off events. [2024-11-20 13:55:15,878 INFO L125 PetriNetUnfolderBase]: For 8/13 co-relation queries the response was YES. [2024-11-20 13:55:15,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 493 events. 32/493 cut-off events. For 8/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1744 event pairs, 1 based on Foata normal form. 1/420 useless extension candidates. Maximal degree in co-relation 511. Up to 33 conditions per place. [2024-11-20 13:55:15,882 INFO L140 encePairwiseOnDemand]: 250/255 looper letters, 14 selfloop transitions, 4 changer transitions 0/221 dead transitions. [2024-11-20 13:55:15,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 221 transitions, 489 flow [2024-11-20 13:55:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2024-11-20 13:55:15,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.930718954248366 [2024-11-20 13:55:15,885 INFO L175 Difference]: Start difference. First operand has 216 places, 216 transitions, 441 flow. Second operand 3 states and 712 transitions. [2024-11-20 13:55:15,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 221 transitions, 489 flow [2024-11-20 13:55:15,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 221 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:15,905 INFO L231 Difference]: Finished difference. Result has 218 places, 219 transitions, 467 flow [2024-11-20 13:55:15,905 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=218, PETRI_TRANSITIONS=219} [2024-11-20 13:55:15,908 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -7 predicate places. [2024-11-20 13:55:15,908 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 219 transitions, 467 flow [2024-11-20 13:55:15,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-20 13:55:15,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:15,909 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:15,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 13:55:15,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:15,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2036390758, now seen corresponding path program 1 times [2024-11-20 13:55:15,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:15,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922691429] [2024-11-20 13:55:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:15,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:15,956 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-20 13:55:15,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:15,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922691429] [2024-11-20 13:55:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922691429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:15,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:15,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225449372] [2024-11-20 13:55:15,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:15,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:15,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:15,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:15,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 255 [2024-11-20 13:55:15,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 219 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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-20 13:55:15,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:15,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 255 [2024-11-20 13:55:15,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:16,044 INFO L124 PetriNetUnfolderBase]: 35/426 cut-off events. [2024-11-20 13:55:16,045 INFO L125 PetriNetUnfolderBase]: For 57/78 co-relation queries the response was YES. [2024-11-20 13:55:16,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 426 events. 35/426 cut-off events. For 57/78 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1276 event pairs, 2 based on Foata normal form. 4/371 useless extension candidates. Maximal degree in co-relation 497. Up to 37 conditions per place. [2024-11-20 13:55:16,048 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 11 selfloop transitions, 2 changer transitions 6/218 dead transitions. [2024-11-20 13:55:16,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 218 transitions, 503 flow [2024-11-20 13:55:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2024-11-20 13:55:16,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-11-20 13:55:16,050 INFO L175 Difference]: Start difference. First operand has 218 places, 219 transitions, 467 flow. Second operand 3 states and 699 transitions. [2024-11-20 13:55:16,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 218 transitions, 503 flow [2024-11-20 13:55:16,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 218 transitions, 495 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:16,055 INFO L231 Difference]: Finished difference. Result has 215 places, 210 transitions, 444 flow [2024-11-20 13:55:16,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=215, PETRI_TRANSITIONS=210} [2024-11-20 13:55:16,056 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -10 predicate places. [2024-11-20 13:55:16,056 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 210 transitions, 444 flow [2024-11-20 13:55:16,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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-20 13:55:16,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:16,057 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:16,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 13:55:16,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:16,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1001494722, now seen corresponding path program 1 times [2024-11-20 13:55:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:16,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847854458] [2024-11-20 13:55:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:16,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:16,100 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-20 13:55:16,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:16,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847854458] [2024-11-20 13:55:16,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847854458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:16,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:16,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474040542] [2024-11-20 13:55:16,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:16,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:16,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:16,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:16,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:16,117 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 255 [2024-11-20 13:55:16,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 210 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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-20 13:55:16,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:16,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 255 [2024-11-20 13:55:16,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:16,203 INFO L124 PetriNetUnfolderBase]: 74/722 cut-off events. [2024-11-20 13:55:16,204 INFO L125 PetriNetUnfolderBase]: For 47/55 co-relation queries the response was YES. [2024-11-20 13:55:16,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 722 events. 74/722 cut-off events. For 47/55 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3036 event pairs, 12 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 855. Up to 102 conditions per place. [2024-11-20 13:55:16,209 INFO L140 encePairwiseOnDemand]: 250/255 looper letters, 16 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-11-20 13:55:16,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 210 transitions, 481 flow [2024-11-20 13:55:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2024-11-20 13:55:16,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9150326797385621 [2024-11-20 13:55:16,212 INFO L175 Difference]: Start difference. First operand has 215 places, 210 transitions, 444 flow. Second operand 3 states and 700 transitions. [2024-11-20 13:55:16,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 210 transitions, 481 flow [2024-11-20 13:55:16,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 210 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:16,217 INFO L231 Difference]: Finished difference. Result has 207 places, 209 transitions, 448 flow [2024-11-20 13:55:16,218 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=207, PETRI_TRANSITIONS=209} [2024-11-20 13:55:16,219 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -18 predicate places. [2024-11-20 13:55:16,219 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 209 transitions, 448 flow [2024-11-20 13:55:16,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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-20 13:55:16,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:16,220 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:55:16,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 13:55:16,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:16,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash 514328869, now seen corresponding path program 1 times [2024-11-20 13:55:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:16,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156271745] [2024-11-20 13:55:16,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:16,617 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-20 13:55:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156271745] [2024-11-20 13:55:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156271745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:55:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621945570] [2024-11-20 13:55:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:16,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:55:16,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:16,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:55:16,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:55:16,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 255 [2024-11-20 13:55:16,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 209 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 218.83333333333334) internal successors, (1313), 6 states have internal predecessors, (1313), 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-20 13:55:16,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:16,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 255 [2024-11-20 13:55:16,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:16,928 INFO L124 PetriNetUnfolderBase]: 96/719 cut-off events. [2024-11-20 13:55:16,928 INFO L125 PetriNetUnfolderBase]: For 68/80 co-relation queries the response was YES. [2024-11-20 13:55:16,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 719 events. 96/719 cut-off events. For 68/80 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2814 event pairs, 2 based on Foata normal form. 8/638 useless extension candidates. Maximal degree in co-relation 896. Up to 48 conditions per place. [2024-11-20 13:55:16,933 INFO L140 encePairwiseOnDemand]: 243/255 looper letters, 18 selfloop transitions, 12 changer transitions 4/215 dead transitions. [2024-11-20 13:55:16,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 215 transitions, 532 flow [2024-11-20 13:55:16,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:55:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:55:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2024-11-20 13:55:16,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.873202614379085 [2024-11-20 13:55:16,936 INFO L175 Difference]: Start difference. First operand has 207 places, 209 transitions, 448 flow. Second operand 6 states and 1336 transitions. [2024-11-20 13:55:16,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 215 transitions, 532 flow [2024-11-20 13:55:16,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 215 transitions, 532 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:55:16,940 INFO L231 Difference]: Finished difference. Result has 210 places, 207 transitions, 468 flow [2024-11-20 13:55:16,941 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=210, PETRI_TRANSITIONS=207} [2024-11-20 13:55:16,942 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -15 predicate places. [2024-11-20 13:55:16,942 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 207 transitions, 468 flow [2024-11-20 13:55:16,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.83333333333334) internal successors, (1313), 6 states have internal predecessors, (1313), 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-20 13:55:16,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:16,944 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:55:16,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 13:55:16,945 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:16,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:16,946 INFO L85 PathProgramCache]: Analyzing trace with hash 325244081, now seen corresponding path program 1 times [2024-11-20 13:55:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997349909] [2024-11-20 13:55:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:17,497 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-20 13:55:17,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:17,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997349909] [2024-11-20 13:55:17,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997349909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:17,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:17,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:55:17,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196421419] [2024-11-20 13:55:17,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:17,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:55:17,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:17,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:55:17,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:55:17,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 255 [2024-11-20 13:55:17,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 207 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 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-20 13:55:17,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:17,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 255 [2024-11-20 13:55:17,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:17,806 INFO L124 PetriNetUnfolderBase]: 38/401 cut-off events. [2024-11-20 13:55:17,806 INFO L125 PetriNetUnfolderBase]: For 95/125 co-relation queries the response was YES. [2024-11-20 13:55:17,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 401 events. 38/401 cut-off events. For 95/125 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1094 event pairs, 2 based on Foata normal form. 8/362 useless extension candidates. Maximal degree in co-relation 528. Up to 38 conditions per place. [2024-11-20 13:55:17,809 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 24 selfloop transitions, 5 changer transitions 0/214 dead transitions. [2024-11-20 13:55:17,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 214 transitions, 572 flow [2024-11-20 13:55:17,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:55:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:55:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1366 transitions. [2024-11-20 13:55:17,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8928104575163399 [2024-11-20 13:55:17,813 INFO L175 Difference]: Start difference. First operand has 210 places, 207 transitions, 468 flow. Second operand 6 states and 1366 transitions. [2024-11-20 13:55:17,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 214 transitions, 572 flow [2024-11-20 13:55:17,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 214 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 13:55:17,819 INFO L231 Difference]: Finished difference. Result has 209 places, 206 transitions, 452 flow [2024-11-20 13:55:17,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=452, PETRI_PLACES=209, PETRI_TRANSITIONS=206} [2024-11-20 13:55:17,820 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -16 predicate places. [2024-11-20 13:55:17,821 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 206 transitions, 452 flow [2024-11-20 13:55:17,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 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-20 13:55:17,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:17,822 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:55:17,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 13:55:17,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:17,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:17,823 INFO L85 PathProgramCache]: Analyzing trace with hash 769757454, now seen corresponding path program 1 times [2024-11-20 13:55:17,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:17,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90795906] [2024-11-20 13:55:17,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:17,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:17,897 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-20 13:55:17,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:17,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90795906] [2024-11-20 13:55:17,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90795906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:17,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:17,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:17,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312923753] [2024-11-20 13:55:17,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:17,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:17,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 255 [2024-11-20 13:55:17,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 206 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-20 13:55:17,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:17,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 255 [2024-11-20 13:55:17,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:17,971 INFO L124 PetriNetUnfolderBase]: 38/399 cut-off events. [2024-11-20 13:55:17,971 INFO L125 PetriNetUnfolderBase]: For 35/65 co-relation queries the response was YES. [2024-11-20 13:55:17,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 399 events. 38/399 cut-off events. For 35/65 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1078 event pairs, 2 based on Foata normal form. 2/350 useless extension candidates. Maximal degree in co-relation 477. Up to 42 conditions per place. [2024-11-20 13:55:17,974 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 13 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2024-11-20 13:55:17,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 207 transitions, 488 flow [2024-11-20 13:55:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2024-11-20 13:55:17,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9241830065359478 [2024-11-20 13:55:17,976 INFO L175 Difference]: Start difference. First operand has 209 places, 206 transitions, 452 flow. Second operand 3 states and 707 transitions. [2024-11-20 13:55:17,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 207 transitions, 488 flow [2024-11-20 13:55:17,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 207 transitions, 478 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 13:55:17,980 INFO L231 Difference]: Finished difference. Result has 205 places, 205 transitions, 444 flow [2024-11-20 13:55:17,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=205, PETRI_TRANSITIONS=205} [2024-11-20 13:55:17,982 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -20 predicate places. [2024-11-20 13:55:17,982 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 205 transitions, 444 flow [2024-11-20 13:55:17,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-20 13:55:17,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:17,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:55:17,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 13:55:17,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:17,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash -627350028, now seen corresponding path program 1 times [2024-11-20 13:55:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:17,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970877547] [2024-11-20 13:55:17,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:17,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:18,038 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-20 13:55:18,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:18,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970877547] [2024-11-20 13:55:18,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970877547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:18,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:18,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:18,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932945465] [2024-11-20 13:55:18,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:18,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:18,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:18,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:18,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2024-11-20 13:55:18,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 205 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-20 13:55:18,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:18,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2024-11-20 13:55:18,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:18,120 INFO L124 PetriNetUnfolderBase]: 46/579 cut-off events. [2024-11-20 13:55:18,120 INFO L125 PetriNetUnfolderBase]: For 49/71 co-relation queries the response was YES. [2024-11-20 13:55:18,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 579 events. 46/579 cut-off events. For 49/71 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1633 event pairs, 4 based on Foata normal form. 2/520 useless extension candidates. Maximal degree in co-relation 671. Up to 41 conditions per place. [2024-11-20 13:55:18,124 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 13 selfloop transitions, 2 changer transitions 2/210 dead transitions. [2024-11-20 13:55:18,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 210 transitions, 499 flow [2024-11-20 13:55:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-11-20 13:55:18,126 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9320261437908497 [2024-11-20 13:55:18,126 INFO L175 Difference]: Start difference. First operand has 205 places, 205 transitions, 444 flow. Second operand 3 states and 713 transitions. [2024-11-20 13:55:18,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 210 transitions, 499 flow [2024-11-20 13:55:18,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 210 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:18,133 INFO L231 Difference]: Finished difference. Result has 205 places, 205 transitions, 448 flow [2024-11-20 13:55:18,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=205, PETRI_TRANSITIONS=205} [2024-11-20 13:55:18,134 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -20 predicate places. [2024-11-20 13:55:18,134 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 205 transitions, 448 flow [2024-11-20 13:55:18,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-20 13:55:18,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:18,135 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:55:18,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 13:55:18,136 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-20 13:55:18,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1291373065, now seen corresponding path program 1 times [2024-11-20 13:55:18,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:18,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393206611] [2024-11-20 13:55:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:18,187 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-20 13:55:18,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:18,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393206611] [2024-11-20 13:55:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393206611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:18,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:18,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810178365] [2024-11-20 13:55:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:18,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:18,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:18,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:18,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:18,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 255 [2024-11-20 13:55:18,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 205 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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-20 13:55:18,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:18,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 255 [2024-11-20 13:55:18,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:18,289 INFO L124 PetriNetUnfolderBase]: 50/581 cut-off events. [2024-11-20 13:55:18,289 INFO L125 PetriNetUnfolderBase]: For 51/65 co-relation queries the response was YES. [2024-11-20 13:55:18,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 581 events. 50/581 cut-off events. For 51/65 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1624 event pairs, 4 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 685. Up to 56 conditions per place. [2024-11-20 13:55:18,292 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 0 selfloop transitions, 0 changer transitions 206/206 dead transitions. [2024-11-20 13:55:18,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 206 transitions, 484 flow [2024-11-20 13:55:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2024-11-20 13:55:18,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9163398692810457 [2024-11-20 13:55:18,294 INFO L175 Difference]: Start difference. First operand has 205 places, 205 transitions, 448 flow. Second operand 3 states and 701 transitions. [2024-11-20 13:55:18,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 206 transitions, 484 flow [2024-11-20 13:55:18,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 206 transitions, 482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:55:18,298 INFO L231 Difference]: Finished difference. Result has 205 places, 0 transitions, 0 flow [2024-11-20 13:55:18,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=205, PETRI_TRANSITIONS=0} [2024-11-20 13:55:18,300 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -20 predicate places. [2024-11-20 13:55:18,301 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 0 transitions, 0 flow [2024-11-20 13:55:18,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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-20 13:55:18,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 32 remaining) [2024-11-20 13:55:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2024-11-20 13:55:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2024-11-20 13:55:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2024-11-20 13:55:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2024-11-20 13:55:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2024-11-20 13:55:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining) [2024-11-20 13:55:18,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2024-11-20 13:55:18,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2024-11-20 13:55:18,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2024-11-20 13:55:18,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2024-11-20 13:55:18,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 32 remaining) [2024-11-20 13:55:18,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2024-11-20 13:55:18,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2024-11-20 13:55:18,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2024-11-20 13:55:18,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2024-11-20 13:55:18,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2024-11-20 13:55:18,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2024-11-20 13:55:18,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 32 remaining) [2024-11-20 13:55:18,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 32 remaining) [2024-11-20 13:55:18,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2024-11-20 13:55:18,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2024-11-20 13:55:18,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2024-11-20 13:55:18,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2024-11-20 13:55:18,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2024-11-20 13:55:18,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2024-11-20 13:55:18,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2024-11-20 13:55:18,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2024-11-20 13:55:18,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2024-11-20 13:55:18,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2024-11-20 13:55:18,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2024-11-20 13:55:18,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2024-11-20 13:55:18,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 13:55:18,313 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:18,321 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 13:55:18,321 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 13:55:18,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:55:18 BasicIcfg [2024-11-20 13:55:18,328 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 13:55:18,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 13:55:18,329 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 13:55:18,329 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 13:55:18,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:55:13" (3/4) ... [2024-11-20 13:55:18,331 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 13:55:18,333 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-20 13:55:18,334 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-20 13:55:18,338 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-20 13:55:18,339 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-20 13:55:18,339 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 13:55:18,339 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 13:55:18,425 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 13:55:18,426 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 13:55:18,426 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 13:55:18,427 INFO L158 Benchmark]: Toolchain (without parser) took 6135.39ms. Allocated memory was 165.7MB in the beginning and 255.9MB in the end (delta: 90.2MB). Free memory was 95.9MB in the beginning and 201.5MB in the end (delta: -105.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 13:55:18,427 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 13:55:18,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.63ms. Allocated memory is still 165.7MB. Free memory was 95.7MB in the beginning and 81.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 13:55:18,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.73ms. Allocated memory is still 165.7MB. Free memory was 81.7MB in the beginning and 79.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:55:18,428 INFO L158 Benchmark]: Boogie Preprocessor took 34.48ms. Allocated memory is still 165.7MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:55:18,428 INFO L158 Benchmark]: RCFGBuilder took 646.49ms. Allocated memory is still 165.7MB. Free memory was 77.2MB in the beginning and 115.8MB in the end (delta: -38.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-20 13:55:18,428 INFO L158 Benchmark]: TraceAbstraction took 4942.99ms. Allocated memory was 165.7MB in the beginning and 255.9MB in the end (delta: 90.2MB). Free memory was 115.2MB in the beginning and 207.8MB in the end (delta: -92.6MB). Peak memory consumption was 133.4MB. Max. memory is 16.1GB. [2024-11-20 13:55:18,429 INFO L158 Benchmark]: Witness Printer took 97.70ms. Allocated memory is still 255.9MB. Free memory was 206.7MB in the beginning and 201.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 13:55:18,430 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.17ms. Allocated memory is still 113.2MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.63ms. Allocated memory is still 165.7MB. Free memory was 95.7MB in the beginning and 81.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.73ms. Allocated memory is still 165.7MB. Free memory was 81.7MB in the beginning and 79.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.48ms. Allocated memory is still 165.7MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 646.49ms. Allocated memory is still 165.7MB. Free memory was 77.2MB in the beginning and 115.8MB in the end (delta: -38.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4942.99ms. Allocated memory was 165.7MB in the beginning and 255.9MB in the end (delta: 90.2MB). Free memory was 115.2MB in the beginning and 207.8MB in the end (delta: -92.6MB). Peak memory consumption was 133.4MB. Max. memory is 16.1GB. * Witness Printer took 97.70ms. Allocated memory is still 255.9MB. Free memory was 206.7MB in the beginning and 201.5MB 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: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 357 locations, 32 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: 4.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 540 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 910 IncrementalHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 28 mSDtfsCounter, 910 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=478occurred in iteration=0, InterpolantAutomatonStates: 45, 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, 1.8s InterpolantComputationTime, 1067 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1055 ConstructedInterpolants, 0 QuantifiedInterpolants, 1512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-20 13:55:18,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE