./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_13-equ_proc_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_13-equ_proc_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 7aa541197ab3d76d3553dcc8603f5c865e8a029202164eb406db53a61111f080 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:41,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:41,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:22:41,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:41,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:41,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:41,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:41,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:41,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:41,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:41,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:41,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:41,143 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:41,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:41,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:41,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:41,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:41,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:41,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:41,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:41,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:41,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:41,143 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:41,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:41,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:41,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:41,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:41,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:41,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:41,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:41,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:41,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:41,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:41,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:41,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:41,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:41,146 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 7aa541197ab3d76d3553dcc8603f5c865e8a029202164eb406db53a61111f080 [2025-01-09 21:22:41,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:41,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:41,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:41,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:41,383 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:41,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_13-equ_proc_nr.i [2025-01-09 21:22:42,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f19cfc95/e69f45dc071644eabc404add304e432f/FLAG833f2e44c [2025-01-09 21:22:42,909 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:42,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_13-equ_proc_nr.i [2025-01-09 21:22:42,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f19cfc95/e69f45dc071644eabc404add304e432f/FLAG833f2e44c [2025-01-09 21:22:43,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f19cfc95/e69f45dc071644eabc404add304e432f [2025-01-09 21:22:43,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:43,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:43,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:43,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:43,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:43,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc72b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43, skipping insertion in model container [2025-01-09 21:22:43,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:43,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:43,433 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:43,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:43,495 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:43,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43 WrapperNode [2025-01-09 21:22:43,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:43,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:43,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:43,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:43,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,520 INFO L138 Inliner]: procedures = 266, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2025-01-09 21:22:43,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:43,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:43,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:43,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:43,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:43,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:43,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:43,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:43,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (1/1) ... [2025-01-09 21:22:43,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:43,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:43,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:22:43,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:22:43,583 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:22:43,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:22:43,583 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:22:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:22:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:22:43,584 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:22:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:22:43,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:43,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:43,585 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:22:43,669 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:22:43,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:22:43,847 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:22:43,849 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:22:43,872 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:22:43,872 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:22:43,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:43 BoogieIcfgContainer [2025-01-09 21:22:43,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:22:43,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:22:43,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:22:43,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:22:43,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:43" (1/3) ... [2025-01-09 21:22:43,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609c8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:43, skipping insertion in model container [2025-01-09 21:22:43,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:43" (2/3) ... [2025-01-09 21:22:43,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609c8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:43, skipping insertion in model container [2025-01-09 21:22:43,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:43" (3/3) ... [2025-01-09 21:22:43,880 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_13-equ_proc_nr.i [2025-01-09 21:22:43,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:22:43,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_13-equ_proc_nr.i that has 2 procedures, 81 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-09 21:22:43,893 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:22:43,944 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:22:43,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 81 transitions, 166 flow [2025-01-09 21:22:44,013 INFO L124 PetriNetUnfolderBase]: 1/80 cut-off events. [2025-01-09 21:22:44,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:44,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 80 events. 1/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-01-09 21:22:44,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 81 transitions, 166 flow [2025-01-09 21:22:44,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 80 transitions, 163 flow [2025-01-09 21:22:44,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:22:44,042 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;@1ecf42b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:22:44,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 21:22:44,060 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:22:44,060 INFO L124 PetriNetUnfolderBase]: 1/58 cut-off events. [2025-01-09 21:22:44,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:44,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:44,061 INFO L206 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] [2025-01-09 21:22:44,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:44,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash 986417451, now seen corresponding path program 1 times [2025-01-09 21:22:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116590976] [2025-01-09 21:22:44,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:44,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:22:44,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:22:44,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:44,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:44,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116590976] [2025-01-09 21:22:44,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116590976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:44,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:44,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314960141] [2025-01-09 21:22:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:44,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:44,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:44,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:44,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 81 [2025-01-09 21:22:44,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 64.5) internal successors, (387), 6 states have internal predecessors, (387), 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) [2025-01-09 21:22:44,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:44,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 81 [2025-01-09 21:22:44,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:44,957 INFO L124 PetriNetUnfolderBase]: 79/347 cut-off events. [2025-01-09 21:22:44,957 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:44,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 347 events. 79/347 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1519 event pairs, 25 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 484. Up to 130 conditions per place. [2025-01-09 21:22:44,960 INFO L140 encePairwiseOnDemand]: 70/81 looper letters, 21 selfloop transitions, 22 changer transitions 4/109 dead transitions. [2025-01-09 21:22:44,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 109 transitions, 315 flow [2025-01-09 21:22:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 426 transitions. [2025-01-09 21:22:44,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8765432098765432 [2025-01-09 21:22:44,972 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 163 flow. Second operand 6 states and 426 transitions. [2025-01-09 21:22:44,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 109 transitions, 315 flow [2025-01-09 21:22:44,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 109 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:44,978 INFO L231 Difference]: Finished difference. Result has 92 places, 101 transitions, 312 flow [2025-01-09 21:22:44,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=92, PETRI_TRANSITIONS=101} [2025-01-09 21:22:44,982 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2025-01-09 21:22:44,982 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 101 transitions, 312 flow [2025-01-09 21:22:44,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.5) internal successors, (387), 6 states have internal predecessors, (387), 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) [2025-01-09 21:22:44,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:44,983 INFO L206 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] [2025-01-09 21:22:44,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:22:44,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:44,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1846228120, now seen corresponding path program 1 times [2025-01-09 21:22:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:44,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617460334] [2025-01-09 21:22:44,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:44,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:22:45,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:22:45,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:45,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:45,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:45,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617460334] [2025-01-09 21:22:45,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617460334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:45,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:45,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:45,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192828520] [2025-01-09 21:22:45,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:45,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:45,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:45,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:45,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:45,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 81 [2025-01-09 21:22:45,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 101 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 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) [2025-01-09 21:22:45,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:45,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 81 [2025-01-09 21:22:45,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:45,418 INFO L124 PetriNetUnfolderBase]: 144/520 cut-off events. [2025-01-09 21:22:45,419 INFO L125 PetriNetUnfolderBase]: For 144/146 co-relation queries the response was YES. [2025-01-09 21:22:45,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 520 events. 144/520 cut-off events. For 144/146 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2603 event pairs, 43 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 1108. Up to 241 conditions per place. [2025-01-09 21:22:45,422 INFO L140 encePairwiseOnDemand]: 70/81 looper letters, 38 selfloop transitions, 29 changer transitions 7/136 dead transitions. [2025-01-09 21:22:45,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 136 transitions, 600 flow [2025-01-09 21:22:45,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 416 transitions. [2025-01-09 21:22:45,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8559670781893004 [2025-01-09 21:22:45,424 INFO L175 Difference]: Start difference. First operand has 92 places, 101 transitions, 312 flow. Second operand 6 states and 416 transitions. [2025-01-09 21:22:45,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 136 transitions, 600 flow [2025-01-09 21:22:45,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 136 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:45,428 INFO L231 Difference]: Finished difference. Result has 102 places, 125 transitions, 566 flow [2025-01-09 21:22:45,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=566, PETRI_PLACES=102, PETRI_TRANSITIONS=125} [2025-01-09 21:22:45,429 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 19 predicate places. [2025-01-09 21:22:45,429 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 125 transitions, 566 flow [2025-01-09 21:22:45,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 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) [2025-01-09 21:22:45,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:45,429 INFO L206 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] [2025-01-09 21:22:45,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:22:45,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:45,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash 878789003, now seen corresponding path program 1 times [2025-01-09 21:22:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:45,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635218210] [2025-01-09 21:22:45,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:45,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:45,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:45,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:45,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635218210] [2025-01-09 21:22:45,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635218210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:45,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:45,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:22:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869506551] [2025-01-09 21:22:45,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:45,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:22:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:45,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:22:45,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:22:45,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 81 [2025-01-09 21:22:45,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 125 transitions, 566 flow. Second operand has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 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) [2025-01-09 21:22:45,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:45,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 81 [2025-01-09 21:22:45,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:45,955 INFO L124 PetriNetUnfolderBase]: 88/454 cut-off events. [2025-01-09 21:22:45,955 INFO L125 PetriNetUnfolderBase]: For 188/192 co-relation queries the response was YES. [2025-01-09 21:22:45,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 454 events. 88/454 cut-off events. For 188/192 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2341 event pairs, 7 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 862. Up to 83 conditions per place. [2025-01-09 21:22:45,958 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 11 selfloop transitions, 4 changer transitions 13/137 dead transitions. [2025-01-09 21:22:45,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 137 transitions, 646 flow [2025-01-09 21:22:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:22:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:22:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 491 transitions. [2025-01-09 21:22:45,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8659611992945326 [2025-01-09 21:22:45,960 INFO L175 Difference]: Start difference. First operand has 102 places, 125 transitions, 566 flow. Second operand 7 states and 491 transitions. [2025-01-09 21:22:45,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 137 transitions, 646 flow [2025-01-09 21:22:45,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 137 transitions, 628 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:45,967 INFO L231 Difference]: Finished difference. Result has 111 places, 123 transitions, 562 flow [2025-01-09 21:22:45,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=562, PETRI_PLACES=111, PETRI_TRANSITIONS=123} [2025-01-09 21:22:45,967 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 28 predicate places. [2025-01-09 21:22:45,968 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 123 transitions, 562 flow [2025-01-09 21:22:45,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 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) [2025-01-09 21:22:45,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:45,968 INFO L206 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] [2025-01-09 21:22:45,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:22:45,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash -752278149, now seen corresponding path program 1 times [2025-01-09 21:22:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521267402] [2025-01-09 21:22:45,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:45,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:45,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:45,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:45,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:46,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:46,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521267402] [2025-01-09 21:22:46,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521267402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:46,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:46,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:46,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083850376] [2025-01-09 21:22:46,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:46,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:46,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:46,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:46,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:46,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:46,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 123 transitions, 562 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:46,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:46,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:47,404 INFO L124 PetriNetUnfolderBase]: 241/702 cut-off events. [2025-01-09 21:22:47,404 INFO L125 PetriNetUnfolderBase]: For 686/692 co-relation queries the response was YES. [2025-01-09 21:22:47,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2193 conditions, 702 events. 241/702 cut-off events. For 686/692 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3587 event pairs, 24 based on Foata normal form. 15/715 useless extension candidates. Maximal degree in co-relation 2136. Up to 144 conditions per place. [2025-01-09 21:22:47,408 INFO L140 encePairwiseOnDemand]: 65/81 looper letters, 105 selfloop transitions, 41 changer transitions 34/230 dead transitions. [2025-01-09 21:22:47,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 230 transitions, 1560 flow [2025-01-09 21:22:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:22:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:22:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 846 transitions. [2025-01-09 21:22:47,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6962962962962963 [2025-01-09 21:22:47,411 INFO L175 Difference]: Start difference. First operand has 111 places, 123 transitions, 562 flow. Second operand 15 states and 846 transitions. [2025-01-09 21:22:47,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 230 transitions, 1560 flow [2025-01-09 21:22:47,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 230 transitions, 1532 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-09 21:22:47,417 INFO L231 Difference]: Finished difference. Result has 127 places, 146 transitions, 908 flow [2025-01-09 21:22:47,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=908, PETRI_PLACES=127, PETRI_TRANSITIONS=146} [2025-01-09 21:22:47,418 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 44 predicate places. [2025-01-09 21:22:47,418 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 146 transitions, 908 flow [2025-01-09 21:22:47,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:47,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:47,419 INFO L206 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] [2025-01-09 21:22:47,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:22:47,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:47,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1100070851, now seen corresponding path program 2 times [2025-01-09 21:22:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:47,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292123378] [2025-01-09 21:22:47,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:47,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:47,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:47,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:47,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:47,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:47,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292123378] [2025-01-09 21:22:47,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292123378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:47,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:47,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:47,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012772583] [2025-01-09 21:22:47,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:47,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:47,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:47,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:47,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:48,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:48,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 146 transitions, 908 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:48,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:48,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:48,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:48,575 INFO L124 PetriNetUnfolderBase]: 206/641 cut-off events. [2025-01-09 21:22:48,575 INFO L125 PetriNetUnfolderBase]: For 1660/1672 co-relation queries the response was YES. [2025-01-09 21:22:48,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 641 events. 206/641 cut-off events. For 1660/1672 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3363 event pairs, 38 based on Foata normal form. 17/656 useless extension candidates. Maximal degree in co-relation 2429. Up to 290 conditions per place. [2025-01-09 21:22:48,603 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 75 selfloop transitions, 39 changer transitions 32/196 dead transitions. [2025-01-09 21:22:48,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 196 transitions, 1494 flow [2025-01-09 21:22:48,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:22:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:22:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 752 transitions. [2025-01-09 21:22:48,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7141500474833808 [2025-01-09 21:22:48,605 INFO L175 Difference]: Start difference. First operand has 127 places, 146 transitions, 908 flow. Second operand 13 states and 752 transitions. [2025-01-09 21:22:48,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 196 transitions, 1494 flow [2025-01-09 21:22:48,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 196 transitions, 1416 flow, removed 6 selfloop flow, removed 10 redundant places. [2025-01-09 21:22:48,614 INFO L231 Difference]: Finished difference. Result has 130 places, 146 transitions, 977 flow [2025-01-09 21:22:48,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=977, PETRI_PLACES=130, PETRI_TRANSITIONS=146} [2025-01-09 21:22:48,615 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 47 predicate places. [2025-01-09 21:22:48,615 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 146 transitions, 977 flow [2025-01-09 21:22:48,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:48,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:48,615 INFO L206 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] [2025-01-09 21:22:48,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:22:48,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:48,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash -765698169, now seen corresponding path program 3 times [2025-01-09 21:22:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:48,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173956898] [2025-01-09 21:22:48,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:22:48,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:48,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:48,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:48,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:22:48,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:48,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:48,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173956898] [2025-01-09 21:22:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173956898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:48,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:48,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140074898] [2025-01-09 21:22:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:48,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:48,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:48,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:49,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:49,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 146 transitions, 977 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:49,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:49,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:49,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:50,206 INFO L124 PetriNetUnfolderBase]: 289/838 cut-off events. [2025-01-09 21:22:50,206 INFO L125 PetriNetUnfolderBase]: For 3142/3158 co-relation queries the response was YES. [2025-01-09 21:22:50,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3563 conditions, 838 events. 289/838 cut-off events. For 3142/3158 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4758 event pairs, 32 based on Foata normal form. 20/855 useless extension candidates. Maximal degree in co-relation 3485. Up to 280 conditions per place. [2025-01-09 21:22:50,213 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 132 selfloop transitions, 62 changer transitions 15/259 dead transitions. [2025-01-09 21:22:50,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 259 transitions, 2389 flow [2025-01-09 21:22:50,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:22:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:22:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 847 transitions. [2025-01-09 21:22:50,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.697119341563786 [2025-01-09 21:22:50,216 INFO L175 Difference]: Start difference. First operand has 130 places, 146 transitions, 977 flow. Second operand 15 states and 847 transitions. [2025-01-09 21:22:50,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 259 transitions, 2389 flow [2025-01-09 21:22:50,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 259 transitions, 2271 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-01-09 21:22:50,230 INFO L231 Difference]: Finished difference. Result has 140 places, 184 transitions, 1566 flow [2025-01-09 21:22:50,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1566, PETRI_PLACES=140, PETRI_TRANSITIONS=184} [2025-01-09 21:22:50,233 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 57 predicate places. [2025-01-09 21:22:50,233 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 184 transitions, 1566 flow [2025-01-09 21:22:50,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:50,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:50,234 INFO L206 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] [2025-01-09 21:22:50,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:22:50,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1837082241, now seen corresponding path program 4 times [2025-01-09 21:22:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:50,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399880910] [2025-01-09 21:22:50,237 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:22:50,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:50,251 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-01-09 21:22:50,256 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 58 statements. [2025-01-09 21:22:50,259 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:22:50,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:50,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:50,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399880910] [2025-01-09 21:22:50,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399880910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:50,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:50,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288951678] [2025-01-09 21:22:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:50,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:50,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:50,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:50,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:51,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:51,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 184 transitions, 1566 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:51,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:51,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:51,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:51,695 INFO L124 PetriNetUnfolderBase]: 308/885 cut-off events. [2025-01-09 21:22:51,696 INFO L125 PetriNetUnfolderBase]: For 5242/5267 co-relation queries the response was YES. [2025-01-09 21:22:51,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4280 conditions, 885 events. 308/885 cut-off events. For 5242/5267 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5108 event pairs, 42 based on Foata normal form. 31/913 useless extension candidates. Maximal degree in co-relation 4195. Up to 429 conditions per place. [2025-01-09 21:22:51,701 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 111 selfloop transitions, 64 changer transitions 29/254 dead transitions. [2025-01-09 21:22:51,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 254 transitions, 2527 flow [2025-01-09 21:22:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:22:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:22:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 858 transitions. [2025-01-09 21:22:51,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7061728395061728 [2025-01-09 21:22:51,704 INFO L175 Difference]: Start difference. First operand has 140 places, 184 transitions, 1566 flow. Second operand 15 states and 858 transitions. [2025-01-09 21:22:51,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 254 transitions, 2527 flow [2025-01-09 21:22:51,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 254 transitions, 2423 flow, removed 31 selfloop flow, removed 8 redundant places. [2025-01-09 21:22:51,756 INFO L231 Difference]: Finished difference. Result has 152 places, 197 transitions, 1888 flow [2025-01-09 21:22:51,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1888, PETRI_PLACES=152, PETRI_TRANSITIONS=197} [2025-01-09 21:22:51,758 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 69 predicate places. [2025-01-09 21:22:51,758 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 197 transitions, 1888 flow [2025-01-09 21:22:51,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:51,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:51,758 INFO L206 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] [2025-01-09 21:22:51,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:22:51,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:51,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:51,759 INFO L85 PathProgramCache]: Analyzing trace with hash -137656509, now seen corresponding path program 1 times [2025-01-09 21:22:51,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:51,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670057597] [2025-01-09 21:22:51,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:51,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:51,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:51,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:51,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:51,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670057597] [2025-01-09 21:22:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670057597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:51,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:51,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710754050] [2025-01-09 21:22:51,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:51,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:51,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:51,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:51,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:52,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:52,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 197 transitions, 1888 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:52,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:52,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:52,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:52,821 INFO L124 PetriNetUnfolderBase]: 282/807 cut-off events. [2025-01-09 21:22:52,821 INFO L125 PetriNetUnfolderBase]: For 5541/5565 co-relation queries the response was YES. [2025-01-09 21:22:52,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4291 conditions, 807 events. 282/807 cut-off events. For 5541/5565 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4539 event pairs, 29 based on Foata normal form. 24/827 useless extension candidates. Maximal degree in co-relation 4201. Up to 179 conditions per place. [2025-01-09 21:22:52,827 INFO L140 encePairwiseOnDemand]: 66/81 looper letters, 132 selfloop transitions, 61 changer transitions 14/262 dead transitions. [2025-01-09 21:22:52,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 262 transitions, 2998 flow [2025-01-09 21:22:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:22:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:22:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 669 transitions. [2025-01-09 21:22:52,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6882716049382716 [2025-01-09 21:22:52,830 INFO L175 Difference]: Start difference. First operand has 152 places, 197 transitions, 1888 flow. Second operand 12 states and 669 transitions. [2025-01-09 21:22:52,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 262 transitions, 2998 flow [2025-01-09 21:22:52,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 262 transitions, 2880 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-01-09 21:22:52,851 INFO L231 Difference]: Finished difference. Result has 152 places, 191 transitions, 1884 flow [2025-01-09 21:22:52,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1884, PETRI_PLACES=152, PETRI_TRANSITIONS=191} [2025-01-09 21:22:52,853 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 69 predicate places. [2025-01-09 21:22:52,854 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 191 transitions, 1884 flow [2025-01-09 21:22:52,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:52,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:52,855 INFO L206 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] [2025-01-09 21:22:52,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:22:52,855 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:52,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash -181087335, now seen corresponding path program 5 times [2025-01-09 21:22:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832937082] [2025-01-09 21:22:52,857 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:22:52,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:52,865 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:52,869 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:52,869 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:52,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:53,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:53,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832937082] [2025-01-09 21:22:53,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832937082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:53,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:53,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669362024] [2025-01-09 21:22:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:53,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:53,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:53,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:53,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:53,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 191 transitions, 1884 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:53,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:53,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:53,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:54,038 INFO L124 PetriNetUnfolderBase]: 286/802 cut-off events. [2025-01-09 21:22:54,038 INFO L125 PetriNetUnfolderBase]: For 6379/6416 co-relation queries the response was YES. [2025-01-09 21:22:54,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4588 conditions, 802 events. 286/802 cut-off events. For 6379/6416 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4369 event pairs, 35 based on Foata normal form. 30/829 useless extension candidates. Maximal degree in co-relation 4498. Up to 426 conditions per place. [2025-01-09 21:22:54,044 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 93 selfloop transitions, 43 changer transitions 51/233 dead transitions. [2025-01-09 21:22:54,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 233 transitions, 2673 flow [2025-01-09 21:22:54,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:22:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:22:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 790 transitions. [2025-01-09 21:22:54,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6966490299823633 [2025-01-09 21:22:54,047 INFO L175 Difference]: Start difference. First operand has 152 places, 191 transitions, 1884 flow. Second operand 14 states and 790 transitions. [2025-01-09 21:22:54,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 233 transitions, 2673 flow [2025-01-09 21:22:54,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 233 transitions, 2497 flow, removed 4 selfloop flow, removed 12 redundant places. [2025-01-09 21:22:54,070 INFO L231 Difference]: Finished difference. Result has 156 places, 166 transitions, 1549 flow [2025-01-09 21:22:54,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1549, PETRI_PLACES=156, PETRI_TRANSITIONS=166} [2025-01-09 21:22:54,071 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 73 predicate places. [2025-01-09 21:22:54,071 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 166 transitions, 1549 flow [2025-01-09 21:22:54,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:54,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:54,072 INFO L206 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] [2025-01-09 21:22:54,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:22:54,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:54,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash -972754177, now seen corresponding path program 6 times [2025-01-09 21:22:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:54,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714755163] [2025-01-09 21:22:54,073 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:22:54,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:54,084 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:54,087 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:54,091 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:22:54,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:54,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:54,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714755163] [2025-01-09 21:22:54,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714755163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:54,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:54,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:54,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502764921] [2025-01-09 21:22:54,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:54,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:54,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:54,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:54,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:54,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 166 transitions, 1549 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:54,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:54,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:54,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:55,173 INFO L124 PetriNetUnfolderBase]: 217/694 cut-off events. [2025-01-09 21:22:55,174 INFO L125 PetriNetUnfolderBase]: For 7022/7049 co-relation queries the response was YES. [2025-01-09 21:22:55,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3771 conditions, 694 events. 217/694 cut-off events. For 7022/7049 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3772 event pairs, 34 based on Foata normal form. 19/710 useless extension candidates. Maximal degree in co-relation 3675. Up to 351 conditions per place. [2025-01-09 21:22:55,178 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 100 selfloop transitions, 44 changer transitions 20/210 dead transitions. [2025-01-09 21:22:55,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 210 transitions, 2366 flow [2025-01-09 21:22:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:22:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:22:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 785 transitions. [2025-01-09 21:22:55,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6922398589065256 [2025-01-09 21:22:55,180 INFO L175 Difference]: Start difference. First operand has 156 places, 166 transitions, 1549 flow. Second operand 14 states and 785 transitions. [2025-01-09 21:22:55,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 210 transitions, 2366 flow [2025-01-09 21:22:55,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 210 transitions, 2053 flow, removed 50 selfloop flow, removed 17 redundant places. [2025-01-09 21:22:55,200 INFO L231 Difference]: Finished difference. Result has 156 places, 173 transitions, 1579 flow [2025-01-09 21:22:55,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1579, PETRI_PLACES=156, PETRI_TRANSITIONS=173} [2025-01-09 21:22:55,201 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 73 predicate places. [2025-01-09 21:22:55,201 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 173 transitions, 1579 flow [2025-01-09 21:22:55,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:55,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:55,201 INFO L206 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] [2025-01-09 21:22:55,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:22:55,202 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:55,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1849243779, now seen corresponding path program 7 times [2025-01-09 21:22:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:55,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982250806] [2025-01-09 21:22:55,202 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:22:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:55,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:55,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:55,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:55,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:55,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:55,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982250806] [2025-01-09 21:22:55,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982250806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:55,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:55,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25613287] [2025-01-09 21:22:55,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:55,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:55,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:55,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:55,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:55,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:55,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 173 transitions, 1579 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:55,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:55,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:55,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:56,217 INFO L124 PetriNetUnfolderBase]: 249/765 cut-off events. [2025-01-09 21:22:56,218 INFO L125 PetriNetUnfolderBase]: For 6569/6609 co-relation queries the response was YES. [2025-01-09 21:22:56,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3969 conditions, 765 events. 249/765 cut-off events. For 6569/6609 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4247 event pairs, 42 based on Foata normal form. 30/792 useless extension candidates. Maximal degree in co-relation 3875. Up to 275 conditions per place. [2025-01-09 21:22:56,224 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 141 selfloop transitions, 61 changer transitions 16/264 dead transitions. [2025-01-09 21:22:56,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 264 transitions, 2958 flow [2025-01-09 21:22:56,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:22:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:22:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 841 transitions. [2025-01-09 21:22:56,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6921810699588478 [2025-01-09 21:22:56,226 INFO L175 Difference]: Start difference. First operand has 156 places, 173 transitions, 1579 flow. Second operand 15 states and 841 transitions. [2025-01-09 21:22:56,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 264 transitions, 2958 flow [2025-01-09 21:22:56,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 264 transitions, 2897 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-01-09 21:22:56,247 INFO L231 Difference]: Finished difference. Result has 168 places, 193 transitions, 2028 flow [2025-01-09 21:22:56,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1549, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2028, PETRI_PLACES=168, PETRI_TRANSITIONS=193} [2025-01-09 21:22:56,248 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 85 predicate places. [2025-01-09 21:22:56,248 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 193 transitions, 2028 flow [2025-01-09 21:22:56,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:56,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:56,248 INFO L206 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] [2025-01-09 21:22:56,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:22:56,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:56,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:56,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1388040677, now seen corresponding path program 8 times [2025-01-09 21:22:56,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:56,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831249932] [2025-01-09 21:22:56,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:56,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:56,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:56,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:56,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:56,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:56,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:56,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831249932] [2025-01-09 21:22:56,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831249932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:56,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:56,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:56,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780773434] [2025-01-09 21:22:56,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:56,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:56,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:56,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:56,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:56,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:56,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 193 transitions, 2028 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:56,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:56,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:56,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:57,231 INFO L124 PetriNetUnfolderBase]: 251/754 cut-off events. [2025-01-09 21:22:57,231 INFO L125 PetriNetUnfolderBase]: For 9120/9160 co-relation queries the response was YES. [2025-01-09 21:22:57,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4381 conditions, 754 events. 251/754 cut-off events. For 9120/9160 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4141 event pairs, 22 based on Foata normal form. 36/789 useless extension candidates. Maximal degree in co-relation 4281. Up to 329 conditions per place. [2025-01-09 21:22:57,237 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 142 selfloop transitions, 57 changer transitions 20/265 dead transitions. [2025-01-09 21:22:57,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 265 transitions, 3322 flow [2025-01-09 21:22:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:22:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:22:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 838 transitions. [2025-01-09 21:22:57,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6897119341563785 [2025-01-09 21:22:57,239 INFO L175 Difference]: Start difference. First operand has 168 places, 193 transitions, 2028 flow. Second operand 15 states and 838 transitions. [2025-01-09 21:22:57,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 265 transitions, 3322 flow [2025-01-09 21:22:57,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 265 transitions, 3119 flow, removed 65 selfloop flow, removed 10 redundant places. [2025-01-09 21:22:57,265 INFO L231 Difference]: Finished difference. Result has 177 places, 206 transitions, 2257 flow [2025-01-09 21:22:57,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2257, PETRI_PLACES=177, PETRI_TRANSITIONS=206} [2025-01-09 21:22:57,266 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 94 predicate places. [2025-01-09 21:22:57,266 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 206 transitions, 2257 flow [2025-01-09 21:22:57,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:57,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:57,266 INFO L206 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] [2025-01-09 21:22:57,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:22:57,266 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:57,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:57,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1674150571, now seen corresponding path program 9 times [2025-01-09 21:22:57,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:57,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112671494] [2025-01-09 21:22:57,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:22:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:57,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:57,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:57,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:22:57,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:57,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:57,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112671494] [2025-01-09 21:22:57,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112671494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:57,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:57,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:57,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055823133] [2025-01-09 21:22:57,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:57,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:57,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:57,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:57,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:57,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 206 transitions, 2257 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:57,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:57,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:57,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:58,153 INFO L124 PetriNetUnfolderBase]: 228/716 cut-off events. [2025-01-09 21:22:58,153 INFO L125 PetriNetUnfolderBase]: For 8916/8959 co-relation queries the response was YES. [2025-01-09 21:22:58,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4166 conditions, 716 events. 228/716 cut-off events. For 8916/8959 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3913 event pairs, 19 based on Foata normal form. 41/756 useless extension candidates. Maximal degree in co-relation 4062. Up to 360 conditions per place. [2025-01-09 21:22:58,158 INFO L140 encePairwiseOnDemand]: 61/81 looper letters, 123 selfloop transitions, 50 changer transitions 32/251 dead transitions. [2025-01-09 21:22:58,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 251 transitions, 3189 flow [2025-01-09 21:22:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:22:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:22:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 836 transitions. [2025-01-09 21:22:58,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6880658436213992 [2025-01-09 21:22:58,161 INFO L175 Difference]: Start difference. First operand has 177 places, 206 transitions, 2257 flow. Second operand 15 states and 836 transitions. [2025-01-09 21:22:58,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 251 transitions, 3189 flow [2025-01-09 21:22:58,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 251 transitions, 3024 flow, removed 55 selfloop flow, removed 11 redundant places. [2025-01-09 21:22:58,208 INFO L231 Difference]: Finished difference. Result has 184 places, 201 transitions, 2189 flow [2025-01-09 21:22:58,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2189, PETRI_PLACES=184, PETRI_TRANSITIONS=201} [2025-01-09 21:22:58,209 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 101 predicate places. [2025-01-09 21:22:58,209 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 201 transitions, 2189 flow [2025-01-09 21:22:58,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:58,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:58,209 INFO L206 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] [2025-01-09 21:22:58,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:22:58,210 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:58,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:58,210 INFO L85 PathProgramCache]: Analyzing trace with hash -246324857, now seen corresponding path program 10 times [2025-01-09 21:22:58,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:58,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712490741] [2025-01-09 21:22:58,210 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:22:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:58,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-01-09 21:22:58,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 58 statements. [2025-01-09 21:22:58,219 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:22:58,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:58,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712490741] [2025-01-09 21:22:58,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712490741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:58,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:58,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:58,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043561213] [2025-01-09 21:22:58,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:58,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:58,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:58,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:58,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:58,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:22:58,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 201 transitions, 2189 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:58,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:58,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:22:58,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:59,251 INFO L124 PetriNetUnfolderBase]: 250/796 cut-off events. [2025-01-09 21:22:59,252 INFO L125 PetriNetUnfolderBase]: For 12174/12212 co-relation queries the response was YES. [2025-01-09 21:22:59,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 796 events. 250/796 cut-off events. For 12174/12212 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4568 event pairs, 34 based on Foata normal form. 38/832 useless extension candidates. Maximal degree in co-relation 4523. Up to 352 conditions per place. [2025-01-09 21:22:59,259 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 148 selfloop transitions, 64 changer transitions 13/271 dead transitions. [2025-01-09 21:22:59,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 271 transitions, 3509 flow [2025-01-09 21:22:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:22:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:22:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 840 transitions. [2025-01-09 21:22:59,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.691358024691358 [2025-01-09 21:22:59,263 INFO L175 Difference]: Start difference. First operand has 184 places, 201 transitions, 2189 flow. Second operand 15 states and 840 transitions. [2025-01-09 21:22:59,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 271 transitions, 3509 flow [2025-01-09 21:22:59,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 271 transitions, 3395 flow, removed 27 selfloop flow, removed 11 redundant places. [2025-01-09 21:22:59,306 INFO L231 Difference]: Finished difference. Result has 189 places, 219 transitions, 2605 flow [2025-01-09 21:22:59,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2115, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2605, PETRI_PLACES=189, PETRI_TRANSITIONS=219} [2025-01-09 21:22:59,307 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 106 predicate places. [2025-01-09 21:22:59,307 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 219 transitions, 2605 flow [2025-01-09 21:22:59,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:22:59,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:59,308 INFO L206 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] [2025-01-09 21:22:59,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:22:59,309 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:22:59,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1976196377, now seen corresponding path program 11 times [2025-01-09 21:22:59,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:59,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521965885] [2025-01-09 21:22:59,310 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:22:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:59,321 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:59,323 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:59,327 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:59,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:59,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:59,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521965885] [2025-01-09 21:22:59,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521965885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:59,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:59,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:22:59,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962552541] [2025-01-09 21:22:59,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:59,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:59,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:59,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:59,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:00,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:23:00,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 219 transitions, 2605 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:23:00,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:00,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:23:00,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:00,360 INFO L124 PetriNetUnfolderBase]: 244/793 cut-off events. [2025-01-09 21:23:00,360 INFO L125 PetriNetUnfolderBase]: For 13138/13183 co-relation queries the response was YES. [2025-01-09 21:23:00,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4814 conditions, 793 events. 244/793 cut-off events. For 13138/13183 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4618 event pairs, 35 based on Foata normal form. 27/817 useless extension candidates. Maximal degree in co-relation 4704. Up to 444 conditions per place. [2025-01-09 21:23:00,365 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 134 selfloop transitions, 52 changer transitions 15/247 dead transitions. [2025-01-09 21:23:00,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 247 transitions, 3316 flow [2025-01-09 21:23:00,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:23:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:23:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 774 transitions. [2025-01-09 21:23:00,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2025-01-09 21:23:00,368 INFO L175 Difference]: Start difference. First operand has 189 places, 219 transitions, 2605 flow. Second operand 14 states and 774 transitions. [2025-01-09 21:23:00,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 247 transitions, 3316 flow [2025-01-09 21:23:00,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 247 transitions, 3150 flow, removed 64 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:00,401 INFO L231 Difference]: Finished difference. Result has 197 places, 221 transitions, 2631 flow [2025-01-09 21:23:00,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2631, PETRI_PLACES=197, PETRI_TRANSITIONS=221} [2025-01-09 21:23:00,402 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 114 predicate places. [2025-01-09 21:23:00,402 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 221 transitions, 2631 flow [2025-01-09 21:23:00,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:23:00,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:00,402 INFO L206 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] [2025-01-09 21:23:00,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:23:00,403 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:23:00,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1675784521, now seen corresponding path program 12 times [2025-01-09 21:23:00,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:00,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22650484] [2025-01-09 21:23:00,403 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:00,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:00,408 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:23:00,410 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:23:00,411 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:00,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:00,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:00,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22650484] [2025-01-09 21:23:00,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22650484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:00,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:00,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779180341] [2025-01-09 21:23:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:00,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:00,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:00,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:00,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:01,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:23:01,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 221 transitions, 2631 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:23:01,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:01,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:23:01,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:01,331 INFO L124 PetriNetUnfolderBase]: 235/780 cut-off events. [2025-01-09 21:23:01,332 INFO L125 PetriNetUnfolderBase]: For 12688/12722 co-relation queries the response was YES. [2025-01-09 21:23:01,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4637 conditions, 780 events. 235/780 cut-off events. For 12688/12722 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4518 event pairs, 34 based on Foata normal form. 31/808 useless extension candidates. Maximal degree in co-relation 4524. Up to 409 conditions per place. [2025-01-09 21:23:01,338 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 134 selfloop transitions, 55 changer transitions 29/264 dead transitions. [2025-01-09 21:23:01,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 264 transitions, 3582 flow [2025-01-09 21:23:01,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:23:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:23:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 835 transitions. [2025-01-09 21:23:01,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6872427983539094 [2025-01-09 21:23:01,344 INFO L175 Difference]: Start difference. First operand has 197 places, 221 transitions, 2631 flow. Second operand 15 states and 835 transitions. [2025-01-09 21:23:01,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 264 transitions, 3582 flow [2025-01-09 21:23:01,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 264 transitions, 3425 flow, removed 35 selfloop flow, removed 11 redundant places. [2025-01-09 21:23:01,377 INFO L231 Difference]: Finished difference. Result has 204 places, 218 transitions, 2608 flow [2025-01-09 21:23:01,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2498, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2608, PETRI_PLACES=204, PETRI_TRANSITIONS=218} [2025-01-09 21:23:01,379 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 121 predicate places. [2025-01-09 21:23:01,379 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 218 transitions, 2608 flow [2025-01-09 21:23:01,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:23:01,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:01,379 INFO L206 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] [2025-01-09 21:23:01,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:23:01,380 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:23:01,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash 621319205, now seen corresponding path program 13 times [2025-01-09 21:23:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:01,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579645912] [2025-01-09 21:23:01,383 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:01,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:23:01,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:23:01,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:01,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:01,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579645912] [2025-01-09 21:23:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579645912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:01,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191921901] [2025-01-09 21:23:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:01,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:01,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:01,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:02,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:23:02,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 218 transitions, 2608 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:23:02,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:02,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:23:02,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:02,356 INFO L124 PetriNetUnfolderBase]: 232/792 cut-off events. [2025-01-09 21:23:02,356 INFO L125 PetriNetUnfolderBase]: For 13627/13658 co-relation queries the response was YES. [2025-01-09 21:23:02,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4702 conditions, 792 events. 232/792 cut-off events. For 13627/13658 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4655 event pairs, 36 based on Foata normal form. 28/817 useless extension candidates. Maximal degree in co-relation 4588. Up to 417 conditions per place. [2025-01-09 21:23:02,362 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 138 selfloop transitions, 55 changer transitions 23/262 dead transitions. [2025-01-09 21:23:02,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 262 transitions, 3622 flow [2025-01-09 21:23:02,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:23:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:23:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 832 transitions. [2025-01-09 21:23:02,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6847736625514403 [2025-01-09 21:23:02,363 INFO L175 Difference]: Start difference. First operand has 204 places, 218 transitions, 2608 flow. Second operand 15 states and 832 transitions. [2025-01-09 21:23:02,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 262 transitions, 3622 flow [2025-01-09 21:23:02,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 262 transitions, 3531 flow, removed 25 selfloop flow, removed 10 redundant places. [2025-01-09 21:23:02,399 INFO L231 Difference]: Finished difference. Result has 210 places, 223 transitions, 2770 flow [2025-01-09 21:23:02,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2540, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2770, PETRI_PLACES=210, PETRI_TRANSITIONS=223} [2025-01-09 21:23:02,399 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 127 predicate places. [2025-01-09 21:23:02,399 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 223 transitions, 2770 flow [2025-01-09 21:23:02,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:23:02,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:02,400 INFO L206 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] [2025-01-09 21:23:02,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:23:02,400 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:23:02,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2081652893, now seen corresponding path program 14 times [2025-01-09 21:23:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349158047] [2025-01-09 21:23:02,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:02,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:23:02,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:23:02,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:02,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:02,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:02,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349158047] [2025-01-09 21:23:02,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349158047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:02,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:02,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:02,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528830445] [2025-01-09 21:23:02,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:02,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:02,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:02,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:02,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:03,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:23:03,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 223 transitions, 2770 flow. Second operand has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:23:03,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:03,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:23:03,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:03,469 INFO L124 PetriNetUnfolderBase]: 221/753 cut-off events. [2025-01-09 21:23:03,469 INFO L125 PetriNetUnfolderBase]: For 13880/13907 co-relation queries the response was YES. [2025-01-09 21:23:03,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4570 conditions, 753 events. 221/753 cut-off events. For 13880/13907 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4342 event pairs, 34 based on Foata normal form. 27/769 useless extension candidates. Maximal degree in co-relation 4453. Up to 363 conditions per place. [2025-01-09 21:23:03,474 INFO L140 encePairwiseOnDemand]: 62/81 looper letters, 138 selfloop transitions, 61 changer transitions 26/271 dead transitions. [2025-01-09 21:23:03,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 271 transitions, 3866 flow [2025-01-09 21:23:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:23:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 21:23:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 834 transitions. [2025-01-09 21:23:03,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6864197530864198 [2025-01-09 21:23:03,475 INFO L175 Difference]: Start difference. First operand has 210 places, 223 transitions, 2770 flow. Second operand 15 states and 834 transitions. [2025-01-09 21:23:03,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 271 transitions, 3866 flow [2025-01-09 21:23:03,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 271 transitions, 3734 flow, removed 46 selfloop flow, removed 12 redundant places. [2025-01-09 21:23:03,512 INFO L231 Difference]: Finished difference. Result has 217 places, 221 transitions, 2831 flow [2025-01-09 21:23:03,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2694, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2831, PETRI_PLACES=217, PETRI_TRANSITIONS=221} [2025-01-09 21:23:03,516 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 134 predicate places. [2025-01-09 21:23:03,516 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 221 transitions, 2831 flow [2025-01-09 21:23:03,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.53846153846154) internal successors, (670), 13 states have internal predecessors, (670), 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) [2025-01-09 21:23:03,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:03,517 INFO L206 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] [2025-01-09 21:23:03,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:23:03,517 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:23:03,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash -24746395, now seen corresponding path program 1 times [2025-01-09 21:23:03,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:03,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186970902] [2025-01-09 21:23:03,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:03,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:03,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:23:03,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:23:03,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:03,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:03,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:03,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186970902] [2025-01-09 21:23:03,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186970902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:03,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:03,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:03,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568344402] [2025-01-09 21:23:03,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:03,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:03,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:03,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:03,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:04,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:23:04,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 221 transitions, 2831 flow. Second operand has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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) [2025-01-09 21:23:04,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:04,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:23:04,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:04,443 INFO L124 PetriNetUnfolderBase]: 208/740 cut-off events. [2025-01-09 21:23:04,443 INFO L125 PetriNetUnfolderBase]: For 12410/12438 co-relation queries the response was YES. [2025-01-09 21:23:04,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4386 conditions, 740 events. 208/740 cut-off events. For 12410/12438 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4322 event pairs, 16 based on Foata normal form. 14/750 useless extension candidates. Maximal degree in co-relation 4266. Up to 223 conditions per place. [2025-01-09 21:23:04,448 INFO L140 encePairwiseOnDemand]: 67/81 looper letters, 123 selfloop transitions, 64 changer transitions 29/262 dead transitions. [2025-01-09 21:23:04,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 262 transitions, 3753 flow [2025-01-09 21:23:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:23:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:23:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 977 transitions. [2025-01-09 21:23:04,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6700960219478738 [2025-01-09 21:23:04,449 INFO L175 Difference]: Start difference. First operand has 217 places, 221 transitions, 2831 flow. Second operand 18 states and 977 transitions. [2025-01-09 21:23:04,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 262 transitions, 3753 flow [2025-01-09 21:23:04,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 262 transitions, 3581 flow, removed 73 selfloop flow, removed 10 redundant places. [2025-01-09 21:23:04,486 INFO L231 Difference]: Finished difference. Result has 218 places, 210 transitions, 2629 flow [2025-01-09 21:23:04,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2699, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2629, PETRI_PLACES=218, PETRI_TRANSITIONS=210} [2025-01-09 21:23:04,486 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 135 predicate places. [2025-01-09 21:23:04,486 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 210 transitions, 2629 flow [2025-01-09 21:23:04,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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) [2025-01-09 21:23:04,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:04,487 INFO L206 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] [2025-01-09 21:23:04,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:23:04,487 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:23:04,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1196613613, now seen corresponding path program 2 times [2025-01-09 21:23:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:04,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370998285] [2025-01-09 21:23:04,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:04,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-01-09 21:23:04,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 63 of 64 statements. [2025-01-09 21:23:04,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:04,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:04,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370998285] [2025-01-09 21:23:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370998285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:04,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:04,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791162803] [2025-01-09 21:23:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:04,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:04,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:04,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:05,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:23:05,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 210 transitions, 2629 flow. Second operand has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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) [2025-01-09 21:23:05,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:05,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:23:05,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:05,462 INFO L124 PetriNetUnfolderBase]: 195/720 cut-off events. [2025-01-09 21:23:05,463 INFO L125 PetriNetUnfolderBase]: For 12652/12680 co-relation queries the response was YES. [2025-01-09 21:23:05,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4163 conditions, 720 events. 195/720 cut-off events. For 12652/12680 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4212 event pairs, 16 based on Foata normal form. 14/730 useless extension candidates. Maximal degree in co-relation 4041. Up to 223 conditions per place. [2025-01-09 21:23:05,467 INFO L140 encePairwiseOnDemand]: 67/81 looper letters, 113 selfloop transitions, 56 changer transitions 37/252 dead transitions. [2025-01-09 21:23:05,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 252 transitions, 3605 flow [2025-01-09 21:23:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 21:23:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-09 21:23:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1077 transitions. [2025-01-09 21:23:05,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6648148148148149 [2025-01-09 21:23:05,469 INFO L175 Difference]: Start difference. First operand has 218 places, 210 transitions, 2629 flow. Second operand 20 states and 1077 transitions. [2025-01-09 21:23:05,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 252 transitions, 3605 flow [2025-01-09 21:23:05,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 252 transitions, 3396 flow, removed 35 selfloop flow, removed 17 redundant places. [2025-01-09 21:23:05,504 INFO L231 Difference]: Finished difference. Result has 222 places, 198 transitions, 2401 flow [2025-01-09 21:23:05,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2482, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2401, PETRI_PLACES=222, PETRI_TRANSITIONS=198} [2025-01-09 21:23:05,504 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 139 predicate places. [2025-01-09 21:23:05,504 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 198 transitions, 2401 flow [2025-01-09 21:23:05,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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) [2025-01-09 21:23:05,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:05,505 INFO L206 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] [2025-01-09 21:23:05,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:23:05,505 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-01-09 21:23:05,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:05,505 INFO L85 PathProgramCache]: Analyzing trace with hash 681139153, now seen corresponding path program 3 times [2025-01-09 21:23:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:05,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434233199] [2025-01-09 21:23:05,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:05,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:05,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 2 equivalence classes. [2025-01-09 21:23:05,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 63 of 64 statements. [2025-01-09 21:23:05,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:05,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:05,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:05,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434233199] [2025-01-09 21:23:05,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434233199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:05,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:05,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461431828] [2025-01-09 21:23:05,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:05,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:05,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:05,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:06,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-01-09 21:23:06,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 198 transitions, 2401 flow. Second operand has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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) [2025-01-09 21:23:06,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:06,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-01-09 21:23:06,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:06,442 INFO L124 PetriNetUnfolderBase]: 155/593 cut-off events. [2025-01-09 21:23:06,442 INFO L125 PetriNetUnfolderBase]: For 10523/10551 co-relation queries the response was YES. [2025-01-09 21:23:06,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 593 events. 155/593 cut-off events. For 10523/10551 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3252 event pairs, 2 based on Foata normal form. 45/638 useless extension candidates. Maximal degree in co-relation 3291. Up to 159 conditions per place. [2025-01-09 21:23:06,445 INFO L140 encePairwiseOnDemand]: 67/81 looper letters, 0 selfloop transitions, 0 changer transitions 260/260 dead transitions. [2025-01-09 21:23:06,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 260 transitions, 3481 flow [2025-01-09 21:23:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 21:23:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-09 21:23:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1282 transitions. [2025-01-09 21:23:06,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6594650205761317 [2025-01-09 21:23:06,446 INFO L175 Difference]: Start difference. First operand has 222 places, 198 transitions, 2401 flow. Second operand 24 states and 1282 transitions. [2025-01-09 21:23:06,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 260 transitions, 3481 flow [2025-01-09 21:23:06,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 260 transitions, 3214 flow, removed 48 selfloop flow, removed 22 redundant places. [2025-01-09 21:23:06,474 INFO L231 Difference]: Finished difference. Result has 208 places, 0 transitions, 0 flow [2025-01-09 21:23:06,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=0, PETRI_PLACES=208, PETRI_TRANSITIONS=0} [2025-01-09 21:23:06,475 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 125 predicate places. [2025-01-09 21:23:06,475 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 0 transitions, 0 flow [2025-01-09 21:23:06,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.92307692307692) internal successors, (675), 13 states have internal predecessors, (675), 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) [2025-01-09 21:23:06,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 4 remaining) [2025-01-09 21:23:06,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-09 21:23:06,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2025-01-09 21:23:06,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2025-01-09 21:23:06,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:23:06,478 INFO L422 BasicCegarLoop]: Path program histogram: [14, 3, 1, 1, 1, 1] [2025-01-09 21:23:06,481 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:23:06,481 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:23:06,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:23:06 BasicIcfg [2025-01-09 21:23:06,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:23:06,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:23:06,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:23:06,485 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:23:06,485 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:43" (3/4) ... [2025-01-09 21:23:06,486 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:23:06,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-09 21:23:06,490 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:23:06,490 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 21:23:06,490 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 21:23:06,533 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:23:06,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:23:06,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:23:06,534 INFO L158 Benchmark]: Toolchain (without parser) took 23399.75ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 105.5MB in the beginning and 231.6MB in the end (delta: -126.1MB). Peak memory consumption was 231.5MB. Max. memory is 16.1GB. [2025-01-09 21:23:06,535 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:23:06,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.28ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 77.8MB in the end (delta: 27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:23:06,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.38ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 75.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:23:06,535 INFO L158 Benchmark]: Boogie Preprocessor took 15.08ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 75.1MB in the end (delta: 711.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:23:06,535 INFO L158 Benchmark]: RCFGBuilder took 335.94ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 59.7MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:23:06,535 INFO L158 Benchmark]: TraceAbstraction took 22609.48ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 59.0MB in the beginning and 240.0MB in the end (delta: -181.0MB). Peak memory consumption was 172.7MB. Max. memory is 16.1GB. [2025-01-09 21:23:06,536 INFO L158 Benchmark]: Witness Printer took 49.36ms. Allocated memory is still 503.3MB. Free memory was 240.0MB in the beginning and 231.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:23:06,537 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.28ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 77.8MB in the end (delta: 27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.38ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 75.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.08ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 75.1MB in the end (delta: 711.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 335.94ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 59.7MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22609.48ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 59.0MB in the beginning and 240.0MB in the end (delta: -181.0MB). Peak memory consumption was 172.7MB. Max. memory is 16.1GB. * Witness Printer took 49.36ms. Allocated memory is still 503.3MB. Free memory was 240.0MB in the beginning and 231.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 999]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 994]: 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 3 procedures, 99 locations, 4 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: 22.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7611 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6557 mSDsluCounter, 13445 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12803 mSDsCounter, 618 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24361 IncrementalHoareTripleChecker+Invalid, 24979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 618 mSolverCounterUnsat, 642 mSDtfsCounter, 24361 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2831occurred in iteration=18, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1220 NumberOfCodeBlocks, 1200 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1199 ConstructedInterpolants, 0 QuantifiedInterpolants, 7979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:23:06,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE