./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/pthread-race-challenges/per-thread-array-index.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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1'] 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/pthread-race-challenges/per-thread-array-index.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 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:47:05,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:47:06,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-07 15:47:06,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:47:06,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:47:06,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:47:06,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:47:06,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:47:06,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:47:06,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:47:06,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:47:06,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:47:06,087 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:47:06,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:47:06,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:47:06,088 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:47:06,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:47:06,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:47:06,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:47:06,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:47:06,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:47:06,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:47:06,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:47:06,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:47:06,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:47:06,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:47:06,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:47:06,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:47:06,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:47:06,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:47:06,091 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 -> 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 [2024-11-07 15:47:06,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:47:06,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:47:06,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:47:06,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:47:06,364 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:47:06,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i [2024-11-07 15:47:07,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:47:07,840 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:47:07,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i [2024-11-07 15:47:07,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/933ad4c2d/62200f76af0c4121a93e14f36072a432/FLAGca6911753 [2024-11-07 15:47:07,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/933ad4c2d/62200f76af0c4121a93e14f36072a432 [2024-11-07 15:47:07,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:47:07,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:47:07,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:47:07,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:47:07,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:47:07,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:47:07" (1/1) ... [2024-11-07 15:47:07,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bcb899c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:07, skipping insertion in model container [2024-11-07 15:47:07,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:47:07" (1/1) ... [2024-11-07 15:47:07,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:47:08,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:47:08,226 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:47:08,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:47:08,311 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:47:08,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08 WrapperNode [2024-11-07 15:47:08,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:47:08,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:47:08,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:47:08,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:47:08,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,343 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-11-07 15:47:08,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:47:08,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:47:08,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:47:08,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:47:08,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:47:08,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:47:08,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:47:08,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:47:08,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (1/1) ... [2024-11-07 15:47:08,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:47:08,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:47:08,396 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) [2024-11-07 15:47:08,413 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 [2024-11-07 15:47:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 15:47:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:47:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:47:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:47:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-07 15:47:08,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-07 15:47:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:47:08,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:47:08,442 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 15:47:08,552 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:47:08,553 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:47:08,681 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:47:08,682 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:47:08,689 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:47:08,690 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 15:47:08,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:47:08 BoogieIcfgContainer [2024-11-07 15:47:08,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:47:08,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:47:08,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:47:08,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:47:08,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:47:07" (1/3) ... [2024-11-07 15:47:08,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ace6dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:47:08, skipping insertion in model container [2024-11-07 15:47:08,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:47:08" (2/3) ... [2024-11-07 15:47:08,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ace6dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:47:08, skipping insertion in model container [2024-11-07 15:47:08,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:47:08" (3/3) ... [2024-11-07 15:47:08,698 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-index.i [2024-11-07 15:47:08,709 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:47:08,709 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-07 15:47:08,710 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:47:08,748 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-07 15:47:08,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 96 transitions, 199 flow [2024-11-07 15:47:08,810 INFO L124 PetriNetUnfolderBase]: 6/131 cut-off events. [2024-11-07 15:47:08,812 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:47:08,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 131 events. 6/131 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 229 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. [2024-11-07 15:47:08,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 96 transitions, 199 flow [2024-11-07 15:47:08,818 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 96 transitions, 199 flow [2024-11-07 15:47:08,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:47:08,841 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;@bd2e796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:47:08,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-07 15:47:08,850 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:47:08,850 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-07 15:47:08,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:47:08,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:08,850 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:08,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:47:08,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash -544149586, now seen corresponding path program 1 times [2024-11-07 15:47:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:08,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975936216] [2024-11-07 15:47:08,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:09,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:09,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975936216] [2024-11-07 15:47:09,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975936216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:09,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:09,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:47:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996618868] [2024-11-07 15:47:09,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:09,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:47:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:09,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:47:09,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:47:09,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 96 [2024-11-07 15:47:09,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:09,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:09,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 96 [2024-11-07 15:47:09,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:09,102 INFO L124 PetriNetUnfolderBase]: 3/161 cut-off events. [2024-11-07 15:47:09,102 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 15:47:09,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 161 events. 3/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 330 event pairs, 2 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 101. Up to 15 conditions per place. [2024-11-07 15:47:09,104 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 8 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2024-11-07 15:47:09,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 211 flow [2024-11-07 15:47:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:47:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:47:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2024-11-07 15:47:09,113 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2024-11-07 15:47:09,115 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 199 flow. Second operand 3 states and 260 transitions. [2024-11-07 15:47:09,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 211 flow [2024-11-07 15:47:09,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:09,120 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 193 flow [2024-11-07 15:47:09,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2024-11-07 15:47:09,124 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2024-11-07 15:47:09,124 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 193 flow [2024-11-07 15:47:09,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:09,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:09,125 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:47:09,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:47:09,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1305463396, now seen corresponding path program 1 times [2024-11-07 15:47:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653196816] [2024-11-07 15:47:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:09,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:09,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653196816] [2024-11-07 15:47:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653196816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:09,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:47:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913057660] [2024-11-07 15:47:09,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:09,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:47:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:09,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:47:09,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:47:09,189 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2024-11-07 15:47:09,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:09,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:09,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2024-11-07 15:47:09,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:09,234 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2024-11-07 15:47:09,234 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-07 15:47:09,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 169 events. 5/169 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 335 event pairs, 2 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 164. Up to 16 conditions per place. [2024-11-07 15:47:09,236 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 7 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-11-07 15:47:09,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 211 flow [2024-11-07 15:47:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:47:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:47:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-07 15:47:09,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9131944444444444 [2024-11-07 15:47:09,238 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 193 flow. Second operand 3 states and 263 transitions. [2024-11-07 15:47:09,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 211 flow [2024-11-07 15:47:09,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:47:09,240 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 199 flow [2024-11-07 15:47:09,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2024-11-07 15:47:09,241 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2024-11-07 15:47:09,241 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 199 flow [2024-11-07 15:47:09,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:09,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:09,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:09,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:47:09,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:47:09,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:09,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1732395560, now seen corresponding path program 1 times [2024-11-07 15:47:09,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:09,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883356156] [2024-11-07 15:47:09,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:09,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:09,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:09,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883356156] [2024-11-07 15:47:09,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883356156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:09,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:09,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:09,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611878606] [2024-11-07 15:47:09,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:09,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:47:09,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:09,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:47:09,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:47:09,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2024-11-07 15:47:09,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:09,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:09,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2024-11-07 15:47:09,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:09,954 INFO L124 PetriNetUnfolderBase]: 73/402 cut-off events. [2024-11-07 15:47:09,955 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:47:09,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 402 events. 73/402 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1947 event pairs, 35 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 501. Up to 159 conditions per place. [2024-11-07 15:47:09,959 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 23 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2024-11-07 15:47:09,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 112 transitions, 331 flow [2024-11-07 15:47:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2024-11-07 15:47:09,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7986111111111112 [2024-11-07 15:47:09,962 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 199 flow. Second operand 6 states and 460 transitions. [2024-11-07 15:47:09,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 112 transitions, 331 flow [2024-11-07 15:47:09,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:09,967 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 349 flow [2024-11-07 15:47:09,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=104, PETRI_TRANSITIONS=112} [2024-11-07 15:47:09,968 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 9 predicate places. [2024-11-07 15:47:09,968 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 349 flow [2024-11-07 15:47:09,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:09,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:09,968 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:09,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:47:09,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:47:09,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1866357126, now seen corresponding path program 1 times [2024-11-07 15:47:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:09,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941828550] [2024-11-07 15:47:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:10,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:10,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941828550] [2024-11-07 15:47:10,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941828550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:10,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:10,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:10,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899161128] [2024-11-07 15:47:10,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:10,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:47:10,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:10,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:47:10,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:47:10,269 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 96 [2024-11-07 15:47:10,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:10,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:10,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 96 [2024-11-07 15:47:10,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:10,302 INFO L124 PetriNetUnfolderBase]: 34/262 cut-off events. [2024-11-07 15:47:10,302 INFO L125 PetriNetUnfolderBase]: For 31/39 co-relation queries the response was YES. [2024-11-07 15:47:10,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 262 events. 34/262 cut-off events. For 31/39 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 933 event pairs, 0 based on Foata normal form. 2/254 useless extension candidates. Maximal degree in co-relation 335. Up to 49 conditions per place. [2024-11-07 15:47:10,304 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 11 selfloop transitions, 2 changer transitions 5/117 dead transitions. [2024-11-07 15:47:10,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 117 transitions, 395 flow [2024-11-07 15:47:10,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2024-11-07 15:47:10,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8663194444444444 [2024-11-07 15:47:10,305 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 349 flow. Second operand 6 states and 499 transitions. [2024-11-07 15:47:10,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 117 transitions, 395 flow [2024-11-07 15:47:10,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 117 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:10,308 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 367 flow [2024-11-07 15:47:10,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2024-11-07 15:47:10,308 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 18 predicate places. [2024-11-07 15:47:10,308 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 367 flow [2024-11-07 15:47:10,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:10,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:10,309 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:10,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:47:10,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:47:10,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1957891883, now seen corresponding path program 1 times [2024-11-07 15:47:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:10,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407212826] [2024-11-07 15:47:10,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:10,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:10,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407212826] [2024-11-07 15:47:10,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407212826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:10,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:10,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:10,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377561332] [2024-11-07 15:47:10,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:10,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:47:10,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:10,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:47:10,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:47:10,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96 [2024-11-07 15:47:10,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:10,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:10,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96 [2024-11-07 15:47:10,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:10,789 INFO L124 PetriNetUnfolderBase]: 131/506 cut-off events. [2024-11-07 15:47:10,789 INFO L125 PetriNetUnfolderBase]: For 135/137 co-relation queries the response was YES. [2024-11-07 15:47:10,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 506 events. 131/506 cut-off events. For 135/137 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2624 event pairs, 23 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 1034. Up to 240 conditions per place. [2024-11-07 15:47:10,794 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 35 selfloop transitions, 48 changer transitions 12/155 dead transitions. [2024-11-07 15:47:10,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 155 transitions, 689 flow [2024-11-07 15:47:10,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2024-11-07 15:47:10,796 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8524305555555556 [2024-11-07 15:47:10,796 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 367 flow. Second operand 6 states and 491 transitions. [2024-11-07 15:47:10,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 155 transitions, 689 flow [2024-11-07 15:47:10,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 155 transitions, 675 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-07 15:47:10,801 INFO L231 Difference]: Finished difference. Result has 115 places, 143 transitions, 710 flow [2024-11-07 15:47:10,804 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=115, PETRI_TRANSITIONS=143} [2024-11-07 15:47:10,804 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2024-11-07 15:47:10,804 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 143 transitions, 710 flow [2024-11-07 15:47:10,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:10,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:10,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:10,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:47:10,805 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:47:10,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:10,805 INFO L85 PathProgramCache]: Analyzing trace with hash -676534449, now seen corresponding path program 1 times [2024-11-07 15:47:10,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:10,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480265514] [2024-11-07 15:47:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 15:47:11,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:11,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480265514] [2024-11-07 15:47:11,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480265514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:11,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:11,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:11,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600943261] [2024-11-07 15:47:11,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:11,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:47:11,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:11,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:47:11,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:47:11,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 96 [2024-11-07 15:47:11,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 143 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:11,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:11,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 96 [2024-11-07 15:47:11,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:11,290 INFO L124 PetriNetUnfolderBase]: 142/512 cut-off events. [2024-11-07 15:47:11,290 INFO L125 PetriNetUnfolderBase]: For 432/436 co-relation queries the response was YES. [2024-11-07 15:47:11,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 512 events. 142/512 cut-off events. For 432/436 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2815 event pairs, 10 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 1505. Up to 241 conditions per place. [2024-11-07 15:47:11,293 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 73 selfloop transitions, 25 changer transitions 13/171 dead transitions. [2024-11-07 15:47:11,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 171 transitions, 1093 flow [2024-11-07 15:47:11,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2024-11-07 15:47:11,295 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8142361111111112 [2024-11-07 15:47:11,296 INFO L175 Difference]: Start difference. First operand has 115 places, 143 transitions, 710 flow. Second operand 6 states and 469 transitions. [2024-11-07 15:47:11,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 171 transitions, 1093 flow [2024-11-07 15:47:11,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1074 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-07 15:47:11,305 INFO L231 Difference]: Finished difference. Result has 114 places, 158 transitions, 926 flow [2024-11-07 15:47:11,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=926, PETRI_PLACES=114, PETRI_TRANSITIONS=158} [2024-11-07 15:47:11,306 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 19 predicate places. [2024-11-07 15:47:11,307 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 158 transitions, 926 flow [2024-11-07 15:47:11,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:11,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:11,307 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:11,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:47:11,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:47:11,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash 360110075, now seen corresponding path program 1 times [2024-11-07 15:47:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:11,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538120027] [2024-11-07 15:47:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:47:11,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:47:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:47:11,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:47:11,360 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:47:11,361 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-07 15:47:11,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-07 15:47:11,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-07 15:47:11,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-07 15:47:11,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-07 15:47:11,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-07 15:47:11,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-07 15:47:11,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-07 15:47:11,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-07 15:47:11,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:47:11,365 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:11,366 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:47:11,369 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-07 15:47:11,404 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 15:47:11,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 117 transitions, 250 flow [2024-11-07 15:47:11,424 INFO L124 PetriNetUnfolderBase]: 11/223 cut-off events. [2024-11-07 15:47:11,424 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 15:47:11,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 223 events. 11/223 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 488 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2024-11-07 15:47:11,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 117 transitions, 250 flow [2024-11-07 15:47:11,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 117 transitions, 250 flow [2024-11-07 15:47:11,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:47:11,428 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;@bd2e796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:47:11,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-07 15:47:11,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:47:11,429 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-07 15:47:11,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:47:11,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:11,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:11,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:11,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1771504451, now seen corresponding path program 1 times [2024-11-07 15:47:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:11,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545947160] [2024-11-07 15:47:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545947160] [2024-11-07 15:47:11,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545947160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:47:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007376717] [2024-11-07 15:47:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:11,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:47:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:11,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:47:11,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:47:11,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 117 [2024-11-07 15:47:11,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:11,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:11,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 117 [2024-11-07 15:47:11,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:11,509 INFO L124 PetriNetUnfolderBase]: 19/441 cut-off events. [2024-11-07 15:47:11,509 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-07 15:47:11,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 441 events. 19/441 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1876 event pairs, 16 based on Foata normal form. 9/393 useless extension candidates. Maximal degree in co-relation 287. Up to 50 conditions per place. [2024-11-07 15:47:11,511 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 11 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2024-11-07 15:47:11,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 268 flow [2024-11-07 15:47:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:47:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:47:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2024-11-07 15:47:11,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9031339031339032 [2024-11-07 15:47:11,512 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 250 flow. Second operand 3 states and 317 transitions. [2024-11-07 15:47:11,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 268 flow [2024-11-07 15:47:11,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:11,515 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 244 flow [2024-11-07 15:47:11,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2024-11-07 15:47:11,515 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2024-11-07 15:47:11,516 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 244 flow [2024-11-07 15:47:11,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:11,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:11,516 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:11,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:47:11,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:11,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1558441532, now seen corresponding path program 1 times [2024-11-07 15:47:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412928532] [2024-11-07 15:47:11,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:11,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:11,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:11,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412928532] [2024-11-07 15:47:11,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412928532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:11,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:11,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:47:11,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220171116] [2024-11-07 15:47:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:11,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:47:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:47:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:47:11,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 117 [2024-11-07 15:47:11,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:11,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:11,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 117 [2024-11-07 15:47:11,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:11,600 INFO L124 PetriNetUnfolderBase]: 48/598 cut-off events. [2024-11-07 15:47:11,600 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-07 15:47:11,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 598 events. 48/598 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2965 event pairs, 27 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 692. Up to 97 conditions per place. [2024-11-07 15:47:11,603 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 12 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2024-11-07 15:47:11,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 281 flow [2024-11-07 15:47:11,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:47:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:47:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2024-11-07 15:47:11,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905982905982906 [2024-11-07 15:47:11,604 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 244 flow. Second operand 3 states and 318 transitions. [2024-11-07 15:47:11,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 281 flow [2024-11-07 15:47:11,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:47:11,606 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 255 flow [2024-11-07 15:47:11,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2024-11-07 15:47:11,606 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2024-11-07 15:47:11,606 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 255 flow [2024-11-07 15:47:11,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:11,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:11,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:11,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:47:11,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:11,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1701174552, now seen corresponding path program 1 times [2024-11-07 15:47:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820924455] [2024-11-07 15:47:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:11,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:11,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820924455] [2024-11-07 15:47:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820924455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:11,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:11,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992273997] [2024-11-07 15:47:11,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:11,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:47:11,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:11,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:47:11,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:47:11,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2024-11-07 15:47:11,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:11,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:11,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2024-11-07 15:47:11,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:12,232 INFO L124 PetriNetUnfolderBase]: 1014/3169 cut-off events. [2024-11-07 15:47:12,233 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-07 15:47:12,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 3169 events. 1014/3169 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 26242 event pairs, 586 based on Foata normal form. 0/2847 useless extension candidates. Maximal degree in co-relation 4117. Up to 1592 conditions per place. [2024-11-07 15:47:12,244 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 30 selfloop transitions, 38 changer transitions 0/150 dead transitions. [2024-11-07 15:47:12,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 150 transitions, 472 flow [2024-11-07 15:47:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2024-11-07 15:47:12,245 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8162393162393162 [2024-11-07 15:47:12,246 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 255 flow. Second operand 6 states and 573 transitions. [2024-11-07 15:47:12,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 150 transitions, 472 flow [2024-11-07 15:47:12,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 150 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:12,248 INFO L231 Difference]: Finished difference. Result has 125 places, 149 transitions, 509 flow [2024-11-07 15:47:12,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=509, PETRI_PLACES=125, PETRI_TRANSITIONS=149} [2024-11-07 15:47:12,248 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2024-11-07 15:47:12,248 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 149 transitions, 509 flow [2024-11-07 15:47:12,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:12,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:12,249 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:12,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:47:12,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:12,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1567212986, now seen corresponding path program 1 times [2024-11-07 15:47:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:12,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521128521] [2024-11-07 15:47:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:12,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:12,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521128521] [2024-11-07 15:47:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521128521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:12,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:12,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447185094] [2024-11-07 15:47:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:12,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:47:12,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:12,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:47:12,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:47:12,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 117 [2024-11-07 15:47:12,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 149 transitions, 509 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:12,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:12,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 117 [2024-11-07 15:47:12,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:12,585 INFO L124 PetriNetUnfolderBase]: 481/1741 cut-off events. [2024-11-07 15:47:12,586 INFO L125 PetriNetUnfolderBase]: For 382/462 co-relation queries the response was YES. [2024-11-07 15:47:12,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 1741 events. 481/1741 cut-off events. For 382/462 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 12358 event pairs, 131 based on Foata normal form. 2/1643 useless extension candidates. Maximal degree in co-relation 2638. Up to 615 conditions per place. [2024-11-07 15:47:12,596 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 14 selfloop transitions, 2 changer transitions 5/155 dead transitions. [2024-11-07 15:47:12,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 155 transitions, 563 flow [2024-11-07 15:47:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2024-11-07 15:47:12,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8774928774928775 [2024-11-07 15:47:12,598 INFO L175 Difference]: Start difference. First operand has 125 places, 149 transitions, 509 flow. Second operand 6 states and 616 transitions. [2024-11-07 15:47:12,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 155 transitions, 563 flow [2024-11-07 15:47:12,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 155 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:12,604 INFO L231 Difference]: Finished difference. Result has 134 places, 150 transitions, 531 flow [2024-11-07 15:47:12,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=134, PETRI_TRANSITIONS=150} [2024-11-07 15:47:12,605 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2024-11-07 15:47:12,605 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 150 transitions, 531 flow [2024-11-07 15:47:12,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:12,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:12,606 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:12,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:47:12,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:12,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1925682072, now seen corresponding path program 1 times [2024-11-07 15:47:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:12,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628266906] [2024-11-07 15:47:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:12,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628266906] [2024-11-07 15:47:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628266906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:12,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:12,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610714537] [2024-11-07 15:47:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:12,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:47:12,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:12,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:47:12,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:47:12,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2024-11-07 15:47:12,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 150 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:12,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:12,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2024-11-07 15:47:12,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:13,614 INFO L124 PetriNetUnfolderBase]: 2425/6842 cut-off events. [2024-11-07 15:47:13,614 INFO L125 PetriNetUnfolderBase]: For 1864/2249 co-relation queries the response was YES. [2024-11-07 15:47:13,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14933 conditions, 6842 events. 2425/6842 cut-off events. For 1864/2249 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 62494 event pairs, 537 based on Foata normal form. 17/6325 useless extension candidates. Maximal degree in co-relation 14831. Up to 2882 conditions per place. [2024-11-07 15:47:13,646 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 86 selfloop transitions, 86 changer transitions 0/260 dead transitions. [2024-11-07 15:47:13,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 260 transitions, 1359 flow [2024-11-07 15:47:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2024-11-07 15:47:13,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8874643874643875 [2024-11-07 15:47:13,648 INFO L175 Difference]: Start difference. First operand has 134 places, 150 transitions, 531 flow. Second operand 6 states and 623 transitions. [2024-11-07 15:47:13,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 260 transitions, 1359 flow [2024-11-07 15:47:13,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 1347 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 15:47:13,656 INFO L231 Difference]: Finished difference. Result has 136 places, 233 transitions, 1245 flow [2024-11-07 15:47:13,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1245, PETRI_PLACES=136, PETRI_TRANSITIONS=233} [2024-11-07 15:47:13,657 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2024-11-07 15:47:13,657 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 233 transitions, 1245 flow [2024-11-07 15:47:13,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:13,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:13,658 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:13,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:47:13,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:13,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1833776535, now seen corresponding path program 1 times [2024-11-07 15:47:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057688090] [2024-11-07 15:47:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 15:47:13,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:13,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057688090] [2024-11-07 15:47:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057688090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:13,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:13,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:13,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432774627] [2024-11-07 15:47:13,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:13,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:47:13,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:13,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:47:13,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:47:13,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2024-11-07 15:47:13,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 233 transitions, 1245 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:13,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:13,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2024-11-07 15:47:13,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:14,884 INFO L124 PetriNetUnfolderBase]: 3064/8860 cut-off events. [2024-11-07 15:47:14,884 INFO L125 PetriNetUnfolderBase]: For 6913/7212 co-relation queries the response was YES. [2024-11-07 15:47:14,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24607 conditions, 8860 events. 3064/8860 cut-off events. For 6913/7212 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 88155 event pairs, 525 based on Foata normal form. 14/8296 useless extension candidates. Maximal degree in co-relation 23620. Up to 4186 conditions per place. [2024-11-07 15:47:14,922 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 135 selfloop transitions, 71 changer transitions 0/301 dead transitions. [2024-11-07 15:47:14,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 301 transitions, 2101 flow [2024-11-07 15:47:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2024-11-07 15:47:14,924 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8319088319088319 [2024-11-07 15:47:14,924 INFO L175 Difference]: Start difference. First operand has 136 places, 233 transitions, 1245 flow. Second operand 6 states and 584 transitions. [2024-11-07 15:47:14,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 301 transitions, 2101 flow [2024-11-07 15:47:14,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 301 transitions, 2083 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:14,946 INFO L231 Difference]: Finished difference. Result has 146 places, 299 transitions, 2007 flow [2024-11-07 15:47:14,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2007, PETRI_PLACES=146, PETRI_TRANSITIONS=299} [2024-11-07 15:47:14,946 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2024-11-07 15:47:14,946 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 299 transitions, 2007 flow [2024-11-07 15:47:14,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:14,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:14,947 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:14,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:47:14,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:14,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:14,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2096755450, now seen corresponding path program 1 times [2024-11-07 15:47:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:14,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436872770] [2024-11-07 15:47:14,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:14,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 15:47:15,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:15,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436872770] [2024-11-07 15:47:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436872770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:47:15,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719253678] [2024-11-07 15:47:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:15,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:47:15,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:47:15,235 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) [2024-11-07 15:47:15,236 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 [2024-11-07 15:47:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:15,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 15:47:15,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:47:15,340 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 [2024-11-07 15:47:15,379 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 15:47:15,379 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 [2024-11-07 15:47:15,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 15:47:15,433 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 28 treesize of output 27 [2024-11-07 15:47:15,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 15:47:15,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-07 15:47:15,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 15:47:15,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-07 15:47:15,576 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 56 treesize of output 45 [2024-11-07 15:47:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 15:47:15,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:47:15,608 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)))) is different from false [2024-11-07 15:47:15,732 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet10#1| (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-07 15:47:19,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 15:47:19,482 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2024-11-07 15:47:19,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 15:47:19,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2024-11-07 15:47:19,498 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-07 15:47:19,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-07 15:47:19,502 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-07 15:47:19,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-07 15:47:19,505 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-07 15:47:19,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-07 15:47:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 6 trivial. 1 not checked. [2024-11-07 15:47:19,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719253678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:47:19,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:47:19,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-07 15:47:19,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171742966] [2024-11-07 15:47:19,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:47:19,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 15:47:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:19,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 15:47:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=147, Unknown=20, NotChecked=54, Total=272 [2024-11-07 15:47:19,678 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 117 [2024-11-07 15:47:19,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 299 transitions, 2007 flow. Second operand has 17 states, 17 states have (on average 64.29411764705883) internal successors, (1093), 17 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:19,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:19,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 117 [2024-11-07 15:47:19,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:21,748 INFO L124 PetriNetUnfolderBase]: 8340/18854 cut-off events. [2024-11-07 15:47:21,748 INFO L125 PetriNetUnfolderBase]: For 24174/24181 co-relation queries the response was YES. [2024-11-07 15:47:21,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58389 conditions, 18854 events. 8340/18854 cut-off events. For 24174/24181 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 186968 event pairs, 2798 based on Foata normal form. 172/18023 useless extension candidates. Maximal degree in co-relation 56426. Up to 8310 conditions per place. [2024-11-07 15:47:21,870 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 389 selfloop transitions, 36 changer transitions 0/490 dead transitions. [2024-11-07 15:47:21,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 490 transitions, 4293 flow [2024-11-07 15:47:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 15:47:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 15:47:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 942 transitions. [2024-11-07 15:47:21,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193293885601578 [2024-11-07 15:47:21,874 INFO L175 Difference]: Start difference. First operand has 146 places, 299 transitions, 2007 flow. Second operand 13 states and 942 transitions. [2024-11-07 15:47:21,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 490 transitions, 4293 flow [2024-11-07 15:47:21,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 490 transitions, 4153 flow, removed 70 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:21,936 INFO L231 Difference]: Finished difference. Result has 157 places, 298 transitions, 1935 flow [2024-11-07 15:47:21,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1935, PETRI_PLACES=157, PETRI_TRANSITIONS=298} [2024-11-07 15:47:21,938 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 40 predicate places. [2024-11-07 15:47:21,938 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 298 transitions, 1935 flow [2024-11-07 15:47:21,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 64.29411764705883) internal successors, (1093), 17 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:21,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:21,939 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:21,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 15:47:22,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-07 15:47:22,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:22,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 210699178, now seen corresponding path program 1 times [2024-11-07 15:47:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811527957] [2024-11-07 15:47:22,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:22,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:22,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811527957] [2024-11-07 15:47:22,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811527957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:22,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:22,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:47:22,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636782491] [2024-11-07 15:47:22,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:22,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:47:22,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:22,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:47:22,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:47:22,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2024-11-07 15:47:22,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 298 transitions, 1935 flow. Second operand has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:22,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:22,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2024-11-07 15:47:22,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:24,387 INFO L124 PetriNetUnfolderBase]: 5098/13026 cut-off events. [2024-11-07 15:47:24,387 INFO L125 PetriNetUnfolderBase]: For 18390/20337 co-relation queries the response was YES. [2024-11-07 15:47:24,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43817 conditions, 13026 events. 5098/13026 cut-off events. For 18390/20337 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 129019 event pairs, 584 based on Foata normal form. 295/12780 useless extension candidates. Maximal degree in co-relation 39905. Up to 3171 conditions per place. [2024-11-07 15:47:24,451 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 339 selfloop transitions, 262 changer transitions 6/687 dead transitions. [2024-11-07 15:47:24,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 687 transitions, 6029 flow [2024-11-07 15:47:24,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 15:47:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-07 15:47:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1593 transitions. [2024-11-07 15:47:24,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2024-11-07 15:47:24,455 INFO L175 Difference]: Start difference. First operand has 157 places, 298 transitions, 1935 flow. Second operand 18 states and 1593 transitions. [2024-11-07 15:47:24,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 687 transitions, 6029 flow [2024-11-07 15:47:24,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 687 transitions, 5885 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-07 15:47:24,502 INFO L231 Difference]: Finished difference. Result has 172 places, 504 transitions, 4571 flow [2024-11-07 15:47:24,502 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4571, PETRI_PLACES=172, PETRI_TRANSITIONS=504} [2024-11-07 15:47:24,503 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 55 predicate places. [2024-11-07 15:47:24,503 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 504 transitions, 4571 flow [2024-11-07 15:47:24,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:24,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:24,504 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:24,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:47:24,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:24,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1121471070, now seen corresponding path program 1 times [2024-11-07 15:47:24,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:24,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493691548] [2024-11-07 15:47:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 15:47:24,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:24,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493691548] [2024-11-07 15:47:24,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493691548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:24,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:24,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:47:24,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402856555] [2024-11-07 15:47:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:24,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:47:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:24,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:47:24,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:47:25,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2024-11-07 15:47:25,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 504 transitions, 4571 flow. Second operand has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:25,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:25,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2024-11-07 15:47:25,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:26,543 INFO L124 PetriNetUnfolderBase]: 4493/12055 cut-off events. [2024-11-07 15:47:26,543 INFO L125 PetriNetUnfolderBase]: For 34759/35368 co-relation queries the response was YES. [2024-11-07 15:47:26,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48086 conditions, 12055 events. 4493/12055 cut-off events. For 34759/35368 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 121277 event pairs, 446 based on Foata normal form. 184/11667 useless extension candidates. Maximal degree in co-relation 46711. Up to 3248 conditions per place. [2024-11-07 15:47:26,744 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 495 selfloop transitions, 44 changer transitions 0/656 dead transitions. [2024-11-07 15:47:26,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 656 transitions, 7534 flow [2024-11-07 15:47:26,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 15:47:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 15:47:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1098 transitions. [2024-11-07 15:47:26,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7218934911242604 [2024-11-07 15:47:26,751 INFO L175 Difference]: Start difference. First operand has 172 places, 504 transitions, 4571 flow. Second operand 13 states and 1098 transitions. [2024-11-07 15:47:26,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 656 transitions, 7534 flow [2024-11-07 15:47:26,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 656 transitions, 7456 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-11-07 15:47:26,905 INFO L231 Difference]: Finished difference. Result has 178 places, 503 transitions, 4585 flow [2024-11-07 15:47:26,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4585, PETRI_PLACES=178, PETRI_TRANSITIONS=503} [2024-11-07 15:47:26,907 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2024-11-07 15:47:26,907 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 503 transitions, 4585 flow [2024-11-07 15:47:26,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:26,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:26,908 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:26,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:47:26,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:26,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:26,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1249667111, now seen corresponding path program 1 times [2024-11-07 15:47:26,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:26,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260232229] [2024-11-07 15:47:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:26,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 15:47:27,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:27,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260232229] [2024-11-07 15:47:27,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260232229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:27,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:27,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581717147] [2024-11-07 15:47:27,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:27,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:47:27,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:27,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:47:27,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:47:27,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2024-11-07 15:47:27,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 503 transitions, 4585 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:27,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:27,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2024-11-07 15:47:27,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:28,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread2of2ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} AuxVars[] AssignedVars[#race][342], [Black: 130#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 132#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 131#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 129#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 66#L1022-7true, 118#true, 95#L1022-11true, Black: 140#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 579#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 577#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 571#true, 67#L1036-1true, Black: 593#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 581#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 597#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 154#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 578#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 151#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 595#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 152#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 153#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 591#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 580#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 161#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 162#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 149#true, 159#true, 125#(= |#race~datas~0| 0), 116#true, 637#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), 613#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), 576#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), 127#true, Black: 123#true]) [2024-11-07 15:47:28,205 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2024-11-07 15:47:28,205 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-07 15:47:28,205 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-07 15:47:28,205 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-07 15:47:30,078 INFO L124 PetriNetUnfolderBase]: 9680/22056 cut-off events. [2024-11-07 15:47:30,078 INFO L125 PetriNetUnfolderBase]: For 74960/76100 co-relation queries the response was YES. [2024-11-07 15:47:30,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90124 conditions, 22056 events. 9680/22056 cut-off events. For 74960/76100 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 226486 event pairs, 1081 based on Foata normal form. 11/20925 useless extension candidates. Maximal degree in co-relation 88034. Up to 11088 conditions per place. [2024-11-07 15:47:30,382 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 362 selfloop transitions, 355 changer transitions 12/860 dead transitions. [2024-11-07 15:47:30,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 860 transitions, 9417 flow [2024-11-07 15:47:30,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2024-11-07 15:47:30,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8817663817663818 [2024-11-07 15:47:30,386 INFO L175 Difference]: Start difference. First operand has 178 places, 503 transitions, 4585 flow. Second operand 6 states and 619 transitions. [2024-11-07 15:47:30,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 860 transitions, 9417 flow [2024-11-07 15:47:30,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 860 transitions, 9181 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-07 15:47:30,816 INFO L231 Difference]: Finished difference. Result has 175 places, 778 transitions, 8336 flow [2024-11-07 15:47:30,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8336, PETRI_PLACES=175, PETRI_TRANSITIONS=778} [2024-11-07 15:47:30,817 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 58 predicate places. [2024-11-07 15:47:30,817 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 778 transitions, 8336 flow [2024-11-07 15:47:30,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:30,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:30,818 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:47:30,818 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:47:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1645103095, now seen corresponding path program 1 times [2024-11-07 15:47:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:30,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625757540] [2024-11-07 15:47:30,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:30,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:47:30,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:47:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:47:30,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:47:30,847 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:47:30,847 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-07 15:47:30,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-07 15:47:30,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-07 15:47:30,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-07 15:47:30,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-07 15:47:30,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-07 15:47:30,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-07 15:47:30,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-07 15:47:30,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-07 15:47:30,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-07 15:47:30,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-07 15:47:30,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:47:30,848 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:30,848 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:47:30,848 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-07 15:47:30,865 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-07 15:47:30,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 138 transitions, 303 flow [2024-11-07 15:47:30,890 INFO L124 PetriNetUnfolderBase]: 21/368 cut-off events. [2024-11-07 15:47:30,890 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2024-11-07 15:47:30,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 368 events. 21/368 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1024 event pairs, 1 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 231. Up to 16 conditions per place. [2024-11-07 15:47:30,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 138 transitions, 303 flow [2024-11-07 15:47:30,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 138 transitions, 303 flow [2024-11-07 15:47:30,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:47:30,893 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;@bd2e796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:47:30,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-07 15:47:30,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:47:30,894 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-07 15:47:30,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:47:30,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:30,894 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:30,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-07 15:47:30,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:30,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1113706995, now seen corresponding path program 1 times [2024-11-07 15:47:30,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:30,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748913410] [2024-11-07 15:47:30,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:30,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:30,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:30,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748913410] [2024-11-07 15:47:30,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748913410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:30,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:30,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:47:30,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416583491] [2024-11-07 15:47:30,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:30,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:47:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:30,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:47:30,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:47:30,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-11-07 15:47:30,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:30,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:30,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-11-07 15:47:30,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:31,018 INFO L124 PetriNetUnfolderBase]: 90/1260 cut-off events. [2024-11-07 15:47:31,018 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-11-07 15:47:31,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1260 events. 90/1260 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8329 event pairs, 81 based on Foata normal form. 25/1116 useless extension candidates. Maximal degree in co-relation 877. Up to 178 conditions per place. [2024-11-07 15:47:31,024 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2024-11-07 15:47:31,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 327 flow [2024-11-07 15:47:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:47:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:47:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-11-07 15:47:31,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2024-11-07 15:47:31,025 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 303 flow. Second operand 3 states and 374 transitions. [2024-11-07 15:47:31,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 327 flow [2024-11-07 15:47:31,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:31,027 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 297 flow [2024-11-07 15:47:31,027 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2024-11-07 15:47:31,027 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 1 predicate places. [2024-11-07 15:47:31,027 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 297 flow [2024-11-07 15:47:31,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:31,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:31,028 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:31,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 15:47:31,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-07 15:47:31,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1671261316, now seen corresponding path program 1 times [2024-11-07 15:47:31,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043634151] [2024-11-07 15:47:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:31,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:31,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043634151] [2024-11-07 15:47:31,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043634151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:31,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:31,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:47:31,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968188235] [2024-11-07 15:47:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:31,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:47:31,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:31,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:47:31,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:47:31,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2024-11-07 15:47:31,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:31,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:31,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2024-11-07 15:47:31,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:31,194 INFO L124 PetriNetUnfolderBase]: 307/2452 cut-off events. [2024-11-07 15:47:31,194 INFO L125 PetriNetUnfolderBase]: For 239/264 co-relation queries the response was YES. [2024-11-07 15:47:31,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3073 conditions, 2452 events. 307/2452 cut-off events. For 239/264 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19851 event pairs, 214 based on Foata normal form. 0/2222 useless extension candidates. Maximal degree in co-relation 3039. Up to 507 conditions per place. [2024-11-07 15:47:31,204 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 17 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2024-11-07 15:47:31,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 355 flow [2024-11-07 15:47:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:47:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:47:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-11-07 15:47:31,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2024-11-07 15:47:31,205 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 297 flow. Second operand 3 states and 373 transitions. [2024-11-07 15:47:31,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 355 flow [2024-11-07 15:47:31,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:47:31,207 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 313 flow [2024-11-07 15:47:31,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2024-11-07 15:47:31,207 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, -3 predicate places. [2024-11-07 15:47:31,207 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 313 flow [2024-11-07 15:47:31,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:31,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:31,208 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:31,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 15:47:31,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-07 15:47:31,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:31,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1076870248, now seen corresponding path program 1 times [2024-11-07 15:47:31,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:31,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822827269] [2024-11-07 15:47:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:31,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:31,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822827269] [2024-11-07 15:47:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822827269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:31,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241700117] [2024-11-07 15:47:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:31,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:47:31,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:31,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:47:31,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:47:31,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 138 [2024-11-07 15:47:31,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:31,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:31,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 138 [2024-11-07 15:47:31,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:32,767 INFO L124 PetriNetUnfolderBase]: 10379/23786 cut-off events. [2024-11-07 15:47:32,767 INFO L125 PetriNetUnfolderBase]: For 1187/1187 co-relation queries the response was YES. [2024-11-07 15:47:32,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39831 conditions, 23786 events. 10379/23786 cut-off events. For 1187/1187 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 241511 event pairs, 6716 based on Foata normal form. 0/21792 useless extension candidates. Maximal degree in co-relation 32196. Up to 14165 conditions per place. [2024-11-07 15:47:32,925 INFO L140 encePairwiseOnDemand]: 119/138 looper letters, 37 selfloop transitions, 54 changer transitions 0/188 dead transitions. [2024-11-07 15:47:32,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 188 transitions, 617 flow [2024-11-07 15:47:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2024-11-07 15:47:32,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8285024154589372 [2024-11-07 15:47:32,927 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 313 flow. Second operand 6 states and 686 transitions. [2024-11-07 15:47:32,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 188 transitions, 617 flow [2024-11-07 15:47:32,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 188 transitions, 617 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:32,930 INFO L231 Difference]: Finished difference. Result has 146 places, 186 transitions, 671 flow [2024-11-07 15:47:32,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=671, PETRI_PLACES=146, PETRI_TRANSITIONS=186} [2024-11-07 15:47:32,931 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2024-11-07 15:47:32,931 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 186 transitions, 671 flow [2024-11-07 15:47:32,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:32,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:32,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:32,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:47:32,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-07 15:47:32,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1210831814, now seen corresponding path program 1 times [2024-11-07 15:47:32,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:32,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562604688] [2024-11-07 15:47:32,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:32,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:32,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:32,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562604688] [2024-11-07 15:47:32,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562604688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:32,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:32,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:32,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762131194] [2024-11-07 15:47:32,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:32,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:47:32,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:32,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:47:32,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:47:33,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-11-07 15:47:33,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 186 transitions, 671 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:33,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:33,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-11-07 15:47:33,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:33,739 INFO L124 PetriNetUnfolderBase]: 4742/12157 cut-off events. [2024-11-07 15:47:33,739 INFO L125 PetriNetUnfolderBase]: For 3135/3635 co-relation queries the response was YES. [2024-11-07 15:47:33,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23497 conditions, 12157 events. 4742/12157 cut-off events. For 3135/3635 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 114328 event pairs, 1822 based on Foata normal form. 2/11490 useless extension candidates. Maximal degree in co-relation 19222. Up to 5587 conditions per place. [2024-11-07 15:47:33,795 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 16 selfloop transitions, 2 changer transitions 5/192 dead transitions. [2024-11-07 15:47:33,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 192 transitions, 729 flow [2024-11-07 15:47:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2024-11-07 15:47:33,796 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2024-11-07 15:47:33,796 INFO L175 Difference]: Start difference. First operand has 146 places, 186 transitions, 671 flow. Second operand 6 states and 732 transitions. [2024-11-07 15:47:33,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 192 transitions, 729 flow [2024-11-07 15:47:33,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 192 transitions, 729 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:33,812 INFO L231 Difference]: Finished difference. Result has 155 places, 187 transitions, 693 flow [2024-11-07 15:47:33,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=155, PETRI_TRANSITIONS=187} [2024-11-07 15:47:33,812 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 16 predicate places. [2024-11-07 15:47:33,812 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 187 transitions, 693 flow [2024-11-07 15:47:33,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:33,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:33,813 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:33,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 15:47:33,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-07 15:47:33,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1389642421, now seen corresponding path program 1 times [2024-11-07 15:47:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:33,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504669413] [2024-11-07 15:47:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:47:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504669413] [2024-11-07 15:47:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504669413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091011566] [2024-11-07 15:47:33,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:33,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:47:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:33,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:47:33,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:47:34,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 138 [2024-11-07 15:47:34,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 187 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:34,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:34,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 138 [2024-11-07 15:47:34,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:36,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [88#L1022-7true, Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 171#true, 115#L1022-7true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 160#true, 138#true, 103#L1031-9true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-07 15:47:36,379 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-07 15:47:36,379 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-07 15:47:36,379 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-07 15:47:36,379 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-07 15:47:36,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 171#true, 115#L1022-7true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 78#L1022-8true, 160#true, 138#true, 103#L1031-9true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-07 15:47:36,536 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2024-11-07 15:47:36,537 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-07 15:47:36,537 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-07 15:47:36,537 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-07 15:47:36,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 171#true, 34#L1022-9true, 115#L1022-7true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 160#true, 138#true, 103#L1031-9true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-07 15:47:36,681 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-11-07 15:47:36,681 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-07 15:47:36,681 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-07 15:47:36,681 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-07 15:47:36,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 115#L1022-7true, 171#true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 160#true, 138#true, 103#L1031-9true, 93#L1022-10true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-07 15:47:36,807 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2024-11-07 15:47:36,807 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-07 15:47:36,807 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-07 15:47:36,807 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-07 15:47:39,656 INFO L124 PetriNetUnfolderBase]: 29047/67038 cut-off events. [2024-11-07 15:47:39,656 INFO L125 PetriNetUnfolderBase]: For 19554/23332 co-relation queries the response was YES. [2024-11-07 15:47:40,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151012 conditions, 67038 events. 29047/67038 cut-off events. For 19554/23332 co-relation queries the response was YES. Maximal size of possible extension queue 2164. Compared 771800 event pairs, 6939 based on Foata normal form. 87/61871 useless extension candidates. Maximal degree in co-relation 150909. Up to 28700 conditions per place. [2024-11-07 15:47:40,344 INFO L140 encePairwiseOnDemand]: 115/138 looper letters, 128 selfloop transitions, 118 changer transitions 0/349 dead transitions. [2024-11-07 15:47:40,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 349 transitions, 1957 flow [2024-11-07 15:47:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2024-11-07 15:47:40,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8973429951690821 [2024-11-07 15:47:40,346 INFO L175 Difference]: Start difference. First operand has 155 places, 187 transitions, 693 flow. Second operand 6 states and 743 transitions. [2024-11-07 15:47:40,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 349 transitions, 1957 flow [2024-11-07 15:47:40,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 349 transitions, 1945 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 15:47:40,451 INFO L231 Difference]: Finished difference. Result has 157 places, 304 transitions, 1754 flow [2024-11-07 15:47:40,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1754, PETRI_PLACES=157, PETRI_TRANSITIONS=304} [2024-11-07 15:47:40,452 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 18 predicate places. [2024-11-07 15:47:40,452 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 304 transitions, 1754 flow [2024-11-07 15:47:40,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:40,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:40,452 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:40,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 15:47:40,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-07 15:47:40,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:40,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1362260044, now seen corresponding path program 1 times [2024-11-07 15:47:40,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:40,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576450603] [2024-11-07 15:47:40,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 15:47:40,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576450603] [2024-11-07 15:47:40,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576450603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:47:40,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:47:40,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:47:40,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478396145] [2024-11-07 15:47:40,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:47:40,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:47:40,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:40,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:47:40,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:47:40,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 138 [2024-11-07 15:47:40,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 304 transitions, 1754 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:40,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:40,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 138 [2024-11-07 15:47:40,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:47:49,060 INFO L124 PetriNetUnfolderBase]: 35337/82836 cut-off events. [2024-11-07 15:47:49,060 INFO L125 PetriNetUnfolderBase]: For 74578/77386 co-relation queries the response was YES. [2024-11-07 15:47:49,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242202 conditions, 82836 events. 35337/82836 cut-off events. For 74578/77386 co-relation queries the response was YES. Maximal size of possible extension queue 2670. Compared 1002516 event pairs, 8904 based on Foata normal form. 186/77295 useless extension candidates. Maximal degree in co-relation 232468. Up to 43542 conditions per place. [2024-11-07 15:47:49,877 INFO L140 encePairwiseOnDemand]: 119/138 looper letters, 192 selfloop transitions, 110 changer transitions 0/412 dead transitions. [2024-11-07 15:47:49,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 412 transitions, 3086 flow [2024-11-07 15:47:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:47:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:47:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2024-11-07 15:47:49,878 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8417874396135265 [2024-11-07 15:47:49,878 INFO L175 Difference]: Start difference. First operand has 157 places, 304 transitions, 1754 flow. Second operand 6 states and 697 transitions. [2024-11-07 15:47:49,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 412 transitions, 3086 flow [2024-11-07 15:47:50,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 412 transitions, 3068 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-07 15:47:50,402 INFO L231 Difference]: Finished difference. Result has 167 places, 409 transitions, 2981 flow [2024-11-07 15:47:50,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2981, PETRI_PLACES=167, PETRI_TRANSITIONS=409} [2024-11-07 15:47:50,406 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 28 predicate places. [2024-11-07 15:47:50,407 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 409 transitions, 2981 flow [2024-11-07 15:47:50,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:50,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:47:50,407 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:47:50,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 15:47:50,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-07 15:47:50,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:47:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1695343455, now seen corresponding path program 1 times [2024-11-07 15:47:50,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:47:50,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560377143] [2024-11-07 15:47:50,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:50,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:47:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 15:47:50,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:47:50,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560377143] [2024-11-07 15:47:50,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560377143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:47:50,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698949913] [2024-11-07 15:47:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:47:50,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:47:50,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:47:50,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:47:50,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 15:47:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:47:50,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 15:47:50,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:47:50,796 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 [2024-11-07 15:47:50,805 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 15:47:50,805 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 [2024-11-07 15:47:50,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 15:47:50,889 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 28 treesize of output 27 [2024-11-07 15:47:50,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 15:47:50,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-07 15:47:50,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 15:47:50,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-07 15:47:51,022 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 56 treesize of output 45 [2024-11-07 15:47:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 15:47:51,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:47:51,053 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)))) is different from false [2024-11-07 15:47:51,158 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-07 15:47:51,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-07 15:47:51,192 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-07 15:47:51,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 15:47:51,209 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-07 15:47:51,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 15:47:51,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 35 [2024-11-07 15:47:51,223 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-07 15:47:51,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-07 15:47:51,228 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-07 15:47:51,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-07 15:47:51,231 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-07 15:47:51,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-07 15:47:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2024-11-07 15:47:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698949913] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:47:51,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:47:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-07 15:47:51,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098813846] [2024-11-07 15:47:51,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:47:51,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 15:47:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:47:51,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 15:47:51,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=124, Unknown=4, NotChecked=100, Total=272 [2024-11-07 15:47:51,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 138 [2024-11-07 15:47:51,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 409 transitions, 2981 flow. Second operand has 17 states, 17 states have (on average 76.29411764705883) internal successors, (1297), 17 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:47:51,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:47:51,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 138 [2024-11-07 15:47:51,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand