./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_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/09-regions_06-ptra_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 c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:23:44,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:23:44,849 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:23:44,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:23:44,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:23:44,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:23:44,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:23:44,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:23:44,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:23:44,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:23:44,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:23:44,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:23:44,879 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:23:44,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:23:44,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:23:44,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:23:44,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:23:44,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:23:44,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:23:44,881 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 -> c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 [2025-01-09 21:23:45,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:23:45,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:23:45,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:23:45,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:23:45,108 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:23:45,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2025-01-09 21:23:46,235 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c30e9d2fa/085476a2f6004589bf24963f654f669b/FLAG67ba04cbe [2025-01-09 21:23:46,543 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:23:46,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2025-01-09 21:23:46,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c30e9d2fa/085476a2f6004589bf24963f654f669b/FLAG67ba04cbe [2025-01-09 21:23:46,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c30e9d2fa/085476a2f6004589bf24963f654f669b [2025-01-09 21:23:46,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:23:46,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:23:46,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:23:46,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:23:46,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:23:46,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:23:46" (1/1) ... [2025-01-09 21:23:46,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d42611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:46, skipping insertion in model container [2025-01-09 21:23:46,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:23:46" (1/1) ... [2025-01-09 21:23:46,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:23:47,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:23:47,040 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:23:47,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:23:47,117 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:23:47,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47 WrapperNode [2025-01-09 21:23:47,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:23:47,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:23:47,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:23:47,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:23:47,125 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:23:47" (1/1) ... [2025-01-09 21:23:47,138 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:23:47" (1/1) ... [2025-01-09 21:23:47,158 INFO L138 Inliner]: procedures = 189, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 258 [2025-01-09 21:23:47,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:23:47,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:23:47,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:23:47,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:23:47,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (1/1) ... [2025-01-09 21:23:47,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (1/1) ... [2025-01-09 21:23:47,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (1/1) ... [2025-01-09 21:23:47,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (1/1) ... [2025-01-09 21:23:47,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (1/1) ... [2025-01-09 21:23:47,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (1/1) ... [2025-01-09 21:23:47,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (1/1) ... [2025-01-09 21:23:47,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (1/1) ... [2025-01-09 21:23:47,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (1/1) ... [2025-01-09 21:23:47,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:23:47,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:23:47,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:23:47,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:23:47,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (1/1) ... [2025-01-09 21:23:47,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:23:47,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:47,217 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:23:47,220 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:23:47,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:23:47,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:23:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:23:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:23:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:23:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:23:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:23:47,238 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:23:47,239 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:23:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:23:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:23:47,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:23:47,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:23:47,240 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:23:47,347 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:23:47,348 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:23:47,662 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:23:47,662 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:23:47,679 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:23:47,680 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:23:47,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:23:47 BoogieIcfgContainer [2025-01-09 21:23:47,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:23:47,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:23:47,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:23:47,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:23:47,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:23:46" (1/3) ... [2025-01-09 21:23:47,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c325cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:23:47, skipping insertion in model container [2025-01-09 21:23:47,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:47" (2/3) ... [2025-01-09 21:23:47,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c325cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:23:47, skipping insertion in model container [2025-01-09 21:23:47,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:23:47" (3/3) ... [2025-01-09 21:23:47,689 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_06-ptra_nr.i [2025-01-09 21:23:47,699 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:23:47,701 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_06-ptra_nr.i that has 2 procedures, 294 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-01-09 21:23:47,701 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:23:47,778 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:23:47,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 293 transitions, 590 flow [2025-01-09 21:23:47,914 INFO L124 PetriNetUnfolderBase]: 0/292 cut-off events. [2025-01-09 21:23:47,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:47,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 292 events. 0/292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 94 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-09 21:23:47,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 293 transitions, 590 flow [2025-01-09 21:23:47,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 292 transitions, 587 flow [2025-01-09 21:23:47,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:23:47,941 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;@550bdcda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:23:47,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-09 21:23:47,959 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:23:47,962 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2025-01-09 21:23:47,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:47,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:47,963 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, 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:47,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:47,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1012708, now seen corresponding path program 1 times [2025-01-09 21:23:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:47,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602415003] [2025-01-09 21:23:47,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:47,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:48,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 21:23:48,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 21:23:48,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:48,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:48,739 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:48,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:48,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602415003] [2025-01-09 21:23:48,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602415003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:48,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:48,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:48,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201198524] [2025-01-09 21:23:48,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:48,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:48,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:48,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:49,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2025-01-09 21:23:49,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 292 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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:49,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:49,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2025-01-09 21:23:49,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:49,417 INFO L124 PetriNetUnfolderBase]: 220/1135 cut-off events. [2025-01-09 21:23:49,417 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:49,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 1135 events. 220/1135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5595 event pairs, 220 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1424. Up to 493 conditions per place. [2025-01-09 21:23:49,428 INFO L140 encePairwiseOnDemand]: 275/293 looper letters, 52 selfloop transitions, 15 changer transitions 0/289 dead transitions. [2025-01-09 21:23:49,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 289 transitions, 715 flow [2025-01-09 21:23:49,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-01-09 21:23:49,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800910125142207 [2025-01-09 21:23:49,447 INFO L175 Difference]: Start difference. First operand has 296 places, 292 transitions, 587 flow. Second operand 6 states and 1408 transitions. [2025-01-09 21:23:49,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 289 transitions, 715 flow [2025-01-09 21:23:49,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 289 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:49,456 INFO L231 Difference]: Finished difference. Result has 297 places, 289 transitions, 610 flow [2025-01-09 21:23:49,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=297, PETRI_TRANSITIONS=289} [2025-01-09 21:23:49,460 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 1 predicate places. [2025-01-09 21:23:49,462 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 289 transitions, 610 flow [2025-01-09 21:23:49,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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:49,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:49,463 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, 1, 1, 1, 1, 1, 1, 1, 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:49,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:23:49,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:49,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:49,465 INFO L85 PathProgramCache]: Analyzing trace with hash -778666570, now seen corresponding path program 1 times [2025-01-09 21:23:49,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:49,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206495495] [2025-01-09 21:23:49,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:49,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:49,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:23:49,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:23:49,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:49,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:49,827 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:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206495495] [2025-01-09 21:23:49,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206495495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:49,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:49,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117770294] [2025-01-09 21:23:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:49,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:49,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:49,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:50,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2025-01-09 21:23:50,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 289 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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:50,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:50,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2025-01-09 21:23:50,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:50,414 INFO L124 PetriNetUnfolderBase]: 220/1132 cut-off events. [2025-01-09 21:23:50,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:50,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1132 events. 220/1132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5632 event pairs, 220 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1449. Up to 493 conditions per place. [2025-01-09 21:23:50,422 INFO L140 encePairwiseOnDemand]: 275/293 looper letters, 52 selfloop transitions, 15 changer transitions 0/286 dead transitions. [2025-01-09 21:23:50,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 286 transitions, 738 flow [2025-01-09 21:23:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-01-09 21:23:50,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800910125142207 [2025-01-09 21:23:50,429 INFO L175 Difference]: Start difference. First operand has 297 places, 289 transitions, 610 flow. Second operand 6 states and 1408 transitions. [2025-01-09 21:23:50,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 286 transitions, 738 flow [2025-01-09 21:23:50,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 286 transitions, 708 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:50,436 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 604 flow [2025-01-09 21:23:50,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2025-01-09 21:23:50,437 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -2 predicate places. [2025-01-09 21:23:50,438 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 604 flow [2025-01-09 21:23:50,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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:50,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:50,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:23:50,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:50,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash -672749740, now seen corresponding path program 1 times [2025-01-09 21:23:50,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:50,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132728831] [2025-01-09 21:23:50,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:50,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:23:50,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:23:50,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:50,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:50,509 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:50,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132728831] [2025-01-09 21:23:50,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132728831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:50,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:50,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:50,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084591479] [2025-01-09 21:23:50,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:50,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:50,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:50,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:50,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 293 [2025-01-09 21:23:50,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:50,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:50,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 293 [2025-01-09 21:23:50,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:50,584 INFO L124 PetriNetUnfolderBase]: 16/421 cut-off events. [2025-01-09 21:23:50,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:50,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 421 events. 16/421 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 779 event pairs, 16 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 291. Up to 47 conditions per place. [2025-01-09 21:23:50,586 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 14 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-01-09 21:23:50,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 285 transitions, 634 flow [2025-01-09 21:23:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2025-01-09 21:23:50,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9613196814562003 [2025-01-09 21:23:50,588 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 604 flow. Second operand 3 states and 845 transitions. [2025-01-09 21:23:50,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 285 transitions, 634 flow [2025-01-09 21:23:50,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 285 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:50,592 INFO L231 Difference]: Finished difference. Result has 290 places, 285 transitions, 576 flow [2025-01-09 21:23:50,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=290, PETRI_TRANSITIONS=285} [2025-01-09 21:23:50,593 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -6 predicate places. [2025-01-09 21:23:50,593 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 285 transitions, 576 flow [2025-01-09 21:23:50,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:50,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:50,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:23:50,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:50,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1411836732, now seen corresponding path program 1 times [2025-01-09 21:23:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:50,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734656603] [2025-01-09 21:23:50,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:50,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:23:50,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:23:50,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:50,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:50,643 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:50,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:50,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734656603] [2025-01-09 21:23:50,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734656603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:50,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:50,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771146322] [2025-01-09 21:23:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:50,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:50,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:50,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:50,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:50,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 293 [2025-01-09 21:23:50,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 285 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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:50,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:50,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 293 [2025-01-09 21:23:50,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:50,712 INFO L124 PetriNetUnfolderBase]: 24/498 cut-off events. [2025-01-09 21:23:50,713 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:50,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 498 events. 24/498 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs, 24 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 458. Up to 63 conditions per place. [2025-01-09 21:23:50,715 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 15 selfloop transitions, 1 changer transitions 0/280 dead transitions. [2025-01-09 21:23:50,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 280 transitions, 598 flow [2025-01-09 21:23:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2025-01-09 21:23:50,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522184300341296 [2025-01-09 21:23:50,717 INFO L175 Difference]: Start difference. First operand has 290 places, 285 transitions, 576 flow. Second operand 3 states and 837 transitions. [2025-01-09 21:23:50,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 280 transitions, 598 flow [2025-01-09 21:23:50,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 280 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:23:50,722 INFO L231 Difference]: Finished difference. Result has 285 places, 280 transitions, 564 flow [2025-01-09 21:23:50,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=285, PETRI_TRANSITIONS=280} [2025-01-09 21:23:50,723 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -11 predicate places. [2025-01-09 21:23:50,724 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 280 transitions, 564 flow [2025-01-09 21:23:50,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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:50,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:50,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:23:50,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:50,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash -314182069, now seen corresponding path program 1 times [2025-01-09 21:23:50,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:50,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96633517] [2025-01-09 21:23:50,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:50,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:50,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:23:50,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:23:50,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:50,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:51,132 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:51,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96633517] [2025-01-09 21:23:51,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96633517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:51,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:51,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306886851] [2025-01-09 21:23:51,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:51,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:51,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:51,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:51,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 293 [2025-01-09 21:23:51,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 280 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 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:51,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:51,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 293 [2025-01-09 21:23:51,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:51,524 INFO L124 PetriNetUnfolderBase]: 288/1275 cut-off events. [2025-01-09 21:23:51,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:51,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 1275 events. 288/1275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6585 event pairs, 288 based on Foata normal form. 0/1214 useless extension candidates. Maximal degree in co-relation 1807. Up to 643 conditions per place. [2025-01-09 21:23:51,530 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 66 selfloop transitions, 5 changer transitions 0/279 dead transitions. [2025-01-09 21:23:51,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 279 transitions, 704 flow [2025-01-09 21:23:51,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2025-01-09 21:23:51,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7952218430034129 [2025-01-09 21:23:51,535 INFO L175 Difference]: Start difference. First operand has 285 places, 280 transitions, 564 flow. Second operand 6 states and 1398 transitions. [2025-01-09 21:23:51,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 279 transitions, 704 flow [2025-01-09 21:23:51,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 279 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:51,539 INFO L231 Difference]: Finished difference. Result has 288 places, 279 transitions, 571 flow [2025-01-09 21:23:51,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=288, PETRI_TRANSITIONS=279} [2025-01-09 21:23:51,540 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -8 predicate places. [2025-01-09 21:23:51,541 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 279 transitions, 571 flow [2025-01-09 21:23:51,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 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:51,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:51,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:23:51,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:51,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash 604617369, now seen corresponding path program 1 times [2025-01-09 21:23:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:51,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362498489] [2025-01-09 21:23:51,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:51,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:51,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:23:51,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:23:51,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:51,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:51,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:23:51,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362498489] [2025-01-09 21:23:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362498489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267317593] [2025-01-09 21:23:51,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:51,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:51,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:51,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:51,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 293 [2025-01-09 21:23:51,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 279 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:51,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:51,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 293 [2025-01-09 21:23:51,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:51,644 INFO L124 PetriNetUnfolderBase]: 6/342 cut-off events. [2025-01-09 21:23:51,644 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:51,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 342 events. 6/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 391 event pairs, 6 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 266. Up to 23 conditions per place. [2025-01-09 21:23:51,645 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 10 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-01-09 21:23:51,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 278 transitions, 593 flow [2025-01-09 21:23:51,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-01-09 21:23:51,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-01-09 21:23:51,647 INFO L175 Difference]: Start difference. First operand has 288 places, 279 transitions, 571 flow. Second operand 3 states and 853 transitions. [2025-01-09 21:23:51,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 278 transitions, 593 flow [2025-01-09 21:23:51,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 278 transitions, 583 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:51,650 INFO L231 Difference]: Finished difference. Result has 284 places, 278 transitions, 563 flow [2025-01-09 21:23:51,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=284, PETRI_TRANSITIONS=278} [2025-01-09 21:23:51,651 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -12 predicate places. [2025-01-09 21:23:51,651 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 278 transitions, 563 flow [2025-01-09 21:23:51,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:51,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:51,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:23:51,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:51,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1042183485, now seen corresponding path program 1 times [2025-01-09 21:23:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:51,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463086297] [2025-01-09 21:23:51,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:51,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 21:23:51,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 21:23:51,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:51,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:51,699 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:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463086297] [2025-01-09 21:23:51,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463086297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:51,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:51,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750209430] [2025-01-09 21:23:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:51,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:51,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:51,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:51,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 293 [2025-01-09 21:23:51,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 278 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:51,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:51,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 293 [2025-01-09 21:23:51,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:51,733 INFO L124 PetriNetUnfolderBase]: 4/339 cut-off events. [2025-01-09 21:23:51,733 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:51,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 339 events. 4/339 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 251 event pairs, 4 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 253. Up to 15 conditions per place. [2025-01-09 21:23:51,734 INFO L140 encePairwiseOnDemand]: 291/293 looper letters, 7 selfloop transitions, 1 changer transitions 0/277 dead transitions. [2025-01-09 21:23:51,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 277 transitions, 577 flow [2025-01-09 21:23:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-01-09 21:23:51,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9795221843003413 [2025-01-09 21:23:51,736 INFO L175 Difference]: Start difference. First operand has 284 places, 278 transitions, 563 flow. Second operand 3 states and 861 transitions. [2025-01-09 21:23:51,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 277 transitions, 577 flow [2025-01-09 21:23:51,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 277 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:23:51,739 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 559 flow [2025-01-09 21:23:51,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2025-01-09 21:23:51,739 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -13 predicate places. [2025-01-09 21:23:51,740 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 559 flow [2025-01-09 21:23:51,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:23:51,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:51,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:23:51,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:51,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash 987461173, now seen corresponding path program 1 times [2025-01-09 21:23:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:51,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552397077] [2025-01-09 21:23:51,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:51,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 21:23:51,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:23:51,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:51,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:52,161 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:52,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:52,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552397077] [2025-01-09 21:23:52,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552397077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:52,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:52,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:52,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117680801] [2025-01-09 21:23:52,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:52,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:52,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:52,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:52,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:52,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 293 [2025-01-09 21:23:52,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 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:52,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:52,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 293 [2025-01-09 21:23:52,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:52,712 INFO L124 PetriNetUnfolderBase]: 316/1589 cut-off events. [2025-01-09 21:23:52,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:52,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 1589 events. 316/1589 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9557 event pairs, 43 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 2209. Up to 388 conditions per place. [2025-01-09 21:23:52,720 INFO L140 encePairwiseOnDemand]: 265/293 looper letters, 107 selfloop transitions, 70 changer transitions 0/389 dead transitions. [2025-01-09 21:23:52,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 389 transitions, 1137 flow [2025-01-09 21:23:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1547 transitions. [2025-01-09 21:23:52,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8799772468714449 [2025-01-09 21:23:52,723 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 559 flow. Second operand 6 states and 1547 transitions. [2025-01-09 21:23:52,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 389 transitions, 1137 flow [2025-01-09 21:23:52,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 389 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:52,733 INFO L231 Difference]: Finished difference. Result has 291 places, 347 transitions, 1036 flow [2025-01-09 21:23:52,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1036, PETRI_PLACES=291, PETRI_TRANSITIONS=347} [2025-01-09 21:23:52,734 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -5 predicate places. [2025-01-09 21:23:52,734 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 347 transitions, 1036 flow [2025-01-09 21:23:52,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 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:52,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:52,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:23:52,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:52,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:52,737 INFO L85 PathProgramCache]: Analyzing trace with hash 204481195, now seen corresponding path program 1 times [2025-01-09 21:23:52,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:52,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409144896] [2025-01-09 21:23:52,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:52,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 21:23:52,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 21:23:52,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:52,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:53,137 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:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409144896] [2025-01-09 21:23:53,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409144896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:53,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:53,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366050320] [2025-01-09 21:23:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:53,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:53,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:53,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:53,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:53,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 293 [2025-01-09 21:23:53,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 347 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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:53,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:53,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 293 [2025-01-09 21:23:53,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:53,735 INFO L124 PetriNetUnfolderBase]: 588/2368 cut-off events. [2025-01-09 21:23:53,736 INFO L125 PetriNetUnfolderBase]: For 603/609 co-relation queries the response was YES. [2025-01-09 21:23:53,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 2368 events. 588/2368 cut-off events. For 603/609 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 15454 event pairs, 222 based on Foata normal form. 0/2256 useless extension candidates. Maximal degree in co-relation 4644. Up to 1090 conditions per place. [2025-01-09 21:23:53,747 INFO L140 encePairwiseOnDemand]: 278/293 looper letters, 114 selfloop transitions, 48 changer transitions 0/398 dead transitions. [2025-01-09 21:23:53,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 398 transitions, 1532 flow [2025-01-09 21:23:53,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2025-01-09 21:23:53,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441410693970421 [2025-01-09 21:23:53,750 INFO L175 Difference]: Start difference. First operand has 291 places, 347 transitions, 1036 flow. Second operand 6 states and 1484 transitions. [2025-01-09 21:23:53,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 398 transitions, 1532 flow [2025-01-09 21:23:53,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 398 transitions, 1532 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:53,761 INFO L231 Difference]: Finished difference. Result has 301 places, 390 transitions, 1424 flow [2025-01-09 21:23:53,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1424, PETRI_PLACES=301, PETRI_TRANSITIONS=390} [2025-01-09 21:23:53,763 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 5 predicate places. [2025-01-09 21:23:53,763 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 390 transitions, 1424 flow [2025-01-09 21:23:53,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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:53,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:53,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:23:53,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:53,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1899772781, now seen corresponding path program 1 times [2025-01-09 21:23:53,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:53,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855439950] [2025-01-09 21:23:53,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:53,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 21:23:53,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 21:23:53,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:53,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:54,123 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:54,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:54,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855439950] [2025-01-09 21:23:54,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855439950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:54,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:54,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:54,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134494247] [2025-01-09 21:23:54,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:54,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:54,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:54,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:54,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:54,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 293 [2025-01-09 21:23:54,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 390 transitions, 1424 flow. Second operand has 6 states, 6 states have (on average 241.16666666666666) internal successors, (1447), 6 states have internal predecessors, (1447), 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:54,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:54,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 293 [2025-01-09 21:23:54,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:54,747 INFO L124 PetriNetUnfolderBase]: 693/2817 cut-off events. [2025-01-09 21:23:54,747 INFO L125 PetriNetUnfolderBase]: For 1554/1606 co-relation queries the response was YES. [2025-01-09 21:23:54,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 2817 events. 693/2817 cut-off events. For 1554/1606 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19778 event pairs, 57 based on Foata normal form. 0/2726 useless extension candidates. Maximal degree in co-relation 6282. Up to 932 conditions per place. [2025-01-09 21:23:54,762 INFO L140 encePairwiseOnDemand]: 270/293 looper letters, 135 selfloop transitions, 136 changer transitions 4/530 dead transitions. [2025-01-09 21:23:54,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 530 transitions, 2730 flow [2025-01-09 21:23:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1547 transitions. [2025-01-09 21:23:54,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8799772468714449 [2025-01-09 21:23:54,765 INFO L175 Difference]: Start difference. First operand has 301 places, 390 transitions, 1424 flow. Second operand 6 states and 1547 transitions. [2025-01-09 21:23:54,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 530 transitions, 2730 flow [2025-01-09 21:23:54,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 530 transitions, 2712 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:54,778 INFO L231 Difference]: Finished difference. Result has 311 places, 521 transitions, 2772 flow [2025-01-09 21:23:54,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2772, PETRI_PLACES=311, PETRI_TRANSITIONS=521} [2025-01-09 21:23:54,779 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 15 predicate places. [2025-01-09 21:23:54,780 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 521 transitions, 2772 flow [2025-01-09 21:23:54,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 241.16666666666666) internal successors, (1447), 6 states have internal predecessors, (1447), 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:54,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:54,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:23:54,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:54,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:54,782 INFO L85 PathProgramCache]: Analyzing trace with hash -632563920, now seen corresponding path program 1 times [2025-01-09 21:23:54,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:54,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937555477] [2025-01-09 21:23:54,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:54,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:54,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 21:23:54,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 21:23:54,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:54,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:55,114 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:55,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:55,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937555477] [2025-01-09 21:23:55,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937555477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:55,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:55,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:55,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161018796] [2025-01-09 21:23:55,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:55,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:55,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:55,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:55,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:55,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 293 [2025-01-09 21:23:55,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 521 transitions, 2772 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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:55,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:55,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 293 [2025-01-09 21:23:55,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:55,768 INFO L124 PetriNetUnfolderBase]: 968/3493 cut-off events. [2025-01-09 21:23:55,768 INFO L125 PetriNetUnfolderBase]: For 3831/3903 co-relation queries the response was YES. [2025-01-09 21:23:55,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9734 conditions, 3493 events. 968/3493 cut-off events. For 3831/3903 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 24892 event pairs, 207 based on Foata normal form. 0/3406 useless extension candidates. Maximal degree in co-relation 9602. Up to 1565 conditions per place. [2025-01-09 21:23:55,791 INFO L140 encePairwiseOnDemand]: 278/293 looper letters, 239 selfloop transitions, 62 changer transitions 0/578 dead transitions. [2025-01-09 21:23:55,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 578 transitions, 3716 flow [2025-01-09 21:23:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2025-01-09 21:23:55,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441410693970421 [2025-01-09 21:23:55,795 INFO L175 Difference]: Start difference. First operand has 311 places, 521 transitions, 2772 flow. Second operand 6 states and 1484 transitions. [2025-01-09 21:23:55,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 578 transitions, 3716 flow [2025-01-09 21:23:55,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 578 transitions, 3680 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:55,817 INFO L231 Difference]: Finished difference. Result has 321 places, 570 transitions, 3362 flow [2025-01-09 21:23:55,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=2736, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3362, PETRI_PLACES=321, PETRI_TRANSITIONS=570} [2025-01-09 21:23:55,818 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 25 predicate places. [2025-01-09 21:23:55,818 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 570 transitions, 3362 flow [2025-01-09 21:23:55,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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:55,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:55,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:23:55,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:55,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:55,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1283758768, now seen corresponding path program 1 times [2025-01-09 21:23:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616175341] [2025-01-09 21:23:55,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:55,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 21:23:55,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 21:23:55,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:55,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:56,493 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:56,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:56,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616175341] [2025-01-09 21:23:56,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616175341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:56,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:56,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62832316] [2025-01-09 21:23:56,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:56,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:56,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:56,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:56,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:57,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-01-09 21:23:57,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 570 transitions, 3362 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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:57,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:57,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-01-09 21:23:57,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:58,877 INFO L124 PetriNetUnfolderBase]: 1482/5034 cut-off events. [2025-01-09 21:23:58,877 INFO L125 PetriNetUnfolderBase]: For 8565/8665 co-relation queries the response was YES. [2025-01-09 21:23:58,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 5034 events. 1482/5034 cut-off events. For 8565/8665 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 40127 event pairs, 100 based on Foata normal form. 47/4999 useless extension candidates. Maximal degree in co-relation 15887. Up to 955 conditions per place. [2025-01-09 21:23:58,904 INFO L140 encePairwiseOnDemand]: 260/293 looper letters, 442 selfloop transitions, 192 changer transitions 1/881 dead transitions. [2025-01-09 21:23:58,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 881 transitions, 7168 flow [2025-01-09 21:23:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:23:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:23:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4321 transitions. [2025-01-09 21:23:58,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776181067001976 [2025-01-09 21:23:58,911 INFO L175 Difference]: Start difference. First operand has 321 places, 570 transitions, 3362 flow. Second operand 19 states and 4321 transitions. [2025-01-09 21:23:58,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 881 transitions, 7168 flow [2025-01-09 21:23:58,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 881 transitions, 6986 flow, removed 91 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:58,949 INFO L231 Difference]: Finished difference. Result has 348 places, 701 transitions, 5266 flow [2025-01-09 21:23:58,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=3250, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5266, PETRI_PLACES=348, PETRI_TRANSITIONS=701} [2025-01-09 21:23:58,951 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 52 predicate places. [2025-01-09 21:23:58,951 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 701 transitions, 5266 flow [2025-01-09 21:23:58,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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:58,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:58,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:23:58,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:23:58,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:58,953 INFO L85 PathProgramCache]: Analyzing trace with hash 449689358, now seen corresponding path program 2 times [2025-01-09 21:23:58,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:58,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152142536] [2025-01-09 21:23:58,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:58,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:58,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-01-09 21:23:58,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 201 of 202 statements. [2025-01-09 21:23:58,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:58,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:59,634 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:59,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:59,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152142536] [2025-01-09 21:23:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152142536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:59,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:59,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276915261] [2025-01-09 21:23:59,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:59,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:59,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:59,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:00,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-01-09 21:24:00,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 701 transitions, 5266 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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:24:00,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:00,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-01-09 21:24:00,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:02,110 INFO L124 PetriNetUnfolderBase]: 2096/7132 cut-off events. [2025-01-09 21:24:02,110 INFO L125 PetriNetUnfolderBase]: For 17130/17345 co-relation queries the response was YES. [2025-01-09 21:24:02,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24346 conditions, 7132 events. 2096/7132 cut-off events. For 17130/17345 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 64366 event pairs, 150 based on Foata normal form. 82/7114 useless extension candidates. Maximal degree in co-relation 24191. Up to 1553 conditions per place. [2025-01-09 21:24:02,147 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 444 selfloop transitions, 258 changer transitions 4/952 dead transitions. [2025-01-09 21:24:02,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 952 transitions, 8766 flow [2025-01-09 21:24:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:24:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:24:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3289 transitions. [2025-01-09 21:24:02,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8018039980497318 [2025-01-09 21:24:02,152 INFO L175 Difference]: Start difference. First operand has 348 places, 701 transitions, 5266 flow. Second operand 14 states and 3289 transitions. [2025-01-09 21:24:02,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 952 transitions, 8766 flow [2025-01-09 21:24:02,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 952 transitions, 8703 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:02,224 INFO L231 Difference]: Finished difference. Result has 366 places, 780 transitions, 7383 flow [2025-01-09 21:24:02,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=5225, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7383, PETRI_PLACES=366, PETRI_TRANSITIONS=780} [2025-01-09 21:24:02,225 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 70 predicate places. [2025-01-09 21:24:02,226 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 780 transitions, 7383 flow [2025-01-09 21:24:02,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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:24:02,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:02,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:02,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:24:02,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:24:02,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1607427598, now seen corresponding path program 3 times [2025-01-09 21:24:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:02,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925084957] [2025-01-09 21:24:02,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:24:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:02,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 202 statements into 2 equivalence classes. [2025-01-09 21:24:02,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 201 of 202 statements. [2025-01-09 21:24:02,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:24:02,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:02,813 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:24:02,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:02,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925084957] [2025-01-09 21:24:02,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925084957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:02,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:02,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:24:02,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151938723] [2025-01-09 21:24:02,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:02,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:24:02,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:02,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:24:02,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:03,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-01-09 21:24:03,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 780 transitions, 7383 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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:24:03,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:03,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-01-09 21:24:03,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:05,308 INFO L124 PetriNetUnfolderBase]: 2168/7348 cut-off events. [2025-01-09 21:24:05,308 INFO L125 PetriNetUnfolderBase]: For 26050/26280 co-relation queries the response was YES. [2025-01-09 21:24:05,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27164 conditions, 7348 events. 2168/7348 cut-off events. For 26050/26280 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 66261 event pairs, 208 based on Foata normal form. 82/7316 useless extension candidates. Maximal degree in co-relation 26998. Up to 1395 conditions per place. [2025-01-09 21:24:05,346 INFO L140 encePairwiseOnDemand]: 268/293 looper letters, 538 selfloop transitions, 173 changer transitions 1/958 dead transitions. [2025-01-09 21:24:05,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 958 transitions, 10427 flow [2025-01-09 21:24:05,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:24:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:24:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4296 transitions. [2025-01-09 21:24:05,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7716903179450332 [2025-01-09 21:24:05,352 INFO L175 Difference]: Start difference. First operand has 366 places, 780 transitions, 7383 flow. Second operand 19 states and 4296 transitions. [2025-01-09 21:24:05,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 958 transitions, 10427 flow [2025-01-09 21:24:05,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 958 transitions, 10422 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:24:05,448 INFO L231 Difference]: Finished difference. Result has 390 places, 837 transitions, 8650 flow [2025-01-09 21:24:05,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=7378, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8650, PETRI_PLACES=390, PETRI_TRANSITIONS=837} [2025-01-09 21:24:05,449 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 94 predicate places. [2025-01-09 21:24:05,449 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 837 transitions, 8650 flow [2025-01-09 21:24:05,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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:24:05,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:05,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:05,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:24:05,451 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:24:05,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1006544148, now seen corresponding path program 4 times [2025-01-09 21:24:05,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:05,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469448315] [2025-01-09 21:24:05,452 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:24:05,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:05,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 202 statements into 2 equivalence classes. [2025-01-09 21:24:05,480 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 186 of 202 statements. [2025-01-09 21:24:05,480 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:24:05,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:06,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:06,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469448315] [2025-01-09 21:24:06,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469448315] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:06,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447427050] [2025-01-09 21:24:06,016 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:24:06,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:06,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:06,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:24:06,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:24:06,149 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 202 statements into 2 equivalence classes. [2025-01-09 21:24:06,201 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 186 of 202 statements. [2025-01-09 21:24:06,201 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:24:06,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:06,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 21:24:06,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:06,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 21:24:06,418 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:24:06,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 21:24:06,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:24:06,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 21:24:06,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-01-09 21:24:06,653 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:24:06,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 21:24:06,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-01-09 21:24:06,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-01-09 21:24:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:06,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447427050] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:35,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:35,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-01-09 21:24:35,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134111856] [2025-01-09 21:24:35,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:35,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 21:24:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:35,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 21:24:35,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=944, Unknown=3, NotChecked=0, Total=1122 [2025-01-09 21:24:39,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:43,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:47,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:51,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:54,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:59,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:25:05,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:25:09,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:25:14,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:25:20,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:25:21,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]