./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-horseshoe.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 ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:39:13,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:39:13,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:39:13,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:39:13,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:39:13,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:39:13,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:39:13,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:39:13,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:39:13,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:39:13,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:39:13,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:39:13,392 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:39:13,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:39:13,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:39:13,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:39:13,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:39:13,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:39:13,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:39:13,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:39:13,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:39:13,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:39:13,406 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:39:13,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:39:13,406 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:39:13,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:39:13,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:39:13,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:39:13,408 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:39:13,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:39:13,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:39:13,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:39:13,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:39:13,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:39:13,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:39:13,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:39:13,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:39:13,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:39:13,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:39:13,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:39:13,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:39:13,411 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 -> ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d [2024-11-10 14:39:13,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:39:13,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:39:13,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:39:13,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:39:13,685 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:39:13,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2024-11-10 14:39:15,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:39:15,444 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:39:15,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2024-11-10 14:39:15,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3f5834f/fb5e9d18057d48df912ec6efa25b0165/FLAG904fb8266 [2024-11-10 14:39:15,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3f5834f/fb5e9d18057d48df912ec6efa25b0165 [2024-11-10 14:39:15,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:39:15,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:39:15,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:39:15,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:39:15,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:39:15,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:39:15" (1/1) ... [2024-11-10 14:39:15,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f90464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:15, skipping insertion in model container [2024-11-10 14:39:15,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:39:15" (1/1) ... [2024-11-10 14:39:15,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:39:16,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:39:16,112 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:39:16,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:39:16,176 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:39:16,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16 WrapperNode [2024-11-10 14:39:16,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:39:16,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:39:16,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:39:16,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:39:16,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,260 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 455 [2024-11-10 14:39:16,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:39:16,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:39:16,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:39:16,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:39:16,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:39:16,311 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:39:16,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:39:16,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:39:16,312 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (1/1) ... [2024-11-10 14:39:16,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:39:16,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:39:16,349 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-10 14:39:16,351 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-10 14:39:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:39:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:39:16,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:39:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:39:16,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:39:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:39:16,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:39:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:39:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:39:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 14:39:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 14:39:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:39:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:39:16,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:39:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:39:16,399 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:39:16,512 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:39:16,515 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:39:17,308 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:39:17,308 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:39:17,681 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:39:17,682 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:39:17,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:17 BoogieIcfgContainer [2024-11-10 14:39:17,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:39:17,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:39:17,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:39:17,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:39:17,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:39:15" (1/3) ... [2024-11-10 14:39:17,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ee76df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:39:17, skipping insertion in model container [2024-11-10 14:39:17,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:16" (2/3) ... [2024-11-10 14:39:17,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ee76df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:39:17, skipping insertion in model container [2024-11-10 14:39:17,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:17" (3/3) ... [2024-11-10 14:39:17,692 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2024-11-10 14:39:17,712 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:39:17,714 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-11-10 14:39:17,714 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:39:17,853 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:39:17,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 351 places, 359 transitions, 739 flow [2024-11-10 14:39:18,040 INFO L124 PetriNetUnfolderBase]: 18/356 cut-off events. [2024-11-10 14:39:18,042 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:39:18,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 356 events. 18/356 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 547 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 302. Up to 3 conditions per place. [2024-11-10 14:39:18,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 351 places, 359 transitions, 739 flow [2024-11-10 14:39:18,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 332 places, 339 transitions, 696 flow [2024-11-10 14:39:18,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:39:18,083 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;@4250df23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:39:18,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2024-11-10 14:39:18,091 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:39:18,092 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-10 14:39:18,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:39:18,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:18,093 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] [2024-11-10 14:39:18,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:18,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:18,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1617975564, now seen corresponding path program 1 times [2024-11-10 14:39:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:18,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542811613] [2024-11-10 14:39:18,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:18,330 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-10 14:39:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542811613] [2024-11-10 14:39:18,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542811613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:18,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:18,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202004892] [2024-11-10 14:39:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:18,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:18,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:18,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 359 [2024-11-10 14:39:18,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 339 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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-10 14:39:18,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:18,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 359 [2024-11-10 14:39:18,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:18,651 INFO L124 PetriNetUnfolderBase]: 55/543 cut-off events. [2024-11-10 14:39:18,651 INFO L125 PetriNetUnfolderBase]: For 38/39 co-relation queries the response was YES. [2024-11-10 14:39:18,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 543 events. 55/543 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1895 event pairs, 38 based on Foata normal form. 79/557 useless extension candidates. Maximal degree in co-relation 385. Up to 90 conditions per place. [2024-11-10 14:39:18,662 INFO L140 encePairwiseOnDemand]: 300/359 looper letters, 15 selfloop transitions, 2 changer transitions 5/282 dead transitions. [2024-11-10 14:39:18,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 282 transitions, 616 flow [2024-11-10 14:39:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2024-11-10 14:39:18,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8542246982358404 [2024-11-10 14:39:18,689 INFO L175 Difference]: Start difference. First operand has 332 places, 339 transitions, 696 flow. Second operand 3 states and 920 transitions. [2024-11-10 14:39:18,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 282 transitions, 616 flow [2024-11-10 14:39:18,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 282 transitions, 604 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:39:18,702 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 564 flow [2024-11-10 14:39:18,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2024-11-10 14:39:18,708 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -49 predicate places. [2024-11-10 14:39:18,709 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 564 flow [2024-11-10 14:39:18,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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-10 14:39:18,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:18,711 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] [2024-11-10 14:39:18,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:39:18,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:18,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1926925283, now seen corresponding path program 1 times [2024-11-10 14:39:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:18,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504913026] [2024-11-10 14:39:18,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:18,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:18,776 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-10 14:39:18,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:18,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504913026] [2024-11-10 14:39:18,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504913026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:18,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:18,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842797622] [2024-11-10 14:39:18,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:18,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:18,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:18,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:18,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 359 [2024-11-10 14:39:18,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 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-10 14:39:18,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:18,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 359 [2024-11-10 14:39:18,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:18,921 INFO L124 PetriNetUnfolderBase]: 55/561 cut-off events. [2024-11-10 14:39:18,921 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-10 14:39:18,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 561 events. 55/561 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2046 event pairs, 7 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 634. Up to 69 conditions per place. [2024-11-10 14:39:18,926 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 18 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-11-10 14:39:18,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 282 transitions, 616 flow [2024-11-10 14:39:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2024-11-10 14:39:18,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8161559888579387 [2024-11-10 14:39:18,929 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 564 flow. Second operand 3 states and 879 transitions. [2024-11-10 14:39:18,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 282 transitions, 616 flow [2024-11-10 14:39:18,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 282 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:18,935 INFO L231 Difference]: Finished difference. Result has 278 places, 277 transitions, 568 flow [2024-11-10 14:39:18,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=278, PETRI_TRANSITIONS=277} [2024-11-10 14:39:18,937 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -54 predicate places. [2024-11-10 14:39:18,937 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 277 transitions, 568 flow [2024-11-10 14:39:18,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 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-10 14:39:18,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:18,938 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] [2024-11-10 14:39:18,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:39:18,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:18,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:18,939 INFO L85 PathProgramCache]: Analyzing trace with hash 722710485, now seen corresponding path program 1 times [2024-11-10 14:39:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:18,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565471483] [2024-11-10 14:39:18,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:19,016 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-10 14:39:19,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565471483] [2024-11-10 14:39:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565471483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:19,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:19,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152631515] [2024-11-10 14:39:19,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:19,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:19,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:19,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:19,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:39:19,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 277 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-10 14:39:19,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:19,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:39:19,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:19,142 INFO L124 PetriNetUnfolderBase]: 55/545 cut-off events. [2024-11-10 14:39:19,142 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2024-11-10 14:39:19,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 545 events. 55/545 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1988 event pairs, 38 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 324. Up to 92 conditions per place. [2024-11-10 14:39:19,147 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 15 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2024-11-10 14:39:19,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 276 transitions, 600 flow [2024-11-10 14:39:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-11-10 14:39:19,149 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040854224698236 [2024-11-10 14:39:19,150 INFO L175 Difference]: Start difference. First operand has 278 places, 277 transitions, 568 flow. Second operand 3 states and 866 transitions. [2024-11-10 14:39:19,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 276 transitions, 600 flow [2024-11-10 14:39:19,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 276 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:19,155 INFO L231 Difference]: Finished difference. Result has 278 places, 276 transitions, 568 flow [2024-11-10 14:39:19,156 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=278, PETRI_TRANSITIONS=276} [2024-11-10 14:39:19,157 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -54 predicate places. [2024-11-10 14:39:19,157 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 276 transitions, 568 flow [2024-11-10 14:39:19,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-10 14:39:19,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:19,158 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] [2024-11-10 14:39:19,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:39:19,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:19,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:19,159 INFO L85 PathProgramCache]: Analyzing trace with hash 92075476, now seen corresponding path program 1 times [2024-11-10 14:39:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175737595] [2024-11-10 14:39:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:19,228 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-10 14:39:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175737595] [2024-11-10 14:39:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175737595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:19,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:19,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346194046] [2024-11-10 14:39:19,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:19,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:19,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:19,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 359 [2024-11-10 14:39:19,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 276 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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-10 14:39:19,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:19,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 359 [2024-11-10 14:39:19,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:19,402 INFO L124 PetriNetUnfolderBase]: 55/544 cut-off events. [2024-11-10 14:39:19,403 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2024-11-10 14:39:19,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 544 events. 55/544 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1980 event pairs, 38 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 635. Up to 93 conditions per place. [2024-11-10 14:39:19,407 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 16 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2024-11-10 14:39:19,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 275 transitions, 602 flow [2024-11-10 14:39:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2024-11-10 14:39:19,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8022284122562674 [2024-11-10 14:39:19,410 INFO L175 Difference]: Start difference. First operand has 278 places, 276 transitions, 568 flow. Second operand 3 states and 864 transitions. [2024-11-10 14:39:19,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 275 transitions, 602 flow [2024-11-10 14:39:19,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 275 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:19,415 INFO L231 Difference]: Finished difference. Result has 277 places, 275 transitions, 566 flow [2024-11-10 14:39:19,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=277, PETRI_TRANSITIONS=275} [2024-11-10 14:39:19,416 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -55 predicate places. [2024-11-10 14:39:19,416 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 275 transitions, 566 flow [2024-11-10 14:39:19,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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-10 14:39:19,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:19,417 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] [2024-11-10 14:39:19,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:39:19,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:19,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1905999049, now seen corresponding path program 1 times [2024-11-10 14:39:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:19,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880293833] [2024-11-10 14:39:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:19,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:19,458 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-10 14:39:19,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:19,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880293833] [2024-11-10 14:39:19,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880293833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:19,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:19,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:19,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272895200] [2024-11-10 14:39:19,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:19,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:19,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:19,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:19,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 359 [2024-11-10 14:39:19,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 275 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 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-10 14:39:19,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:19,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 359 [2024-11-10 14:39:19,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:19,602 INFO L124 PetriNetUnfolderBase]: 65/667 cut-off events. [2024-11-10 14:39:19,602 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-10 14:39:19,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 667 events. 65/667 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2810 event pairs, 20 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 760. Up to 54 conditions per place. [2024-11-10 14:39:19,607 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 21 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-11-10 14:39:19,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 282 transitions, 632 flow [2024-11-10 14:39:19,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2024-11-10 14:39:19,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8170844939647168 [2024-11-10 14:39:19,611 INFO L175 Difference]: Start difference. First operand has 277 places, 275 transitions, 566 flow. Second operand 3 states and 880 transitions. [2024-11-10 14:39:19,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 282 transitions, 632 flow [2024-11-10 14:39:19,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 282 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:19,616 INFO L231 Difference]: Finished difference. Result has 277 places, 275 transitions, 570 flow [2024-11-10 14:39:19,617 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=275} [2024-11-10 14:39:19,617 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -55 predicate places. [2024-11-10 14:39:19,617 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 275 transitions, 570 flow [2024-11-10 14:39:19,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 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-10 14:39:19,618 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:19,619 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:19,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:39:19,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:19,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:19,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2036991448, now seen corresponding path program 1 times [2024-11-10 14:39:19,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:19,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762375198] [2024-11-10 14:39:19,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:19,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:19,652 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-10 14:39:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:19,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762375198] [2024-11-10 14:39:19,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762375198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:19,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986932274] [2024-11-10 14:39:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:19,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:19,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:19,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:19,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:39:19,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 275 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-10 14:39:19,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:19,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:39:19,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:19,812 INFO L124 PetriNetUnfolderBase]: 65/561 cut-off events. [2024-11-10 14:39:19,813 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-11-10 14:39:19,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 561 events. 65/561 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2071 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 454. Up to 105 conditions per place. [2024-11-10 14:39:19,818 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 16 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2024-11-10 14:39:19,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 274 transitions, 604 flow [2024-11-10 14:39:19,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-11-10 14:39:19,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040854224698236 [2024-11-10 14:39:19,822 INFO L175 Difference]: Start difference. First operand has 277 places, 275 transitions, 570 flow. Second operand 3 states and 866 transitions. [2024-11-10 14:39:19,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 274 transitions, 604 flow [2024-11-10 14:39:19,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 274 transitions, 602 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:19,828 INFO L231 Difference]: Finished difference. Result has 277 places, 274 transitions, 570 flow [2024-11-10 14:39:19,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=274} [2024-11-10 14:39:19,830 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -55 predicate places. [2024-11-10 14:39:19,830 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 274 transitions, 570 flow [2024-11-10 14:39:19,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-10 14:39:19,831 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:19,831 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] [2024-11-10 14:39:19,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:39:19,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:19,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:19,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2018248168, now seen corresponding path program 1 times [2024-11-10 14:39:19,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:19,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582612224] [2024-11-10 14:39:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:19,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:19,882 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-10 14:39:19,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:19,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582612224] [2024-11-10 14:39:19,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582612224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:19,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:19,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:19,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249144512] [2024-11-10 14:39:19,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:19,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:19,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:19,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:19,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:19,898 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 359 [2024-11-10 14:39:19,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 274 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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-10 14:39:19,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:19,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 359 [2024-11-10 14:39:19,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:19,992 INFO L124 PetriNetUnfolderBase]: 65/560 cut-off events. [2024-11-10 14:39:19,992 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-10 14:39:19,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 560 events. 65/560 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2051 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 675. Up to 106 conditions per place. [2024-11-10 14:39:19,996 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 17 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2024-11-10 14:39:19,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 273 transitions, 606 flow [2024-11-10 14:39:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2024-11-10 14:39:19,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8022284122562674 [2024-11-10 14:39:19,998 INFO L175 Difference]: Start difference. First operand has 277 places, 274 transitions, 570 flow. Second operand 3 states and 864 transitions. [2024-11-10 14:39:19,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 273 transitions, 606 flow [2024-11-10 14:39:20,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 273 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:20,003 INFO L231 Difference]: Finished difference. Result has 276 places, 273 transitions, 568 flow [2024-11-10 14:39:20,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=276, PETRI_TRANSITIONS=273} [2024-11-10 14:39:20,005 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -56 predicate places. [2024-11-10 14:39:20,005 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 273 transitions, 568 flow [2024-11-10 14:39:20,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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-10 14:39:20,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:20,006 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] [2024-11-10 14:39:20,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:39:20,007 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:20,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1014937138, now seen corresponding path program 1 times [2024-11-10 14:39:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:20,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028551782] [2024-11-10 14:39:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:20,050 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-10 14:39:20,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:20,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028551782] [2024-11-10 14:39:20,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028551782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:20,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:20,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070919046] [2024-11-10 14:39:20,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:20,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:20,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:20,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:20,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 359 [2024-11-10 14:39:20,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 273 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 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-10 14:39:20,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:20,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 359 [2024-11-10 14:39:20,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:20,171 INFO L124 PetriNetUnfolderBase]: 65/559 cut-off events. [2024-11-10 14:39:20,171 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-11-10 14:39:20,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 559 events. 65/559 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2050 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 663. Up to 103 conditions per place. [2024-11-10 14:39:20,174 INFO L140 encePairwiseOnDemand]: 357/359 looper letters, 15 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2024-11-10 14:39:20,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 272 transitions, 598 flow [2024-11-10 14:39:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2024-11-10 14:39:20,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8105849582172702 [2024-11-10 14:39:20,177 INFO L175 Difference]: Start difference. First operand has 276 places, 273 transitions, 568 flow. Second operand 3 states and 873 transitions. [2024-11-10 14:39:20,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 272 transitions, 598 flow [2024-11-10 14:39:20,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 272 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:20,183 INFO L231 Difference]: Finished difference. Result has 275 places, 272 transitions, 564 flow [2024-11-10 14:39:20,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=275, PETRI_TRANSITIONS=272} [2024-11-10 14:39:20,186 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -57 predicate places. [2024-11-10 14:39:20,187 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 272 transitions, 564 flow [2024-11-10 14:39:20,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 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-10 14:39:20,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:20,188 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] [2024-11-10 14:39:20,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:39:20,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:20,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1853110974, now seen corresponding path program 1 times [2024-11-10 14:39:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:20,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258108118] [2024-11-10 14:39:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:20,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:20,266 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-10 14:39:20,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:20,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258108118] [2024-11-10 14:39:20,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258108118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:20,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:20,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371625346] [2024-11-10 14:39:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:20,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:20,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:20,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:20,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:20,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:39:20,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 272 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-10 14:39:20,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:20,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:39:20,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:20,389 INFO L124 PetriNetUnfolderBase]: 65/558 cut-off events. [2024-11-10 14:39:20,389 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-10 14:39:20,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 558 events. 65/558 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2045 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 663. Up to 105 conditions per place. [2024-11-10 14:39:20,393 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 16 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2024-11-10 14:39:20,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 271 transitions, 598 flow [2024-11-10 14:39:20,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-11-10 14:39:20,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040854224698236 [2024-11-10 14:39:20,396 INFO L175 Difference]: Start difference. First operand has 275 places, 272 transitions, 564 flow. Second operand 3 states and 866 transitions. [2024-11-10 14:39:20,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 271 transitions, 598 flow [2024-11-10 14:39:20,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 271 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:20,400 INFO L231 Difference]: Finished difference. Result has 275 places, 271 transitions, 565 flow [2024-11-10 14:39:20,401 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=275, PETRI_TRANSITIONS=271} [2024-11-10 14:39:20,402 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -57 predicate places. [2024-11-10 14:39:20,402 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 271 transitions, 565 flow [2024-11-10 14:39:20,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-10 14:39:20,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:20,403 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] [2024-11-10 14:39:20,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:39:20,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:20,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash -226746288, now seen corresponding path program 1 times [2024-11-10 14:39:20,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:20,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065079726] [2024-11-10 14:39:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:20,977 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-10 14:39:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:20,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065079726] [2024-11-10 14:39:20,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065079726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:20,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:20,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:39:20,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607211344] [2024-11-10 14:39:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:20,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:39:20,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:20,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:39:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:39:21,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 359 [2024-11-10 14:39:21,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 271 transitions, 565 flow. Second operand has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 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-10 14:39:21,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:21,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 359 [2024-11-10 14:39:21,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:21,252 INFO L124 PetriNetUnfolderBase]: 65/556 cut-off events. [2024-11-10 14:39:21,252 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-10 14:39:21,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 556 events. 65/556 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2041 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 685. Up to 118 conditions per place. [2024-11-10 14:39:21,255 INFO L140 encePairwiseOnDemand]: 347/359 looper letters, 29 selfloop transitions, 10 changer transitions 0/269 dead transitions. [2024-11-10 14:39:21,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 269 transitions, 639 flow [2024-11-10 14:39:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:39:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:39:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1611 transitions. [2024-11-10 14:39:21,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7479108635097493 [2024-11-10 14:39:21,266 INFO L175 Difference]: Start difference. First operand has 275 places, 271 transitions, 565 flow. Second operand 6 states and 1611 transitions. [2024-11-10 14:39:21,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 269 transitions, 639 flow [2024-11-10 14:39:21,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 269 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:21,272 INFO L231 Difference]: Finished difference. Result has 276 places, 269 transitions, 577 flow [2024-11-10 14:39:21,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=577, PETRI_PLACES=276, PETRI_TRANSITIONS=269} [2024-11-10 14:39:21,275 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -56 predicate places. [2024-11-10 14:39:21,275 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 269 transitions, 577 flow [2024-11-10 14:39:21,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 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-10 14:39:21,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:21,277 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] [2024-11-10 14:39:21,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:39:21,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash 11799174, now seen corresponding path program 1 times [2024-11-10 14:39:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:21,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454572143] [2024-11-10 14:39:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:21,321 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-10 14:39:21,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:21,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454572143] [2024-11-10 14:39:21,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454572143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:21,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:21,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:21,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440336124] [2024-11-10 14:39:21,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:21,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:21,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:21,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:21,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:21,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 359 [2024-11-10 14:39:21,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 269 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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-10 14:39:21,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:21,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 359 [2024-11-10 14:39:21,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:21,447 INFO L124 PetriNetUnfolderBase]: 65/555 cut-off events. [2024-11-10 14:39:21,447 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-10 14:39:21,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 555 events. 65/555 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2027 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 706. Up to 106 conditions per place. [2024-11-10 14:39:21,452 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 17 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-11-10 14:39:21,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 268 transitions, 613 flow [2024-11-10 14:39:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2024-11-10 14:39:21,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8022284122562674 [2024-11-10 14:39:21,455 INFO L175 Difference]: Start difference. First operand has 276 places, 269 transitions, 577 flow. Second operand 3 states and 864 transitions. [2024-11-10 14:39:21,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 268 transitions, 613 flow [2024-11-10 14:39:21,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 268 transitions, 593 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:39:21,462 INFO L231 Difference]: Finished difference. Result has 272 places, 268 transitions, 559 flow [2024-11-10 14:39:21,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=272, PETRI_TRANSITIONS=268} [2024-11-10 14:39:21,463 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -60 predicate places. [2024-11-10 14:39:21,464 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 268 transitions, 559 flow [2024-11-10 14:39:21,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 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-10 14:39:21,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:21,464 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] [2024-11-10 14:39:21,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:39:21,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:21,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash 489023386, now seen corresponding path program 1 times [2024-11-10 14:39:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:21,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405936709] [2024-11-10 14:39:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:21,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:21,509 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-10 14:39:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405936709] [2024-11-10 14:39:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405936709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:21,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:21,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336491238] [2024-11-10 14:39:21,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:21,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:21,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:21,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:21,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:21,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 359 [2024-11-10 14:39:21,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 268 transitions, 559 flow. Second operand has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 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-10 14:39:21,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:21,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 359 [2024-11-10 14:39:21,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:21,614 INFO L124 PetriNetUnfolderBase]: 65/554 cut-off events. [2024-11-10 14:39:21,615 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-11-10 14:39:21,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 554 events. 65/554 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2030 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 660. Up to 103 conditions per place. [2024-11-10 14:39:21,619 INFO L140 encePairwiseOnDemand]: 357/359 looper letters, 15 selfloop transitions, 1 changer transitions 0/267 dead transitions. [2024-11-10 14:39:21,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 267 transitions, 589 flow [2024-11-10 14:39:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2024-11-10 14:39:21,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8105849582172702 [2024-11-10 14:39:21,622 INFO L175 Difference]: Start difference. First operand has 272 places, 268 transitions, 559 flow. Second operand 3 states and 873 transitions. [2024-11-10 14:39:21,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 267 transitions, 589 flow [2024-11-10 14:39:21,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 267 transitions, 585 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:21,628 INFO L231 Difference]: Finished difference. Result has 271 places, 267 transitions, 555 flow [2024-11-10 14:39:21,629 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=271, PETRI_TRANSITIONS=267} [2024-11-10 14:39:21,631 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -61 predicate places. [2024-11-10 14:39:21,631 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 267 transitions, 555 flow [2024-11-10 14:39:21,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 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-10 14:39:21,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:21,632 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-10 14:39:21,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:39:21,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:21,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:21,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1060055727, now seen corresponding path program 1 times [2024-11-10 14:39:21,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:21,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696489411] [2024-11-10 14:39:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:21,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:21,702 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-10 14:39:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696489411] [2024-11-10 14:39:21,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696489411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:21,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:21,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:21,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671828190] [2024-11-10 14:39:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:21,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:21,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:21,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:21,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:39:21,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 267 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-10 14:39:21,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:21,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:39:21,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:21,819 INFO L124 PetriNetUnfolderBase]: 65/553 cut-off events. [2024-11-10 14:39:21,820 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-10 14:39:21,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 553 events. 65/553 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2025 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 659. Up to 105 conditions per place. [2024-11-10 14:39:21,824 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 16 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2024-11-10 14:39:21,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 266 transitions, 589 flow [2024-11-10 14:39:21,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-11-10 14:39:21,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040854224698236 [2024-11-10 14:39:21,827 INFO L175 Difference]: Start difference. First operand has 271 places, 267 transitions, 555 flow. Second operand 3 states and 866 transitions. [2024-11-10 14:39:21,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 266 transitions, 589 flow [2024-11-10 14:39:21,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 266 transitions, 588 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:21,832 INFO L231 Difference]: Finished difference. Result has 271 places, 266 transitions, 556 flow [2024-11-10 14:39:21,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=271, PETRI_TRANSITIONS=266} [2024-11-10 14:39:21,834 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -61 predicate places. [2024-11-10 14:39:21,834 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 266 transitions, 556 flow [2024-11-10 14:39:21,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-10 14:39:21,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:21,835 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, 1, 1, 1, 1] [2024-11-10 14:39:21,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:39:21,835 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:21,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:21,836 INFO L85 PathProgramCache]: Analyzing trace with hash 860255281, now seen corresponding path program 1 times [2024-11-10 14:39:21,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:21,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54304912] [2024-11-10 14:39:21,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:21,882 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-10 14:39:21,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:21,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54304912] [2024-11-10 14:39:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54304912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:21,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:21,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023303776] [2024-11-10 14:39:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:21,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:21,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:21,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 359 [2024-11-10 14:39:21,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 266 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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-10 14:39:21,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:21,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 359 [2024-11-10 14:39:21,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:22,021 INFO L124 PetriNetUnfolderBase]: 93/629 cut-off events. [2024-11-10 14:39:22,021 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-11-10 14:39:22,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 629 events. 93/629 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2447 event pairs, 51 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 792. Up to 144 conditions per place. [2024-11-10 14:39:22,027 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 18 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-11-10 14:39:22,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 265 transitions, 594 flow [2024-11-10 14:39:22,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2024-11-10 14:39:22,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8003714020427113 [2024-11-10 14:39:22,029 INFO L175 Difference]: Start difference. First operand has 271 places, 266 transitions, 556 flow. Second operand 3 states and 862 transitions. [2024-11-10 14:39:22,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 265 transitions, 594 flow [2024-11-10 14:39:22,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 265 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:22,035 INFO L231 Difference]: Finished difference. Result has 270 places, 265 transitions, 554 flow [2024-11-10 14:39:22,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=270, PETRI_TRANSITIONS=265} [2024-11-10 14:39:22,037 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -62 predicate places. [2024-11-10 14:39:22,037 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 265 transitions, 554 flow [2024-11-10 14:39:22,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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-10 14:39:22,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:22,038 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:22,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:39:22,038 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:22,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2022864549, now seen corresponding path program 1 times [2024-11-10 14:39:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:22,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520001815] [2024-11-10 14:39:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:22,101 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-10 14:39:22,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:22,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520001815] [2024-11-10 14:39:22,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520001815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:22,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:22,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14315351] [2024-11-10 14:39:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:22,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:22,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:22,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:22,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:22,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:39:22,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 265 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 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-10 14:39:22,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:22,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:39:22,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:22,255 INFO L124 PetriNetUnfolderBase]: 112/692 cut-off events. [2024-11-10 14:39:22,255 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-10 14:39:22,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 692 events. 112/692 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2987 event pairs, 64 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 898. Up to 170 conditions per place. [2024-11-10 14:39:22,261 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 17 selfloop transitions, 1 changer transitions 0/263 dead transitions. [2024-11-10 14:39:22,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 263 transitions, 586 flow [2024-11-10 14:39:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2024-11-10 14:39:22,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8050139275766016 [2024-11-10 14:39:22,264 INFO L175 Difference]: Start difference. First operand has 270 places, 265 transitions, 554 flow. Second operand 3 states and 867 transitions. [2024-11-10 14:39:22,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 263 transitions, 586 flow [2024-11-10 14:39:22,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 263 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:22,271 INFO L231 Difference]: Finished difference. Result has 268 places, 263 transitions, 548 flow [2024-11-10 14:39:22,272 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=268, PETRI_TRANSITIONS=263} [2024-11-10 14:39:22,273 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -64 predicate places. [2024-11-10 14:39:22,273 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 263 transitions, 548 flow [2024-11-10 14:39:22,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 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-10 14:39:22,274 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:22,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:39:22,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:39:22,274 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:22,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2091097949, now seen corresponding path program 1 times [2024-11-10 14:39:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:22,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468759005] [2024-11-10 14:39:22,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:22,350 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-10 14:39:22,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:22,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468759005] [2024-11-10 14:39:22,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468759005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:22,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:22,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:22,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642785724] [2024-11-10 14:39:22,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:22,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:22,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:22,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:22,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:22,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:39:22,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 263 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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-10 14:39:22,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:22,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:39:22,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:22,477 INFO L124 PetriNetUnfolderBase]: 122/601 cut-off events. [2024-11-10 14:39:22,477 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2024-11-10 14:39:22,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 601 events. 122/601 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2331 event pairs, 53 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 829. Up to 132 conditions per place. [2024-11-10 14:39:22,482 INFO L140 encePairwiseOnDemand]: 354/359 looper letters, 21 selfloop transitions, 3 changer transitions 0/267 dead transitions. [2024-11-10 14:39:22,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 267 transitions, 610 flow [2024-11-10 14:39:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2024-11-10 14:39:22,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8096564531104921 [2024-11-10 14:39:22,485 INFO L175 Difference]: Start difference. First operand has 268 places, 263 transitions, 548 flow. Second operand 3 states and 872 transitions. [2024-11-10 14:39:22,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 267 transitions, 610 flow [2024-11-10 14:39:22,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 267 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:22,490 INFO L231 Difference]: Finished difference. Result has 267 places, 261 transitions, 549 flow [2024-11-10 14:39:22,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=267, PETRI_TRANSITIONS=261} [2024-11-10 14:39:22,492 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -65 predicate places. [2024-11-10 14:39:22,492 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 261 transitions, 549 flow [2024-11-10 14:39:22,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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-10 14:39:22,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:22,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:39:22,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:39:22,494 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:22,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash 994274591, now seen corresponding path program 1 times [2024-11-10 14:39:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:22,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654885353] [2024-11-10 14:39:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:22,570 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-10 14:39:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654885353] [2024-11-10 14:39:22,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654885353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:22,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:22,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:22,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091475850] [2024-11-10 14:39:22,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:22,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:22,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:22,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:22,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:22,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:39:22,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 261 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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-10 14:39:22,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:22,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:39:22,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:22,714 INFO L124 PetriNetUnfolderBase]: 160/629 cut-off events. [2024-11-10 14:39:22,714 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-11-10 14:39:22,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 629 events. 160/629 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2533 event pairs, 83 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 961. Up to 193 conditions per place. [2024-11-10 14:39:22,719 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 23 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2024-11-10 14:39:22,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 266 transitions, 615 flow [2024-11-10 14:39:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2024-11-10 14:39:22,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8096564531104921 [2024-11-10 14:39:22,722 INFO L175 Difference]: Start difference. First operand has 267 places, 261 transitions, 549 flow. Second operand 3 states and 872 transitions. [2024-11-10 14:39:22,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 266 transitions, 615 flow [2024-11-10 14:39:22,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 266 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:22,726 INFO L231 Difference]: Finished difference. Result has 266 places, 260 transitions, 545 flow [2024-11-10 14:39:22,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=266, PETRI_TRANSITIONS=260} [2024-11-10 14:39:22,728 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -66 predicate places. [2024-11-10 14:39:22,728 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 260 transitions, 545 flow [2024-11-10 14:39:22,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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-10 14:39:22,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:22,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:39:22,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:39:22,729 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:22,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:22,729 INFO L85 PathProgramCache]: Analyzing trace with hash -981455925, now seen corresponding path program 1 times [2024-11-10 14:39:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:22,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062463235] [2024-11-10 14:39:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:22,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:22,781 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-10 14:39:22,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062463235] [2024-11-10 14:39:22,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062463235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:22,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:22,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842513981] [2024-11-10 14:39:22,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:22,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:22,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:22,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:22,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:22,793 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:39:22,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 260 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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-10 14:39:22,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:22,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:39:22,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:22,949 INFO L124 PetriNetUnfolderBase]: 131/695 cut-off events. [2024-11-10 14:39:22,949 INFO L125 PetriNetUnfolderBase]: For 92/104 co-relation queries the response was YES. [2024-11-10 14:39:22,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 695 events. 131/695 cut-off events. For 92/104 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3116 event pairs, 56 based on Foata normal form. 1/650 useless extension candidates. Maximal degree in co-relation 948. Up to 137 conditions per place. [2024-11-10 14:39:22,953 INFO L140 encePairwiseOnDemand]: 354/359 looper letters, 20 selfloop transitions, 2 changer transitions 4/265 dead transitions. [2024-11-10 14:39:22,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 609 flow [2024-11-10 14:39:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2024-11-10 14:39:22,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8096564531104921 [2024-11-10 14:39:22,956 INFO L175 Difference]: Start difference. First operand has 266 places, 260 transitions, 545 flow. Second operand 3 states and 872 transitions. [2024-11-10 14:39:22,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 609 flow [2024-11-10 14:39:22,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 265 transitions, 605 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:22,960 INFO L231 Difference]: Finished difference. Result has 264 places, 254 transitions, 532 flow [2024-11-10 14:39:22,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=264, PETRI_TRANSITIONS=254} [2024-11-10 14:39:22,961 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -68 predicate places. [2024-11-10 14:39:22,961 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 254 transitions, 532 flow [2024-11-10 14:39:22,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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-10 14:39:22,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:22,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:39:22,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:39:22,962 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:22,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:22,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1897277965, now seen corresponding path program 1 times [2024-11-10 14:39:22,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:22,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732757418] [2024-11-10 14:39:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:22,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:23,030 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-10 14:39:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:23,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732757418] [2024-11-10 14:39:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732757418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:23,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:23,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203869536] [2024-11-10 14:39:23,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:23,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:23,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:23,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:39:23,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 254 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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-10 14:39:23,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:23,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:39:23,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:23,183 INFO L124 PetriNetUnfolderBase]: 175/750 cut-off events. [2024-11-10 14:39:23,183 INFO L125 PetriNetUnfolderBase]: For 130/156 co-relation queries the response was YES. [2024-11-10 14:39:23,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 750 events. 175/750 cut-off events. For 130/156 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3461 event pairs, 92 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 1093. Up to 206 conditions per place. [2024-11-10 14:39:23,187 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 0 selfloop transitions, 0 changer transitions 260/260 dead transitions. [2024-11-10 14:39:23,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 260 transitions, 598 flow [2024-11-10 14:39:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2024-11-10 14:39:23,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8087279480037141 [2024-11-10 14:39:23,190 INFO L175 Difference]: Start difference. First operand has 264 places, 254 transitions, 532 flow. Second operand 3 states and 871 transitions. [2024-11-10 14:39:23,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 260 transitions, 598 flow [2024-11-10 14:39:23,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 260 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:23,194 INFO L231 Difference]: Finished difference. Result has 259 places, 0 transitions, 0 flow [2024-11-10 14:39:23,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=259, PETRI_TRANSITIONS=0} [2024-11-10 14:39:23,195 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -73 predicate places. [2024-11-10 14:39:23,196 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 0 transitions, 0 flow [2024-11-10 14:39:23,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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-10 14:39:23,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (118 of 119 remaining) [2024-11-10 14:39:23,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (117 of 119 remaining) [2024-11-10 14:39:23,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (116 of 119 remaining) [2024-11-10 14:39:23,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (115 of 119 remaining) [2024-11-10 14:39:23,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (114 of 119 remaining) [2024-11-10 14:39:23,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (113 of 119 remaining) [2024-11-10 14:39:23,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (112 of 119 remaining) [2024-11-10 14:39:23,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (111 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (110 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (109 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (108 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (107 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (106 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (105 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (104 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (103 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (102 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (101 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (100 of 119 remaining) [2024-11-10 14:39:23,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (99 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (98 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (97 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (96 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (95 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (94 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (93 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (92 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (91 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (90 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (89 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (88 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (87 of 119 remaining) [2024-11-10 14:39:23,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (86 of 119 remaining) [2024-11-10 14:39:23,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (85 of 119 remaining) [2024-11-10 14:39:23,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (84 of 119 remaining) [2024-11-10 14:39:23,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (83 of 119 remaining) [2024-11-10 14:39:23,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (82 of 119 remaining) [2024-11-10 14:39:23,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 119 remaining) [2024-11-10 14:39:23,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (80 of 119 remaining) [2024-11-10 14:39:23,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (79 of 119 remaining) [2024-11-10 14:39:23,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (78 of 119 remaining) [2024-11-10 14:39:23,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (77 of 119 remaining) [2024-11-10 14:39:23,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (76 of 119 remaining) [2024-11-10 14:39:23,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (75 of 119 remaining) [2024-11-10 14:39:23,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (74 of 119 remaining) [2024-11-10 14:39:23,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (73 of 119 remaining) [2024-11-10 14:39:23,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (72 of 119 remaining) [2024-11-10 14:39:23,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (71 of 119 remaining) [2024-11-10 14:39:23,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (70 of 119 remaining) [2024-11-10 14:39:23,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (69 of 119 remaining) [2024-11-10 14:39:23,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (68 of 119 remaining) [2024-11-10 14:39:23,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (67 of 119 remaining) [2024-11-10 14:39:23,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (66 of 119 remaining) [2024-11-10 14:39:23,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (65 of 119 remaining) [2024-11-10 14:39:23,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (64 of 119 remaining) [2024-11-10 14:39:23,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (63 of 119 remaining) [2024-11-10 14:39:23,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (62 of 119 remaining) [2024-11-10 14:39:23,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (61 of 119 remaining) [2024-11-10 14:39:23,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 119 remaining) [2024-11-10 14:39:23,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (59 of 119 remaining) [2024-11-10 14:39:23,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (58 of 119 remaining) [2024-11-10 14:39:23,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (57 of 119 remaining) [2024-11-10 14:39:23,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (56 of 119 remaining) [2024-11-10 14:39:23,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (55 of 119 remaining) [2024-11-10 14:39:23,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (54 of 119 remaining) [2024-11-10 14:39:23,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 119 remaining) [2024-11-10 14:39:23,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (52 of 119 remaining) [2024-11-10 14:39:23,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 119 remaining) [2024-11-10 14:39:23,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 119 remaining) [2024-11-10 14:39:23,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 119 remaining) [2024-11-10 14:39:23,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (48 of 119 remaining) [2024-11-10 14:39:23,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (47 of 119 remaining) [2024-11-10 14:39:23,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (46 of 119 remaining) [2024-11-10 14:39:23,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 119 remaining) [2024-11-10 14:39:23,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 119 remaining) [2024-11-10 14:39:23,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (43 of 119 remaining) [2024-11-10 14:39:23,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (42 of 119 remaining) [2024-11-10 14:39:23,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (41 of 119 remaining) [2024-11-10 14:39:23,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (40 of 119 remaining) [2024-11-10 14:39:23,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (39 of 119 remaining) [2024-11-10 14:39:23,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (38 of 119 remaining) [2024-11-10 14:39:23,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (37 of 119 remaining) [2024-11-10 14:39:23,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (36 of 119 remaining) [2024-11-10 14:39:23,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (35 of 119 remaining) [2024-11-10 14:39:23,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (34 of 119 remaining) [2024-11-10 14:39:23,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 119 remaining) [2024-11-10 14:39:23,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 119 remaining) [2024-11-10 14:39:23,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (31 of 119 remaining) [2024-11-10 14:39:23,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (30 of 119 remaining) [2024-11-10 14:39:23,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (29 of 119 remaining) [2024-11-10 14:39:23,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (28 of 119 remaining) [2024-11-10 14:39:23,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (27 of 119 remaining) [2024-11-10 14:39:23,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (26 of 119 remaining) [2024-11-10 14:39:23,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 119 remaining) [2024-11-10 14:39:23,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (24 of 119 remaining) [2024-11-10 14:39:23,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (23 of 119 remaining) [2024-11-10 14:39:23,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 119 remaining) [2024-11-10 14:39:23,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (21 of 119 remaining) [2024-11-10 14:39:23,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (20 of 119 remaining) [2024-11-10 14:39:23,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 119 remaining) [2024-11-10 14:39:23,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 119 remaining) [2024-11-10 14:39:23,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 119 remaining) [2024-11-10 14:39:23,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 119 remaining) [2024-11-10 14:39:23,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (15 of 119 remaining) [2024-11-10 14:39:23,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 119 remaining) [2024-11-10 14:39:23,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 119 remaining) [2024-11-10 14:39:23,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 119 remaining) [2024-11-10 14:39:23,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 119 remaining) [2024-11-10 14:39:23,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 119 remaining) [2024-11-10 14:39:23,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 119 remaining) [2024-11-10 14:39:23,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 119 remaining) [2024-11-10 14:39:23,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 119 remaining) [2024-11-10 14:39:23,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 119 remaining) [2024-11-10 14:39:23,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 119 remaining) [2024-11-10 14:39:23,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 119 remaining) [2024-11-10 14:39:23,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 119 remaining) [2024-11-10 14:39:23,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 119 remaining) [2024-11-10 14:39:23,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 119 remaining) [2024-11-10 14:39:23,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 119 remaining) [2024-11-10 14:39:23,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:39:23,220 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:23,226 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:39:23,226 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:39:23,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:39:23 BasicIcfg [2024-11-10 14:39:23,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:39:23,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:39:23,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:39:23,233 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:39:23,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:17" (3/4) ... [2024-11-10 14:39:23,235 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:39:23,238 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:39:23,238 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:39:23,238 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 14:39:23,246 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2024-11-10 14:39:23,247 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:39:23,247 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:39:23,247 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:39:23,360 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:39:23,363 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:39:23,363 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:39:23,364 INFO L158 Benchmark]: Toolchain (without parser) took 7548.06ms. Allocated memory was 148.9MB in the beginning and 283.1MB in the end (delta: 134.2MB). Free memory was 104.8MB in the beginning and 126.8MB in the end (delta: -22.0MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2024-11-10 14:39:23,364 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 148.9MB. Free memory was 114.1MB in the beginning and 114.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:39:23,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.42ms. Allocated memory is still 148.9MB. Free memory was 104.8MB in the beginning and 89.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 14:39:23,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.05ms. Allocated memory is still 148.9MB. Free memory was 89.0MB in the beginning and 85.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:39:23,365 INFO L158 Benchmark]: Boogie Preprocessor took 45.66ms. Allocated memory is still 148.9MB. Free memory was 85.3MB in the beginning and 82.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:39:23,365 INFO L158 Benchmark]: IcfgBuilder took 1371.51ms. Allocated memory was 148.9MB in the beginning and 195.0MB in the end (delta: 46.1MB). Free memory was 82.7MB in the beginning and 99.0MB in the end (delta: -16.3MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-11-10 14:39:23,365 INFO L158 Benchmark]: TraceAbstraction took 5546.38ms. Allocated memory was 195.0MB in the beginning and 283.1MB in the end (delta: 88.1MB). Free memory was 97.9MB in the beginning and 133.0MB in the end (delta: -35.1MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2024-11-10 14:39:23,366 INFO L158 Benchmark]: Witness Printer took 131.18ms. Allocated memory is still 283.1MB. Free memory was 133.0MB in the beginning and 126.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:39:23,367 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.31ms. Allocated memory is still 148.9MB. Free memory was 114.1MB in the beginning and 114.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.42ms. Allocated memory is still 148.9MB. Free memory was 104.8MB in the beginning and 89.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.05ms. Allocated memory is still 148.9MB. Free memory was 89.0MB in the beginning and 85.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.66ms. Allocated memory is still 148.9MB. Free memory was 85.3MB in the beginning and 82.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1371.51ms. Allocated memory was 148.9MB in the beginning and 195.0MB in the end (delta: 46.1MB). Free memory was 82.7MB in the beginning and 99.0MB in the end (delta: -16.3MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5546.38ms. Allocated memory was 195.0MB in the beginning and 283.1MB in the end (delta: 88.1MB). Free memory was 97.9MB in the beginning and 133.0MB in the end (delta: -35.1MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * Witness Printer took 131.18ms. Allocated memory is still 283.1MB. Free memory was 133.0MB in the beginning and 126.8MB in the end (delta: 6.3MB). 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: 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 7 procedures, 441 locations, 119 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: 5.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 48 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=696occurred in iteration=0, InterpolantAutomatonStates: 60, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1883 NumberOfCodeBlocks, 1883 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1864 ConstructedInterpolants, 0 QuantifiedInterpolants, 2015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:39:23,399 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