./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --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/weaver/chl-word-subst.wvr.c', '-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', '1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198'] 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/weaver/chl-word-subst.wvr.c -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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:43:09,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:43:09,411 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:43:09,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:43:09,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:43:09,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:43:09,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:43:09,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:43:09,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:43:09,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:43:09,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:43:09,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:43:09,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:43:09,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:43:09,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:43:09,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:43:09,461 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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2024-11-07 15:43:09,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:43:09,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:43:09,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:43:09,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:43:09,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:43:09,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-11-07 15:43:11,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:43:11,252 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:43:11,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-11-07 15:43:11,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dc881612/abdb6c2dc3904e21bcf8c65f32f58cf8/FLAG3b6af526e [2024-11-07 15:43:11,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dc881612/abdb6c2dc3904e21bcf8c65f32f58cf8 [2024-11-07 15:43:11,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:43:11,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:43:11,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:43:11,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:43:11,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:43:11,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694ba27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11, skipping insertion in model container [2024-11-07 15:43:11,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:43:11,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:43:11,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:43:11,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:43:11,841 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:43:11,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11 WrapperNode [2024-11-07 15:43:11,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:43:11,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:43:11,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:43:11,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:43:11,848 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:43:11" (1/1) ... [2024-11-07 15:43:11,858 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:43:11" (1/1) ... [2024-11-07 15:43:11,878 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 248 [2024-11-07 15:43:11,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:43:11,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:43:11,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:43:11,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:43:11,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:43:11,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:43:11,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:43:11,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:43:11,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11" (1/1) ... [2024-11-07 15:43:11,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:43:11,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:43:11,957 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:43:11,964 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:43:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:43:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 15:43:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 15:43:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 15:43:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 15:43:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-07 15:43:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-07 15:43:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:43:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:43:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:43:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:43:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:43:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:43:11,996 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:43:12,123 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:43:12,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:43:12,755 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:43:12,755 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:43:12,776 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:43:12,776 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-07 15:43:12,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:43:12 BoogieIcfgContainer [2024-11-07 15:43:12,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:43:12,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:43:12,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:43:12,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:43:12,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:43:11" (1/3) ... [2024-11-07 15:43:12,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a523648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:43:12, skipping insertion in model container [2024-11-07 15:43:12,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:43:11" (2/3) ... [2024-11-07 15:43:12,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a523648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:43:12, skipping insertion in model container [2024-11-07 15:43:12,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:43:12" (3/3) ... [2024-11-07 15:43:12,786 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2024-11-07 15:43:12,797 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:43:12,798 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2024-11-07 15:43:12,798 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:43:12,915 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-07 15:43:12,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 632 places, 655 transitions, 1331 flow [2024-11-07 15:43:13,128 INFO L124 PetriNetUnfolderBase]: 33/652 cut-off events. [2024-11-07 15:43:13,130 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:43:13,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 652 events. 33/652 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1718 event pairs, 0 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 493. Up to 3 conditions per place. [2024-11-07 15:43:13,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 632 places, 655 transitions, 1331 flow [2024-11-07 15:43:13,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 611 places, 632 transitions, 1282 flow [2024-11-07 15:43:13,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:43:13,192 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;@764c8bdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:43:13,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2024-11-07 15:43:13,201 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:43:13,205 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-07 15:43:13,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:43:13,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:13,206 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] [2024-11-07 15:43:13,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:13,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:13,213 INFO L85 PathProgramCache]: Analyzing trace with hash 452336704, now seen corresponding path program 1 times [2024-11-07 15:43:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:13,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272897345] [2024-11-07 15:43:13,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:13,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:43:13,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:13,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272897345] [2024-11-07 15:43:13,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272897345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:13,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:13,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323441534] [2024-11-07 15:43:13,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:13,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:13,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:13,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:13,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:13,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-07 15:43:13,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 632 transitions, 1282 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:13,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:13,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-07 15:43:13,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:13,737 INFO L124 PetriNetUnfolderBase]: 78/1518 cut-off events. [2024-11-07 15:43:13,737 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-07 15:43:13,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1518 events. 78/1518 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9253 event pairs, 20 based on Foata normal form. 30/1249 useless extension candidates. Maximal degree in co-relation 1200. Up to 50 conditions per place. [2024-11-07 15:43:13,760 INFO L140 encePairwiseOnDemand]: 639/655 looper letters, 13 selfloop transitions, 2 changer transitions 7/618 dead transitions. [2024-11-07 15:43:13,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 618 transitions, 1284 flow [2024-11-07 15:43:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1898 transitions. [2024-11-07 15:43:13,775 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659033078880407 [2024-11-07 15:43:13,776 INFO L175 Difference]: Start difference. First operand has 611 places, 632 transitions, 1282 flow. Second operand 3 states and 1898 transitions. [2024-11-07 15:43:13,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 618 transitions, 1284 flow [2024-11-07 15:43:13,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 618 transitions, 1272 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 15:43:13,789 INFO L231 Difference]: Finished difference. Result has 606 places, 611 transitions, 1232 flow [2024-11-07 15:43:13,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=606, PETRI_TRANSITIONS=611} [2024-11-07 15:43:13,793 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -5 predicate places. [2024-11-07 15:43:13,794 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 611 transitions, 1232 flow [2024-11-07 15:43:13,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:13,795 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:13,795 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] [2024-11-07 15:43:13,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:43:13,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:13,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2119054710, now seen corresponding path program 1 times [2024-11-07 15:43:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833174010] [2024-11-07 15:43:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:13,840 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:43:13,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:13,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833174010] [2024-11-07 15:43:13,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833174010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:13,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:13,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:13,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740876642] [2024-11-07 15:43:13,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:13,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:13,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:13,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:13,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:13,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-07 15:43:13,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 611 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:13,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:13,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-07 15:43:13,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:14,071 INFO L124 PetriNetUnfolderBase]: 50/1054 cut-off events. [2024-11-07 15:43:14,071 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:43:14,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1054 events. 50/1054 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5195 event pairs, 12 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1068. Up to 38 conditions per place. [2024-11-07 15:43:14,090 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/610 dead transitions. [2024-11-07 15:43:14,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 610 transitions, 1260 flow [2024-11-07 15:43:14,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-07 15:43:14,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-07 15:43:14,097 INFO L175 Difference]: Start difference. First operand has 606 places, 611 transitions, 1232 flow. Second operand 3 states and 1885 transitions. [2024-11-07 15:43:14,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 610 transitions, 1260 flow [2024-11-07 15:43:14,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 610 transitions, 1256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:14,107 INFO L231 Difference]: Finished difference. Result has 598 places, 610 transitions, 1230 flow [2024-11-07 15:43:14,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=598, PETRI_TRANSITIONS=610} [2024-11-07 15:43:14,109 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -13 predicate places. [2024-11-07 15:43:14,109 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 610 transitions, 1230 flow [2024-11-07 15:43:14,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:14,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:14,110 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] [2024-11-07 15:43:14,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:43:14,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:14,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1745260268, now seen corresponding path program 1 times [2024-11-07 15:43:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:14,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662881440] [2024-11-07 15:43:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:14,149 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:43:14,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:14,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662881440] [2024-11-07 15:43:14,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662881440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:14,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:14,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52030849] [2024-11-07 15:43:14,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:14,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:14,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:14,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:14,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-07 15:43:14,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 610 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:14,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:14,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-07 15:43:14,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:14,418 INFO L124 PetriNetUnfolderBase]: 78/1485 cut-off events. [2024-11-07 15:43:14,418 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-11-07 15:43:14,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 1485 events. 78/1485 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8424 event pairs, 20 based on Foata normal form. 0/1206 useless extension candidates. Maximal degree in co-relation 1501. Up to 50 conditions per place. [2024-11-07 15:43:14,433 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2024-11-07 15:43:14,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 609 transitions, 1258 flow [2024-11-07 15:43:14,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-07 15:43:14,437 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-07 15:43:14,437 INFO L175 Difference]: Start difference. First operand has 598 places, 610 transitions, 1230 flow. Second operand 3 states and 1885 transitions. [2024-11-07 15:43:14,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 609 transitions, 1258 flow [2024-11-07 15:43:14,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 609 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:14,443 INFO L231 Difference]: Finished difference. Result has 597 places, 609 transitions, 1228 flow [2024-11-07 15:43:14,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=597, PETRI_TRANSITIONS=609} [2024-11-07 15:43:14,444 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2024-11-07 15:43:14,444 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 609 transitions, 1228 flow [2024-11-07 15:43:14,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:14,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:14,445 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:43:14,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:43:14,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:14,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1138626604, now seen corresponding path program 1 times [2024-11-07 15:43:14,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:14,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167303121] [2024-11-07 15:43:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:14,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:14,483 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:43:14,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:14,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167303121] [2024-11-07 15:43:14,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167303121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:14,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:14,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:14,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787561916] [2024-11-07 15:43:14,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:14,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:14,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:14,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:14,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:14,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-11-07 15:43:14,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 609 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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:43:14,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:14,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-11-07 15:43:14,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:14,834 INFO L124 PetriNetUnfolderBase]: 88/1786 cut-off events. [2024-11-07 15:43:14,834 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:43:14,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1856 conditions, 1786 events. 88/1786 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11593 event pairs, 20 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 1803. Up to 51 conditions per place. [2024-11-07 15:43:14,863 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/608 dead transitions. [2024-11-07 15:43:14,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 608 transitions, 1258 flow [2024-11-07 15:43:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-11-07 15:43:14,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-11-07 15:43:14,867 INFO L175 Difference]: Start difference. First operand has 597 places, 609 transitions, 1228 flow. Second operand 3 states and 1883 transitions. [2024-11-07 15:43:14,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 608 transitions, 1258 flow [2024-11-07 15:43:14,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 608 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:14,875 INFO L231 Difference]: Finished difference. Result has 596 places, 608 transitions, 1226 flow [2024-11-07 15:43:14,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=596, PETRI_TRANSITIONS=608} [2024-11-07 15:43:14,876 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -15 predicate places. [2024-11-07 15:43:14,876 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 608 transitions, 1226 flow [2024-11-07 15:43:14,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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:43:14,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:14,877 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:14,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:43:14,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:14,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:14,878 INFO L85 PathProgramCache]: Analyzing trace with hash -392882240, now seen corresponding path program 1 times [2024-11-07 15:43:14,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:14,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282156155] [2024-11-07 15:43:14,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:14,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:14,918 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:43:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:14,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282156155] [2024-11-07 15:43:14,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282156155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:14,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:14,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:14,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111756590] [2024-11-07 15:43:14,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:14,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:14,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:14,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:14,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:14,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-11-07 15:43:14,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 608 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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:43:14,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:14,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-11-07 15:43:14,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:15,119 INFO L124 PetriNetUnfolderBase]: 50/1089 cut-off events. [2024-11-07 15:43:15,119 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-07 15:43:15,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 1089 events. 50/1089 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5540 event pairs, 12 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1080. Up to 39 conditions per place. [2024-11-07 15:43:15,134 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2024-11-07 15:43:15,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 607 transitions, 1256 flow [2024-11-07 15:43:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-11-07 15:43:15,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-11-07 15:43:15,137 INFO L175 Difference]: Start difference. First operand has 596 places, 608 transitions, 1226 flow. Second operand 3 states and 1883 transitions. [2024-11-07 15:43:15,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 607 transitions, 1256 flow [2024-11-07 15:43:15,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 607 transitions, 1252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:15,144 INFO L231 Difference]: Finished difference. Result has 595 places, 607 transitions, 1224 flow [2024-11-07 15:43:15,145 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1224, PETRI_PLACES=595, PETRI_TRANSITIONS=607} [2024-11-07 15:43:15,147 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -16 predicate places. [2024-11-07 15:43:15,148 INFO L471 AbstractCegarLoop]: Abstraction has has 595 places, 607 transitions, 1224 flow [2024-11-07 15:43:15,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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:43:15,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:15,149 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:15,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:43:15,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:15,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1194727645, now seen corresponding path program 1 times [2024-11-07 15:43:15,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139074232] [2024-11-07 15:43:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:15,203 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:43:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:15,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139074232] [2024-11-07 15:43:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139074232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:15,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:15,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729120662] [2024-11-07 15:43:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:15,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:15,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:15,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-11-07 15:43:15,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 607 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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:43:15,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:15,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-11-07 15:43:15,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:15,343 INFO L124 PetriNetUnfolderBase]: 48/866 cut-off events. [2024-11-07 15:43:15,344 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-07 15:43:15,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 866 events. 48/866 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3777 event pairs, 20 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 859. Up to 51 conditions per place. [2024-11-07 15:43:15,360 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2024-11-07 15:43:15,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 606 transitions, 1254 flow [2024-11-07 15:43:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-11-07 15:43:15,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-11-07 15:43:15,364 INFO L175 Difference]: Start difference. First operand has 595 places, 607 transitions, 1224 flow. Second operand 3 states and 1883 transitions. [2024-11-07 15:43:15,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 606 transitions, 1254 flow [2024-11-07 15:43:15,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 606 transitions, 1250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:15,371 INFO L231 Difference]: Finished difference. Result has 594 places, 606 transitions, 1222 flow [2024-11-07 15:43:15,371 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=594, PETRI_TRANSITIONS=606} [2024-11-07 15:43:15,372 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -17 predicate places. [2024-11-07 15:43:15,372 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 606 transitions, 1222 flow [2024-11-07 15:43:15,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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:43:15,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:15,374 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:15,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:43:15,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:15,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:15,374 INFO L85 PathProgramCache]: Analyzing trace with hash -420121175, now seen corresponding path program 1 times [2024-11-07 15:43:15,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:15,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051222925] [2024-11-07 15:43:15,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:15,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:15,417 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:43:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051222925] [2024-11-07 15:43:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051222925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:15,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363676886] [2024-11-07 15:43:15,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:15,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:15,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:15,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:15,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-11-07 15:43:15,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 606 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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:43:15,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:15,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-11-07 15:43:15,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:15,696 INFO L124 PetriNetUnfolderBase]: 165/2324 cut-off events. [2024-11-07 15:43:15,696 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2024-11-07 15:43:15,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 2324 events. 165/2324 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 17869 event pairs, 64 based on Foata normal form. 0/1904 useless extension candidates. Maximal degree in co-relation 2435. Up to 151 conditions per place. [2024-11-07 15:43:15,729 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/601 dead transitions. [2024-11-07 15:43:15,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 601 transitions, 1246 flow [2024-11-07 15:43:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-11-07 15:43:15,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-11-07 15:43:15,732 INFO L175 Difference]: Start difference. First operand has 594 places, 606 transitions, 1222 flow. Second operand 3 states and 1876 transitions. [2024-11-07 15:43:15,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 601 transitions, 1246 flow [2024-11-07 15:43:15,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 601 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:15,738 INFO L231 Difference]: Finished difference. Result has 589 places, 601 transitions, 1210 flow [2024-11-07 15:43:15,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=589, PETRI_TRANSITIONS=601} [2024-11-07 15:43:15,739 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-11-07 15:43:15,739 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 601 transitions, 1210 flow [2024-11-07 15:43:15,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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:43:15,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:15,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:15,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:43:15,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:15,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:15,741 INFO L85 PathProgramCache]: Analyzing trace with hash 237991042, now seen corresponding path program 1 times [2024-11-07 15:43:15,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:15,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804423709] [2024-11-07 15:43:15,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:15,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:15,799 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:43:15,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804423709] [2024-11-07 15:43:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804423709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151842464] [2024-11-07 15:43:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:15,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:15,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-07 15:43:15,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 601 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:15,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:15,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-07 15:43:15,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:16,046 INFO L124 PetriNetUnfolderBase]: 88/1774 cut-off events. [2024-11-07 15:43:16,047 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-07 15:43:16,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1774 events. 88/1774 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10573 event pairs, 20 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 1765. Up to 50 conditions per place. [2024-11-07 15:43:16,063 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2024-11-07 15:43:16,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 600 transitions, 1238 flow [2024-11-07 15:43:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-07 15:43:16,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-07 15:43:16,065 INFO L175 Difference]: Start difference. First operand has 589 places, 601 transitions, 1210 flow. Second operand 3 states and 1885 transitions. [2024-11-07 15:43:16,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 600 transitions, 1238 flow [2024-11-07 15:43:16,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 600 transitions, 1237 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:43:16,071 INFO L231 Difference]: Finished difference. Result has 589 places, 600 transitions, 1211 flow [2024-11-07 15:43:16,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=589, PETRI_TRANSITIONS=600} [2024-11-07 15:43:16,074 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-11-07 15:43:16,074 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 600 transitions, 1211 flow [2024-11-07 15:43:16,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:16,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:16,076 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:16,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:43:16,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:16,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash 233819493, now seen corresponding path program 1 times [2024-11-07 15:43:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:16,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099452851] [2024-11-07 15:43:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:16,658 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:43:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099452851] [2024-11-07 15:43:16,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099452851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:16,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:16,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:43:16,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520490366] [2024-11-07 15:43:16,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:16,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:43:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:43:16,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:43:17,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 655 [2024-11-07 15:43:17,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 600 transitions, 1211 flow. Second operand has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 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:43:17,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:17,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 655 [2024-11-07 15:43:17,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:23,426 INFO L124 PetriNetUnfolderBase]: 12845/49235 cut-off events. [2024-11-07 15:43:23,427 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-07 15:43:23,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66718 conditions, 49235 events. 12845/49235 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 647538 event pairs, 10080 based on Foata normal form. 0/40940 useless extension candidates. Maximal degree in co-relation 66642. Up to 17156 conditions per place. [2024-11-07 15:43:23,774 INFO L140 encePairwiseOnDemand]: 637/655 looper letters, 78 selfloop transitions, 15 changer transitions 0/597 dead transitions. [2024-11-07 15:43:23,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 597 transitions, 1391 flow [2024-11-07 15:43:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:43:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:43:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3360 transitions. [2024-11-07 15:43:23,782 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8549618320610687 [2024-11-07 15:43:23,783 INFO L175 Difference]: Start difference. First operand has 589 places, 600 transitions, 1211 flow. Second operand 6 states and 3360 transitions. [2024-11-07 15:43:23,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 597 transitions, 1391 flow [2024-11-07 15:43:23,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 597 transitions, 1387 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:23,788 INFO L231 Difference]: Finished difference. Result has 589 places, 597 transitions, 1231 flow [2024-11-07 15:43:23,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1231, PETRI_PLACES=589, PETRI_TRANSITIONS=597} [2024-11-07 15:43:23,790 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-11-07 15:43:23,790 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 597 transitions, 1231 flow [2024-11-07 15:43:23,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 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:43:23,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:23,792 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:23,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:43:23,792 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:23,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:23,793 INFO L85 PathProgramCache]: Analyzing trace with hash -895861133, now seen corresponding path program 1 times [2024-11-07 15:43:23,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:23,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065871304] [2024-11-07 15:43:23,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:23,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:23,845 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:43:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:23,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065871304] [2024-11-07 15:43:23,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065871304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:23,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:23,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:23,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802858371] [2024-11-07 15:43:23,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:23,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:23,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:23,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:23,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-11-07 15:43:23,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 597 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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:43:23,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:23,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-11-07 15:43:23,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:24,050 INFO L124 PetriNetUnfolderBase]: 113/1699 cut-off events. [2024-11-07 15:43:24,051 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-11-07 15:43:24,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 1699 events. 113/1699 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 11076 event pairs, 32 based on Foata normal form. 0/1418 useless extension candidates. Maximal degree in co-relation 1784. Up to 102 conditions per place. [2024-11-07 15:43:24,081 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/592 dead transitions. [2024-11-07 15:43:24,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 592 transitions, 1255 flow [2024-11-07 15:43:24,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-11-07 15:43:24,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-11-07 15:43:24,084 INFO L175 Difference]: Start difference. First operand has 589 places, 597 transitions, 1231 flow. Second operand 3 states and 1876 transitions. [2024-11-07 15:43:24,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 592 transitions, 1255 flow [2024-11-07 15:43:24,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 592 transitions, 1225 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:43:24,091 INFO L231 Difference]: Finished difference. Result has 581 places, 592 transitions, 1193 flow [2024-11-07 15:43:24,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1193, PETRI_PLACES=581, PETRI_TRANSITIONS=592} [2024-11-07 15:43:24,092 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2024-11-07 15:43:24,093 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 592 transitions, 1193 flow [2024-11-07 15:43:24,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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:43:24,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:24,094 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:24,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:43:24,094 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:24,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:24,094 INFO L85 PathProgramCache]: Analyzing trace with hash -467743023, now seen corresponding path program 1 times [2024-11-07 15:43:24,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:24,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75716961] [2024-11-07 15:43:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:43:24,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:24,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75716961] [2024-11-07 15:43:24,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75716961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:24,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:24,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:24,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935826643] [2024-11-07 15:43:24,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:24,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:24,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:24,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:24,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-07 15:43:24,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 592 transitions, 1193 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:24,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:24,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-07 15:43:24,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:24,310 INFO L124 PetriNetUnfolderBase]: 50/1065 cut-off events. [2024-11-07 15:43:24,310 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-07 15:43:24,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1065 events. 50/1065 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4830 event pairs, 12 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2024-11-07 15:43:24,323 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/591 dead transitions. [2024-11-07 15:43:24,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 591 transitions, 1221 flow [2024-11-07 15:43:24,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-07 15:43:24,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-07 15:43:24,326 INFO L175 Difference]: Start difference. First operand has 581 places, 592 transitions, 1193 flow. Second operand 3 states and 1885 transitions. [2024-11-07 15:43:24,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 591 transitions, 1221 flow [2024-11-07 15:43:24,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 591 transitions, 1220 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:43:24,334 INFO L231 Difference]: Finished difference. Result has 581 places, 591 transitions, 1194 flow [2024-11-07 15:43:24,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1194, PETRI_PLACES=581, PETRI_TRANSITIONS=591} [2024-11-07 15:43:24,336 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2024-11-07 15:43:24,336 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 591 transitions, 1194 flow [2024-11-07 15:43:24,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:24,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:24,337 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:24,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:43:24,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:24,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash 164645723, now seen corresponding path program 1 times [2024-11-07 15:43:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:24,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480327153] [2024-11-07 15:43:24,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:24,385 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:43:24,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:24,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480327153] [2024-11-07 15:43:24,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480327153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:24,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:24,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618879240] [2024-11-07 15:43:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:24,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:24,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:24,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:24,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-11-07 15:43:24,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 591 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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:43:24,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:24,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-11-07 15:43:24,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:24,601 INFO L124 PetriNetUnfolderBase]: 166/1874 cut-off events. [2024-11-07 15:43:24,601 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2024-11-07 15:43:24,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 1874 events. 166/1874 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 12465 event pairs, 64 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1981. Up to 169 conditions per place. [2024-11-07 15:43:24,633 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/586 dead transitions. [2024-11-07 15:43:24,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 586 transitions, 1218 flow [2024-11-07 15:43:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-11-07 15:43:24,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-11-07 15:43:24,636 INFO L175 Difference]: Start difference. First operand has 581 places, 591 transitions, 1194 flow. Second operand 3 states and 1876 transitions. [2024-11-07 15:43:24,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 586 transitions, 1218 flow [2024-11-07 15:43:24,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 586 transitions, 1214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:24,641 INFO L231 Difference]: Finished difference. Result has 576 places, 586 transitions, 1182 flow [2024-11-07 15:43:24,642 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1182, PETRI_PLACES=576, PETRI_TRANSITIONS=586} [2024-11-07 15:43:24,643 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2024-11-07 15:43:24,643 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 586 transitions, 1182 flow [2024-11-07 15:43:24,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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:43:24,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:24,644 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:24,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:43:24,644 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:24,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:24,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1782534799, now seen corresponding path program 1 times [2024-11-07 15:43:24,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:24,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879222958] [2024-11-07 15:43:24,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:24,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:24,686 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:43:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:24,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879222958] [2024-11-07 15:43:24,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879222958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:24,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:24,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508576402] [2024-11-07 15:43:24,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:24,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:24,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:24,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:24,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:24,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-07 15:43:24,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 586 transitions, 1182 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:24,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:24,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-07 15:43:24,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:24,799 INFO L124 PetriNetUnfolderBase]: 48/837 cut-off events. [2024-11-07 15:43:24,799 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-07 15:43:24,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 837 events. 48/837 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3270 event pairs, 20 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2024-11-07 15:43:24,809 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-11-07 15:43:24,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 585 transitions, 1210 flow [2024-11-07 15:43:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-07 15:43:24,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-07 15:43:24,813 INFO L175 Difference]: Start difference. First operand has 576 places, 586 transitions, 1182 flow. Second operand 3 states and 1885 transitions. [2024-11-07 15:43:24,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 585 transitions, 1210 flow [2024-11-07 15:43:24,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 585 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:43:24,818 INFO L231 Difference]: Finished difference. Result has 576 places, 585 transitions, 1183 flow [2024-11-07 15:43:24,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=576, PETRI_TRANSITIONS=585} [2024-11-07 15:43:24,819 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2024-11-07 15:43:24,819 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 585 transitions, 1183 flow [2024-11-07 15:43:24,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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:43:24,820 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:24,820 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:24,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:43:24,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:24,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash 286688870, now seen corresponding path program 1 times [2024-11-07 15:43:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:24,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233128593] [2024-11-07 15:43:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:24,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:24,858 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:43:24,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:24,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233128593] [2024-11-07 15:43:24,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233128593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:24,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:24,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:24,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634829436] [2024-11-07 15:43:24,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:24,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:24,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:24,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:24,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:24,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-07 15:43:24,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 585 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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:43:24,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:24,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-07 15:43:24,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:25,078 INFO L124 PetriNetUnfolderBase]: 157/2220 cut-off events. [2024-11-07 15:43:25,078 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 15:43:25,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 2220 events. 157/2220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16956 event pairs, 53 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 2309. Up to 123 conditions per place. [2024-11-07 15:43:25,109 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-11-07 15:43:25,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 585 transitions, 1223 flow [2024-11-07 15:43:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-11-07 15:43:25,112 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-11-07 15:43:25,112 INFO L175 Difference]: Start difference. First operand has 576 places, 585 transitions, 1183 flow. Second operand 3 states and 1886 transitions. [2024-11-07 15:43:25,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 585 transitions, 1223 flow [2024-11-07 15:43:25,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 585 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:25,122 INFO L231 Difference]: Finished difference. Result has 573 places, 583 transitions, 1185 flow [2024-11-07 15:43:25,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1185, PETRI_PLACES=573, PETRI_TRANSITIONS=583} [2024-11-07 15:43:25,124 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -38 predicate places. [2024-11-07 15:43:25,124 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 583 transitions, 1185 flow [2024-11-07 15:43:25,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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:43:25,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:25,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:43:25,125 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:25,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash 630144488, now seen corresponding path program 1 times [2024-11-07 15:43:25,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:25,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308147756] [2024-11-07 15:43:25,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:25,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:25,177 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:43:25,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:25,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308147756] [2024-11-07 15:43:25,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308147756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:25,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:25,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:25,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783894636] [2024-11-07 15:43:25,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:25,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:25,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:25,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:25,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:25,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-07 15:43:25,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 583 transitions, 1185 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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:43:25,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:25,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-07 15:43:25,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:25,364 INFO L124 PetriNetUnfolderBase]: 96/1534 cut-off events. [2024-11-07 15:43:25,364 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-07 15:43:25,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1534 events. 96/1534 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9615 event pairs, 20 based on Foata normal form. 0/1315 useless extension candidates. Maximal degree in co-relation 1559. Up to 75 conditions per place. [2024-11-07 15:43:25,391 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-11-07 15:43:25,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 583 transitions, 1225 flow [2024-11-07 15:43:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-11-07 15:43:25,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-11-07 15:43:25,394 INFO L175 Difference]: Start difference. First operand has 573 places, 583 transitions, 1185 flow. Second operand 3 states and 1886 transitions. [2024-11-07 15:43:25,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 583 transitions, 1225 flow [2024-11-07 15:43:25,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 583 transitions, 1225 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:43:25,400 INFO L231 Difference]: Finished difference. Result has 572 places, 581 transitions, 1191 flow [2024-11-07 15:43:25,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=572, PETRI_TRANSITIONS=581} [2024-11-07 15:43:25,402 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-11-07 15:43:25,402 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 581 transitions, 1191 flow [2024-11-07 15:43:25,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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:43:25,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:25,403 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:25,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:43:25,403 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:25,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash -69708871, now seen corresponding path program 1 times [2024-11-07 15:43:25,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:25,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132538483] [2024-11-07 15:43:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:25,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:25,478 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:43:25,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:25,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132538483] [2024-11-07 15:43:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132538483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:25,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:25,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659513125] [2024-11-07 15:43:25,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:25,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:25,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:25,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:25,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-07 15:43:25,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 581 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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:43:25,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:25,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-07 15:43:25,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:25,787 INFO L124 PetriNetUnfolderBase]: 250/3267 cut-off events. [2024-11-07 15:43:25,788 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-11-07 15:43:25,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 3267 events. 250/3267 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 28606 event pairs, 52 based on Foata normal form. 1/2784 useless extension candidates. Maximal degree in co-relation 3426. Up to 202 conditions per place. [2024-11-07 15:43:25,824 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/581 dead transitions. [2024-11-07 15:43:25,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 581 transitions, 1231 flow [2024-11-07 15:43:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-11-07 15:43:25,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-11-07 15:43:25,827 INFO L175 Difference]: Start difference. First operand has 572 places, 581 transitions, 1191 flow. Second operand 3 states and 1886 transitions. [2024-11-07 15:43:25,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 581 transitions, 1231 flow [2024-11-07 15:43:25,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 581 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:43:25,833 INFO L231 Difference]: Finished difference. Result has 571 places, 579 transitions, 1197 flow [2024-11-07 15:43:25,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=571, PETRI_TRANSITIONS=579} [2024-11-07 15:43:25,833 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-11-07 15:43:25,834 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 579 transitions, 1197 flow [2024-11-07 15:43:25,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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:43:25,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:25,838 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:25,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:43:25,839 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:25,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:25,839 INFO L85 PathProgramCache]: Analyzing trace with hash 911023066, now seen corresponding path program 1 times [2024-11-07 15:43:25,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:25,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97935564] [2024-11-07 15:43:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:25,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:25,881 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:43:25,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:25,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97935564] [2024-11-07 15:43:25,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97935564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:25,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:25,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:25,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011068474] [2024-11-07 15:43:25,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:25,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:25,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:25,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:25,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:25,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-07 15:43:25,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 579 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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:43:25,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:25,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-07 15:43:25,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:26,102 INFO L124 PetriNetUnfolderBase]: 108/2057 cut-off events. [2024-11-07 15:43:26,102 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-11-07 15:43:26,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 2057 events. 108/2057 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13449 event pairs, 8 based on Foata normal form. 1/1770 useless extension candidates. Maximal degree in co-relation 2089. Up to 33 conditions per place. [2024-11-07 15:43:26,128 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-07 15:43:26,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 580 transitions, 1231 flow [2024-11-07 15:43:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-07 15:43:26,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638676844783715 [2024-11-07 15:43:26,131 INFO L175 Difference]: Start difference. First operand has 571 places, 579 transitions, 1197 flow. Second operand 3 states and 1894 transitions. [2024-11-07 15:43:26,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 580 transitions, 1231 flow [2024-11-07 15:43:26,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 580 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:43:26,137 INFO L231 Difference]: Finished difference. Result has 572 places, 578 transitions, 1199 flow [2024-11-07 15:43:26,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=572, PETRI_TRANSITIONS=578} [2024-11-07 15:43:26,138 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-11-07 15:43:26,138 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 578 transitions, 1199 flow [2024-11-07 15:43:26,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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:43:26,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:26,139 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:26,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:43:26,139 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:26,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash 44543776, now seen corresponding path program 1 times [2024-11-07 15:43:26,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:26,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027901857] [2024-11-07 15:43:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:26,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:26,209 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:43:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:26,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027901857] [2024-11-07 15:43:26,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027901857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:26,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:26,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:43:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307129044] [2024-11-07 15:43:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:26,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:26,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:26,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:26,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-07 15:43:26,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 578 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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:43:26,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:26,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-07 15:43:26,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:26,376 INFO L124 PetriNetUnfolderBase]: 89/1589 cut-off events. [2024-11-07 15:43:26,376 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-07 15:43:26,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 1589 events. 89/1589 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10195 event pairs, 12 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 1664. Up to 40 conditions per place. [2024-11-07 15:43:26,404 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/581 dead transitions. [2024-11-07 15:43:26,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 581 transitions, 1241 flow [2024-11-07 15:43:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-07 15:43:26,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-07 15:43:26,407 INFO L175 Difference]: Start difference. First operand has 572 places, 578 transitions, 1199 flow. Second operand 3 states and 1896 transitions. [2024-11-07 15:43:26,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 581 transitions, 1241 flow [2024-11-07 15:43:26,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 581 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:26,422 INFO L231 Difference]: Finished difference. Result has 574 places, 579 transitions, 1213 flow [2024-11-07 15:43:26,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=574, PETRI_TRANSITIONS=579} [2024-11-07 15:43:26,424 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -37 predicate places. [2024-11-07 15:43:26,424 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 579 transitions, 1213 flow [2024-11-07 15:43:26,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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:43:26,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:26,425 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:26,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:43:26,425 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:26,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:26,426 INFO L85 PathProgramCache]: Analyzing trace with hash 578733025, now seen corresponding path program 1 times [2024-11-07 15:43:26,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:26,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862489917] [2024-11-07 15:43:26,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:26,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:26,483 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:43:26,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:26,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862489917] [2024-11-07 15:43:26,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862489917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:26,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:26,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:26,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149136968] [2024-11-07 15:43:26,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:26,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:26,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:26,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:26,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:26,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-07 15:43:26,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 579 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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:43:26,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:26,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-07 15:43:26,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:26,864 INFO L124 PetriNetUnfolderBase]: 197/2613 cut-off events. [2024-11-07 15:43:26,864 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-11-07 15:43:26,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 2613 events. 197/2613 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 19808 event pairs, 24 based on Foata normal form. 0/2267 useless extension candidates. Maximal degree in co-relation 2827. Up to 168 conditions per place. [2024-11-07 15:43:26,918 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 20 selfloop transitions, 2 changer transitions 0/582 dead transitions. [2024-11-07 15:43:26,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 582 transitions, 1268 flow [2024-11-07 15:43:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-07 15:43:26,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-07 15:43:26,921 INFO L175 Difference]: Start difference. First operand has 574 places, 579 transitions, 1213 flow. Second operand 3 states and 1889 transitions. [2024-11-07 15:43:26,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 582 transitions, 1268 flow [2024-11-07 15:43:26,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 582 transitions, 1262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:26,930 INFO L231 Difference]: Finished difference. Result has 571 places, 577 transitions, 1213 flow [2024-11-07 15:43:26,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=577} [2024-11-07 15:43:26,931 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-11-07 15:43:26,931 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 577 transitions, 1213 flow [2024-11-07 15:43:26,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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:43:26,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:26,932 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:26,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 15:43:26,933 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:26,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1172048154, now seen corresponding path program 1 times [2024-11-07 15:43:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:26,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903863560] [2024-11-07 15:43:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:26,986 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:43:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903863560] [2024-11-07 15:43:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903863560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:26,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:26,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:26,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206788613] [2024-11-07 15:43:26,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:26,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:26,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:26,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:27,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-07 15:43:27,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 577 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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:43:27,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:27,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-07 15:43:27,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:27,359 INFO L124 PetriNetUnfolderBase]: 169/2812 cut-off events. [2024-11-07 15:43:27,360 INFO L125 PetriNetUnfolderBase]: For 20/59 co-relation queries the response was YES. [2024-11-07 15:43:27,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 2812 events. 169/2812 cut-off events. For 20/59 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 20819 event pairs, 19 based on Foata normal form. 0/2415 useless extension candidates. Maximal degree in co-relation 2941. Up to 72 conditions per place. [2024-11-07 15:43:27,402 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2024-11-07 15:43:27,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 578 transitions, 1249 flow [2024-11-07 15:43:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-07 15:43:27,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-07 15:43:27,404 INFO L175 Difference]: Start difference. First operand has 571 places, 577 transitions, 1213 flow. Second operand 3 states and 1892 transitions. [2024-11-07 15:43:27,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 578 transitions, 1249 flow [2024-11-07 15:43:27,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 578 transitions, 1249 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:43:27,410 INFO L231 Difference]: Finished difference. Result has 572 places, 576 transitions, 1215 flow [2024-11-07 15:43:27,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1215, PETRI_PLACES=572, PETRI_TRANSITIONS=576} [2024-11-07 15:43:27,411 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-11-07 15:43:27,411 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 576 transitions, 1215 flow [2024-11-07 15:43:27,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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:43:27,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:27,412 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:43:27,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 15:43:27,412 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:27,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash -756035181, now seen corresponding path program 1 times [2024-11-07 15:43:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693176351] [2024-11-07 15:43:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:27,457 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:43:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:27,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693176351] [2024-11-07 15:43:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693176351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:27,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:27,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:27,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858853924] [2024-11-07 15:43:27,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:27,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:27,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:27,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:27,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-07 15:43:27,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 576 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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:43:27,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:27,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-07 15:43:27,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:27,774 INFO L124 PetriNetUnfolderBase]: 147/2543 cut-off events. [2024-11-07 15:43:27,775 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2024-11-07 15:43:27,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 2543 events. 147/2543 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18068 event pairs, 10 based on Foata normal form. 0/2202 useless extension candidates. Maximal degree in co-relation 2661. Up to 44 conditions per place. [2024-11-07 15:43:27,812 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-11-07 15:43:27,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 577 transitions, 1249 flow [2024-11-07 15:43:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-07 15:43:27,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638676844783715 [2024-11-07 15:43:27,814 INFO L175 Difference]: Start difference. First operand has 572 places, 576 transitions, 1215 flow. Second operand 3 states and 1894 transitions. [2024-11-07 15:43:27,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 577 transitions, 1249 flow [2024-11-07 15:43:27,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 1245 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:27,827 INFO L231 Difference]: Finished difference. Result has 571 places, 575 transitions, 1213 flow [2024-11-07 15:43:27,827 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=575} [2024-11-07 15:43:27,827 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-11-07 15:43:27,827 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 575 transitions, 1213 flow [2024-11-07 15:43:27,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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:43:27,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:27,828 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:27,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:43:27,828 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:27,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash 833850535, now seen corresponding path program 1 times [2024-11-07 15:43:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:27,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584755067] [2024-11-07 15:43:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:27,995 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:43:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584755067] [2024-11-07 15:43:27,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584755067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:27,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:27,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:43:27,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860069235] [2024-11-07 15:43:27,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:27,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:43:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:43:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:43:28,447 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-07 15:43:28,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 575 transitions, 1213 flow. Second operand has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 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:43:28,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:28,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-07 15:43:28,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:28,919 INFO L124 PetriNetUnfolderBase]: 235/3653 cut-off events. [2024-11-07 15:43:28,920 INFO L125 PetriNetUnfolderBase]: For 9/27 co-relation queries the response was YES. [2024-11-07 15:43:28,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 3653 events. 235/3653 cut-off events. For 9/27 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31299 event pairs, 43 based on Foata normal form. 5/3193 useless extension candidates. Maximal degree in co-relation 4072. Up to 155 conditions per place. [2024-11-07 15:43:28,971 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 70 selfloop transitions, 16 changer transitions 0/614 dead transitions. [2024-11-07 15:43:28,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 614 transitions, 1479 flow [2024-11-07 15:43:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 15:43:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 15:43:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2024-11-07 15:43:28,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188063844552394 [2024-11-07 15:43:28,977 INFO L175 Difference]: Start difference. First operand has 571 places, 575 transitions, 1213 flow. Second operand 11 states and 6620 transitions. [2024-11-07 15:43:28,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 614 transitions, 1479 flow [2024-11-07 15:43:28,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 614 transitions, 1475 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:28,983 INFO L231 Difference]: Finished difference. Result has 584 places, 584 transitions, 1293 flow [2024-11-07 15:43:28,983 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1293, PETRI_PLACES=584, PETRI_TRANSITIONS=584} [2024-11-07 15:43:28,984 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-11-07 15:43:28,984 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 584 transitions, 1293 flow [2024-11-07 15:43:28,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 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:43:28,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:28,985 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:28,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 15:43:28,985 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:28,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:28,985 INFO L85 PathProgramCache]: Analyzing trace with hash -206713279, now seen corresponding path program 1 times [2024-11-07 15:43:28,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:28,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861378543] [2024-11-07 15:43:28,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:28,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:29,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:43:29,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:29,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861378543] [2024-11-07 15:43:29,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861378543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:29,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467279811] [2024-11-07 15:43:29,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:29,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:29,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:29,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-07 15:43:29,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 584 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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:43:29,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:29,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-07 15:43:29,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:29,392 INFO L124 PetriNetUnfolderBase]: 191/2428 cut-off events. [2024-11-07 15:43:29,393 INFO L125 PetriNetUnfolderBase]: For 79/144 co-relation queries the response was YES. [2024-11-07 15:43:29,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 2428 events. 191/2428 cut-off events. For 79/144 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 18743 event pairs, 44 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 2724. Up to 165 conditions per place. [2024-11-07 15:43:29,423 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-11-07 15:43:29,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 585 transitions, 1329 flow [2024-11-07 15:43:29,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-07 15:43:29,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-07 15:43:29,426 INFO L175 Difference]: Start difference. First operand has 584 places, 584 transitions, 1293 flow. Second operand 3 states and 1892 transitions. [2024-11-07 15:43:29,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 585 transitions, 1329 flow [2024-11-07 15:43:29,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 585 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:43:29,431 INFO L231 Difference]: Finished difference. Result has 584 places, 583 transitions, 1291 flow [2024-11-07 15:43:29,431 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=584, PETRI_TRANSITIONS=583} [2024-11-07 15:43:29,431 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-11-07 15:43:29,431 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 583 transitions, 1291 flow [2024-11-07 15:43:29,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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:43:29,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:29,432 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:29,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 15:43:29,432 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:29,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash -245544325, now seen corresponding path program 1 times [2024-11-07 15:43:29,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:29,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312412245] [2024-11-07 15:43:29,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:29,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:29,463 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:43:29,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312412245] [2024-11-07 15:43:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312412245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:29,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:29,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:43:29,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104717632] [2024-11-07 15:43:29,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:29,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:29,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:29,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:29,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-07 15:43:29,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 583 transitions, 1291 flow. Second operand has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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:43:29,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:29,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-07 15:43:29,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:29,824 INFO L124 PetriNetUnfolderBase]: 254/3174 cut-off events. [2024-11-07 15:43:29,824 INFO L125 PetriNetUnfolderBase]: For 114/211 co-relation queries the response was YES. [2024-11-07 15:43:29,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 3174 events. 254/3174 cut-off events. For 114/211 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 24936 event pairs, 66 based on Foata normal form. 0/2735 useless extension candidates. Maximal degree in co-relation 3606. Up to 236 conditions per place. [2024-11-07 15:43:29,871 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/586 dead transitions. [2024-11-07 15:43:29,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 586 transitions, 1333 flow [2024-11-07 15:43:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-07 15:43:29,873 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-07 15:43:29,873 INFO L175 Difference]: Start difference. First operand has 584 places, 583 transitions, 1291 flow. Second operand 3 states and 1896 transitions. [2024-11-07 15:43:29,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 586 transitions, 1333 flow [2024-11-07 15:43:29,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 586 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:29,879 INFO L231 Difference]: Finished difference. Result has 586 places, 584 transitions, 1305 flow [2024-11-07 15:43:29,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=586, PETRI_TRANSITIONS=584} [2024-11-07 15:43:29,879 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -25 predicate places. [2024-11-07 15:43:29,879 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 584 transitions, 1305 flow [2024-11-07 15:43:29,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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:43:29,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:29,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:29,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 15:43:29,880 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:29,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash 894546295, now seen corresponding path program 1 times [2024-11-07 15:43:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:29,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838207449] [2024-11-07 15:43:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:29,911 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:43:29,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838207449] [2024-11-07 15:43:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838207449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:29,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:29,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:43:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749001892] [2024-11-07 15:43:29,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:29,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:29,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:29,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:29,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-07 15:43:29,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 584 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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:43:29,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:29,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-07 15:43:29,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:30,322 INFO L124 PetriNetUnfolderBase]: 299/3771 cut-off events. [2024-11-07 15:43:30,322 INFO L125 PetriNetUnfolderBase]: For 92/125 co-relation queries the response was YES. [2024-11-07 15:43:30,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 3771 events. 299/3771 cut-off events. For 92/125 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 33338 event pairs, 72 based on Foata normal form. 0/3318 useless extension candidates. Maximal degree in co-relation 4389. Up to 227 conditions per place. [2024-11-07 15:43:30,381 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/587 dead transitions. [2024-11-07 15:43:30,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 587 transitions, 1347 flow [2024-11-07 15:43:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-07 15:43:30,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-07 15:43:30,383 INFO L175 Difference]: Start difference. First operand has 586 places, 584 transitions, 1305 flow. Second operand 3 states and 1896 transitions. [2024-11-07 15:43:30,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 587 transitions, 1347 flow [2024-11-07 15:43:30,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 587 transitions, 1341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:30,389 INFO L231 Difference]: Finished difference. Result has 588 places, 585 transitions, 1317 flow [2024-11-07 15:43:30,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=588, PETRI_TRANSITIONS=585} [2024-11-07 15:43:30,390 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -23 predicate places. [2024-11-07 15:43:30,390 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 585 transitions, 1317 flow [2024-11-07 15:43:30,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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:43:30,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:30,391 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:30,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 15:43:30,391 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:30,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:30,391 INFO L85 PathProgramCache]: Analyzing trace with hash -525151164, now seen corresponding path program 1 times [2024-11-07 15:43:30,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:30,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879435067] [2024-11-07 15:43:30,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:30,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:30,428 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:43:30,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:30,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879435067] [2024-11-07 15:43:30,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879435067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:30,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:30,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787827660] [2024-11-07 15:43:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:30,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:30,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:30,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:30,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:30,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-07 15:43:30,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 585 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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:43:30,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:30,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-07 15:43:30,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:31,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][466], [673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 687#(= |#race~count3~0| 0), 699#(= |#race~get1~0| 0), Black: 677#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 740#true, Black: 681#true, 745#true, 683#(= |#race~count2~0| 0), Black: 685#true, 679#(= |#race~count1~0| 0), 667#(= |#race~n2~0| 0), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 401#$Ultimate##0true]) [2024-11-07 15:43:31,247 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2024-11-07 15:43:31,249 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-07 15:43:31,249 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-07 15:43:31,249 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-07 15:43:31,413 INFO L124 PetriNetUnfolderBase]: 307/4941 cut-off events. [2024-11-07 15:43:31,413 INFO L125 PetriNetUnfolderBase]: For 60/125 co-relation queries the response was YES. [2024-11-07 15:43:31,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5630 conditions, 4941 events. 307/4941 cut-off events. For 60/125 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 43982 event pairs, 29 based on Foata normal form. 0/4343 useless extension candidates. Maximal degree in co-relation 5540. Up to 131 conditions per place. [2024-11-07 15:43:31,535 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/586 dead transitions. [2024-11-07 15:43:31,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 586 transitions, 1353 flow [2024-11-07 15:43:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-07 15:43:31,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-07 15:43:31,541 INFO L175 Difference]: Start difference. First operand has 588 places, 585 transitions, 1317 flow. Second operand 3 states and 1892 transitions. [2024-11-07 15:43:31,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 586 transitions, 1353 flow [2024-11-07 15:43:31,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 586 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:31,555 INFO L231 Difference]: Finished difference. Result has 587 places, 584 transitions, 1313 flow [2024-11-07 15:43:31,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=587, PETRI_TRANSITIONS=584} [2024-11-07 15:43:31,560 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -24 predicate places. [2024-11-07 15:43:31,560 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 584 transitions, 1313 flow [2024-11-07 15:43:31,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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:43:31,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:31,560 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:31,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 15:43:31,560 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:31,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash 38540104, now seen corresponding path program 1 times [2024-11-07 15:43:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426245809] [2024-11-07 15:43:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:31,647 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:43:31,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:31,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426245809] [2024-11-07 15:43:31,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426245809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:31,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:31,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:31,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039717459] [2024-11-07 15:43:31,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:31,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:31,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:31,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:31,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-07 15:43:31,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 584 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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:43:31,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:31,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-07 15:43:31,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:32,642 INFO L124 PetriNetUnfolderBase]: 369/4945 cut-off events. [2024-11-07 15:43:32,643 INFO L125 PetriNetUnfolderBase]: For 60/84 co-relation queries the response was YES. [2024-11-07 15:43:32,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5814 conditions, 4945 events. 369/4945 cut-off events. For 60/84 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 43310 event pairs, 45 based on Foata normal form. 0/4405 useless extension candidates. Maximal degree in co-relation 5754. Up to 325 conditions per place. [2024-11-07 15:43:32,738 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 20 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2024-11-07 15:43:32,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 587 transitions, 1368 flow [2024-11-07 15:43:32,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-07 15:43:32,741 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-07 15:43:32,741 INFO L175 Difference]: Start difference. First operand has 587 places, 584 transitions, 1313 flow. Second operand 3 states and 1889 transitions. [2024-11-07 15:43:32,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 587 transitions, 1368 flow [2024-11-07 15:43:32,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 587 transitions, 1364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:32,749 INFO L231 Difference]: Finished difference. Result has 584 places, 582 transitions, 1315 flow [2024-11-07 15:43:32,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1315, PETRI_PLACES=584, PETRI_TRANSITIONS=582} [2024-11-07 15:43:32,750 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-11-07 15:43:32,750 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 582 transitions, 1315 flow [2024-11-07 15:43:32,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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:43:32,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:32,751 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:32,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 15:43:32,751 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:32,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash -598679417, now seen corresponding path program 1 times [2024-11-07 15:43:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:32,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793758344] [2024-11-07 15:43:32,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:32,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:32,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:43:32,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793758344] [2024-11-07 15:43:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793758344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:32,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:32,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:43:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817226395] [2024-11-07 15:43:32,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:32,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:43:32,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:32,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:43:32,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:43:33,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-07 15:43:33,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 582 transitions, 1315 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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:43:33,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:33,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-07 15:43:33,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:34,148 INFO L124 PetriNetUnfolderBase]: 394/4918 cut-off events. [2024-11-07 15:43:34,149 INFO L125 PetriNetUnfolderBase]: For 95/173 co-relation queries the response was YES. [2024-11-07 15:43:34,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6004 conditions, 4918 events. 394/4918 cut-off events. For 95/173 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 44741 event pairs, 108 based on Foata normal form. 8/4389 useless extension candidates. Maximal degree in co-relation 5912. Up to 341 conditions per place. [2024-11-07 15:43:34,216 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 70 selfloop transitions, 16 changer transitions 0/616 dead transitions. [2024-11-07 15:43:34,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 616 transitions, 1571 flow [2024-11-07 15:43:34,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 15:43:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 15:43:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2024-11-07 15:43:34,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188063844552394 [2024-11-07 15:43:34,226 INFO L175 Difference]: Start difference. First operand has 584 places, 582 transitions, 1315 flow. Second operand 11 states and 6620 transitions. [2024-11-07 15:43:34,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 616 transitions, 1571 flow [2024-11-07 15:43:34,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 616 transitions, 1571 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:43:34,232 INFO L231 Difference]: Finished difference. Result has 597 places, 586 transitions, 1378 flow [2024-11-07 15:43:34,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1378, PETRI_PLACES=597, PETRI_TRANSITIONS=586} [2024-11-07 15:43:34,233 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2024-11-07 15:43:34,233 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 586 transitions, 1378 flow [2024-11-07 15:43:34,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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:43:34,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:34,235 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:34,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 15:43:34,235 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:34,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:34,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1455026926, now seen corresponding path program 1 times [2024-11-07 15:43:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703481250] [2024-11-07 15:43:34,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:34,284 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:43:34,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:34,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703481250] [2024-11-07 15:43:34,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703481250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:34,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:34,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:34,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706935847] [2024-11-07 15:43:34,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:34,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:34,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:34,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-07 15:43:34,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 586 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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:43:34,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:34,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-07 15:43:34,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:34,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][471], [Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 752#true, Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, 673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 677#true, Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 655#(= |#race~n1~0| 0), Black: 681#true, Black: 748#true, Black: 685#true, 775#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-11-07 15:43:34,702 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is not cut-off event [2024-11-07 15:43:34,702 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is not cut-off event [2024-11-07 15:43:34,702 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is not cut-off event [2024-11-07 15:43:34,702 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is not cut-off event [2024-11-07 15:43:34,714 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][471], [Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 752#true, Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, 673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 677#true, Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 655#(= |#race~n1~0| 0), Black: 681#true, Black: 748#true, Black: 685#true, 667#(= |#race~n2~0| 0), 775#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-11-07 15:43:34,714 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-11-07 15:43:34,714 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-07 15:43:34,714 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-07 15:43:34,714 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-07 15:43:34,714 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-07 15:43:34,731 INFO L124 PetriNetUnfolderBase]: 245/2948 cut-off events. [2024-11-07 15:43:34,731 INFO L125 PetriNetUnfolderBase]: For 111/149 co-relation queries the response was YES. [2024-11-07 15:43:34,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 2948 events. 245/2948 cut-off events. For 111/149 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 22558 event pairs, 42 based on Foata normal form. 2/2643 useless extension candidates. Maximal degree in co-relation 3580. Up to 210 conditions per place. [2024-11-07 15:43:34,781 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2024-11-07 15:43:34,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 587 transitions, 1414 flow [2024-11-07 15:43:34,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-07 15:43:34,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-07 15:43:34,784 INFO L175 Difference]: Start difference. First operand has 597 places, 586 transitions, 1378 flow. Second operand 3 states and 1892 transitions. [2024-11-07 15:43:34,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 587 transitions, 1414 flow [2024-11-07 15:43:34,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 587 transitions, 1393 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-07 15:43:34,790 INFO L231 Difference]: Finished difference. Result has 591 places, 585 transitions, 1359 flow [2024-11-07 15:43:34,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1359, PETRI_PLACES=591, PETRI_TRANSITIONS=585} [2024-11-07 15:43:34,793 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -20 predicate places. [2024-11-07 15:43:34,793 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 585 transitions, 1359 flow [2024-11-07 15:43:34,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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:43:34,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:34,794 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:34,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 15:43:34,794 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 657299342, now seen corresponding path program 1 times [2024-11-07 15:43:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113066046] [2024-11-07 15:43:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:34,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:43:34,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113066046] [2024-11-07 15:43:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113066046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:34,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:34,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:43:34,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204473382] [2024-11-07 15:43:34,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:34,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:43:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:34,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:43:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:43:35,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-07 15:43:35,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 585 transitions, 1359 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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:43:35,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:35,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-07 15:43:35,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:36,104 INFO L124 PetriNetUnfolderBase]: 517/5084 cut-off events. [2024-11-07 15:43:36,104 INFO L125 PetriNetUnfolderBase]: For 327/495 co-relation queries the response was YES. [2024-11-07 15:43:36,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6820 conditions, 5084 events. 517/5084 cut-off events. For 327/495 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 46594 event pairs, 175 based on Foata normal form. 22/4592 useless extension candidates. Maximal degree in co-relation 6722. Up to 680 conditions per place. [2024-11-07 15:43:36,159 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 66 selfloop transitions, 16 changer transitions 0/615 dead transitions. [2024-11-07 15:43:36,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 615 transitions, 1599 flow [2024-11-07 15:43:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 15:43:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 15:43:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6611 transitions. [2024-11-07 15:43:36,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.917557251908397 [2024-11-07 15:43:36,163 INFO L175 Difference]: Start difference. First operand has 591 places, 585 transitions, 1359 flow. Second operand 11 states and 6611 transitions. [2024-11-07 15:43:36,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 615 transitions, 1599 flow [2024-11-07 15:43:36,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 615 transitions, 1595 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:43:36,171 INFO L231 Difference]: Finished difference. Result has 604 places, 594 transitions, 1439 flow [2024-11-07 15:43:36,171 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1439, PETRI_PLACES=604, PETRI_TRANSITIONS=594} [2024-11-07 15:43:36,172 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -7 predicate places. [2024-11-07 15:43:36,172 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 594 transitions, 1439 flow [2024-11-07 15:43:36,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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:43:36,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:36,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:36,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 15:43:36,173 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:36,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -672350260, now seen corresponding path program 1 times [2024-11-07 15:43:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:36,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709842746] [2024-11-07 15:43:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:36,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:36,301 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:43:36,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:36,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709842746] [2024-11-07 15:43:36,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709842746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:36,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:36,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:43:36,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689352909] [2024-11-07 15:43:36,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:36,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:43:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:36,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:43:36,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:43:36,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-07 15:43:36,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 594 transitions, 1439 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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:43:36,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:36,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-07 15:43:36,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:37,420 INFO L124 PetriNetUnfolderBase]: 412/5900 cut-off events. [2024-11-07 15:43:37,420 INFO L125 PetriNetUnfolderBase]: For 179/209 co-relation queries the response was YES. [2024-11-07 15:43:37,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7667 conditions, 5900 events. 412/5900 cut-off events. For 179/209 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 55316 event pairs, 52 based on Foata normal form. 2/5387 useless extension candidates. Maximal degree in co-relation 7561. Up to 214 conditions per place. [2024-11-07 15:43:37,507 INFO L140 encePairwiseOnDemand]: 638/655 looper letters, 71 selfloop transitions, 24 changer transitions 0/628 dead transitions. [2024-11-07 15:43:37,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 628 transitions, 1745 flow [2024-11-07 15:43:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 15:43:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 15:43:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7210 transitions. [2024-11-07 15:43:37,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173027989821882 [2024-11-07 15:43:37,511 INFO L175 Difference]: Start difference. First operand has 604 places, 594 transitions, 1439 flow. Second operand 12 states and 7210 transitions. [2024-11-07 15:43:37,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 628 transitions, 1745 flow [2024-11-07 15:43:37,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 628 transitions, 1741 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:43:37,520 INFO L231 Difference]: Finished difference. Result has 618 places, 603 transitions, 1568 flow [2024-11-07 15:43:37,521 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1568, PETRI_PLACES=618, PETRI_TRANSITIONS=603} [2024-11-07 15:43:37,521 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 7 predicate places. [2024-11-07 15:43:37,521 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 603 transitions, 1568 flow [2024-11-07 15:43:37,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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:43:37,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:37,522 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:37,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 15:43:37,522 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:37,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1226939412, now seen corresponding path program 1 times [2024-11-07 15:43:37,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:37,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091388708] [2024-11-07 15:43:37,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:37,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:37,707 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:43:37,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:37,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091388708] [2024-11-07 15:43:37,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091388708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:37,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:37,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:43:37,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872071703] [2024-11-07 15:43:37,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:37,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:43:37,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:37,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:43:37,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:43:37,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-07 15:43:37,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 603 transitions, 1568 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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:43:37,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:37,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-07 15:43:37,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:40,053 INFO L124 PetriNetUnfolderBase]: 933/11346 cut-off events. [2024-11-07 15:43:40,053 INFO L125 PetriNetUnfolderBase]: For 719/862 co-relation queries the response was YES. [2024-11-07 15:43:40,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15212 conditions, 11346 events. 933/11346 cut-off events. For 719/862 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 128035 event pairs, 171 based on Foata normal form. 8/10333 useless extension candidates. Maximal degree in co-relation 15100. Up to 512 conditions per place. [2024-11-07 15:43:40,236 INFO L140 encePairwiseOnDemand]: 638/655 looper letters, 67 selfloop transitions, 24 changer transitions 0/633 dead transitions. [2024-11-07 15:43:40,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 633 transitions, 1858 flow [2024-11-07 15:43:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 15:43:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 15:43:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7201 transitions. [2024-11-07 15:43:40,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9161577608142494 [2024-11-07 15:43:40,239 INFO L175 Difference]: Start difference. First operand has 618 places, 603 transitions, 1568 flow. Second operand 12 states and 7201 transitions. [2024-11-07 15:43:40,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 633 transitions, 1858 flow [2024-11-07 15:43:40,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 633 transitions, 1841 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 15:43:40,254 INFO L231 Difference]: Finished difference. Result has 629 places, 617 transitions, 1705 flow [2024-11-07 15:43:40,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1705, PETRI_PLACES=629, PETRI_TRANSITIONS=617} [2024-11-07 15:43:40,255 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 18 predicate places. [2024-11-07 15:43:40,255 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 617 transitions, 1705 flow [2024-11-07 15:43:40,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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:43:40,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:40,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:40,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 15:43:40,259 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:40,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:40,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1359405079, now seen corresponding path program 1 times [2024-11-07 15:43:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:40,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968186116] [2024-11-07 15:43:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:40,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:40,435 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:43:40,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:40,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968186116] [2024-11-07 15:43:40,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968186116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:40,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:40,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 15:43:40,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955755530] [2024-11-07 15:43:40,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:40,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 15:43:40,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 15:43:40,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 15:43:40,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-07 15:43:40,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 617 transitions, 1705 flow. Second operand has 8 states, 8 states have (on average 598.5) internal successors, (4788), 8 states have internal predecessors, (4788), 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:43:40,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:40,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-07 15:43:40,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:42,106 INFO L124 PetriNetUnfolderBase]: 714/6923 cut-off events. [2024-11-07 15:43:42,106 INFO L125 PetriNetUnfolderBase]: For 1164/1353 co-relation queries the response was YES. [2024-11-07 15:43:42,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10199 conditions, 6923 events. 714/6923 cut-off events. For 1164/1353 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 68420 event pairs, 221 based on Foata normal form. 0/6328 useless extension candidates. Maximal degree in co-relation 10077. Up to 849 conditions per place. [2024-11-07 15:43:42,189 INFO L140 encePairwiseOnDemand]: 639/655 looper letters, 69 selfloop transitions, 20 changer transitions 0/640 dead transitions. [2024-11-07 15:43:42,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 640 transitions, 1975 flow [2024-11-07 15:43:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 15:43:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 15:43:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6604 transitions. [2024-11-07 15:43:42,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.916585704371964 [2024-11-07 15:43:42,194 INFO L175 Difference]: Start difference. First operand has 629 places, 617 transitions, 1705 flow. Second operand 11 states and 6604 transitions. [2024-11-07 15:43:42,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 640 transitions, 1975 flow [2024-11-07 15:43:42,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 640 transitions, 1975 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:43:42,207 INFO L231 Difference]: Finished difference. Result has 642 places, 625 transitions, 1822 flow [2024-11-07 15:43:42,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1822, PETRI_PLACES=642, PETRI_TRANSITIONS=625} [2024-11-07 15:43:42,208 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 31 predicate places. [2024-11-07 15:43:42,209 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 625 transitions, 1822 flow [2024-11-07 15:43:42,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.5) internal successors, (4788), 8 states have internal predecessors, (4788), 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:43:42,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:42,210 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:42,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 15:43:42,210 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:42,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1191969725, now seen corresponding path program 1 times [2024-11-07 15:43:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542041252] [2024-11-07 15:43:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:42,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:43:42,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:42,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542041252] [2024-11-07 15:43:42,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542041252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:42,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:42,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:43:42,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935918174] [2024-11-07 15:43:42,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:42,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:43:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:42,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:43:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:43:43,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-07 15:43:43,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 625 transitions, 1822 flow. Second operand has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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:43:43,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:43,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-07 15:43:43,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:44,653 INFO L124 PetriNetUnfolderBase]: 655/9738 cut-off events. [2024-11-07 15:43:44,653 INFO L125 PetriNetUnfolderBase]: For 1894/1962 co-relation queries the response was YES. [2024-11-07 15:43:44,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13819 conditions, 9738 events. 655/9738 cut-off events. For 1894/1962 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 102000 event pairs, 42 based on Foata normal form. 10/9045 useless extension candidates. Maximal degree in co-relation 13691. Up to 282 conditions per place. [2024-11-07 15:43:44,820 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/632 dead transitions. [2024-11-07 15:43:44,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 632 transitions, 1944 flow [2024-11-07 15:43:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:43:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:43:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-07 15:43:44,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-07 15:43:44,822 INFO L175 Difference]: Start difference. First operand has 642 places, 625 transitions, 1822 flow. Second operand 6 states and 3674 transitions. [2024-11-07 15:43:44,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 632 transitions, 1944 flow [2024-11-07 15:43:44,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 632 transitions, 1923 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-07 15:43:44,843 INFO L231 Difference]: Finished difference. Result has 639 places, 624 transitions, 1820 flow [2024-11-07 15:43:44,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1820, PETRI_PLACES=639, PETRI_TRANSITIONS=624} [2024-11-07 15:43:44,844 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 28 predicate places. [2024-11-07 15:43:44,844 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 624 transitions, 1820 flow [2024-11-07 15:43:44,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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:43:44,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:44,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:44,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 15:43:44,845 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:44,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1944970583, now seen corresponding path program 1 times [2024-11-07 15:43:44,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:44,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21463581] [2024-11-07 15:43:44,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:44,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:43:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21463581] [2024-11-07 15:43:45,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21463581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:45,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:45,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:43:45,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559388271] [2024-11-07 15:43:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:45,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:43:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:45,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:43:45,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:43:45,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-07 15:43:45,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 624 transitions, 1820 flow. Second operand has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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:43:45,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:45,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-07 15:43:45,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:47,149 INFO L124 PetriNetUnfolderBase]: 744/10591 cut-off events. [2024-11-07 15:43:47,150 INFO L125 PetriNetUnfolderBase]: For 2110/2252 co-relation queries the response was YES. [2024-11-07 15:43:47,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15045 conditions, 10591 events. 744/10591 cut-off events. For 2110/2252 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 113091 event pairs, 70 based on Foata normal form. 15/9809 useless extension candidates. Maximal degree in co-relation 14917. Up to 378 conditions per place. [2024-11-07 15:43:47,344 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/631 dead transitions. [2024-11-07 15:43:47,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 631 transitions, 1942 flow [2024-11-07 15:43:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:43:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:43:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-07 15:43:47,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-07 15:43:47,346 INFO L175 Difference]: Start difference. First operand has 639 places, 624 transitions, 1820 flow. Second operand 6 states and 3674 transitions. [2024-11-07 15:43:47,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 631 transitions, 1942 flow [2024-11-07 15:43:47,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 631 transitions, 1929 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-07 15:43:47,368 INFO L231 Difference]: Finished difference. Result has 639 places, 623 transitions, 1826 flow [2024-11-07 15:43:47,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1803, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1826, PETRI_PLACES=639, PETRI_TRANSITIONS=623} [2024-11-07 15:43:47,369 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 28 predicate places. [2024-11-07 15:43:47,369 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 623 transitions, 1826 flow [2024-11-07 15:43:47,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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:43:47,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:47,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:47,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 15:43:47,370 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:47,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash -384633757, now seen corresponding path program 1 times [2024-11-07 15:43:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:47,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010563586] [2024-11-07 15:43:47,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:43:47,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:47,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010563586] [2024-11-07 15:43:47,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010563586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:47,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:47,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:43:47,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304778640] [2024-11-07 15:43:47,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:47,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:43:47,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:47,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:43:47,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:43:48,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-07 15:43:48,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 623 transitions, 1826 flow. Second operand has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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:43:48,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:48,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-07 15:43:48,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:49,571 INFO L124 PetriNetUnfolderBase]: 633/9637 cut-off events. [2024-11-07 15:43:49,572 INFO L125 PetriNetUnfolderBase]: For 1965/2033 co-relation queries the response was YES. [2024-11-07 15:43:49,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13753 conditions, 9637 events. 633/9637 cut-off events. For 1965/2033 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 100537 event pairs, 42 based on Foata normal form. 10/8985 useless extension candidates. Maximal degree in co-relation 13624. Up to 282 conditions per place. [2024-11-07 15:43:49,724 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/629 dead transitions. [2024-11-07 15:43:49,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 629 transitions, 1942 flow [2024-11-07 15:43:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:43:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:43:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-07 15:43:49,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-07 15:43:49,726 INFO L175 Difference]: Start difference. First operand has 639 places, 623 transitions, 1826 flow. Second operand 6 states and 3674 transitions. [2024-11-07 15:43:49,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 629 transitions, 1942 flow [2024-11-07 15:43:49,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 629 transitions, 1929 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-07 15:43:49,747 INFO L231 Difference]: Finished difference. Result has 638 places, 621 transitions, 1821 flow [2024-11-07 15:43:49,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1821, PETRI_PLACES=638, PETRI_TRANSITIONS=621} [2024-11-07 15:43:49,748 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 27 predicate places. [2024-11-07 15:43:49,748 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 621 transitions, 1821 flow [2024-11-07 15:43:49,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 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:43:49,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:49,749 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:49,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 15:43:49,749 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:49,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 806009401, now seen corresponding path program 1 times [2024-11-07 15:43:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:49,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105230465] [2024-11-07 15:43:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:43:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:49,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105230465] [2024-11-07 15:43:49,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105230465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:49,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:49,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:49,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472738960] [2024-11-07 15:43:49,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:49,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:49,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:49,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:49,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:49,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-07 15:43:49,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 621 transitions, 1821 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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:43:49,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:49,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-07 15:43:49,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:51,136 INFO L124 PetriNetUnfolderBase]: 742/9682 cut-off events. [2024-11-07 15:43:51,136 INFO L125 PetriNetUnfolderBase]: For 1230/1250 co-relation queries the response was YES. [2024-11-07 15:43:51,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13080 conditions, 9682 events. 742/9682 cut-off events. For 1230/1250 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 97757 event pairs, 79 based on Foata normal form. 0/8959 useless extension candidates. Maximal degree in co-relation 12952. Up to 558 conditions per place. [2024-11-07 15:43:51,246 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 19 selfloop transitions, 2 changer transitions 0/623 dead transitions. [2024-11-07 15:43:51,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 623 transitions, 1871 flow [2024-11-07 15:43:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1888 transitions. [2024-11-07 15:43:51,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608142493638677 [2024-11-07 15:43:51,248 INFO L175 Difference]: Start difference. First operand has 638 places, 621 transitions, 1821 flow. Second operand 3 states and 1888 transitions. [2024-11-07 15:43:51,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 623 transitions, 1871 flow [2024-11-07 15:43:51,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 623 transitions, 1859 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:43:51,266 INFO L231 Difference]: Finished difference. Result has 632 places, 619 transitions, 1815 flow [2024-11-07 15:43:51,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1815, PETRI_PLACES=632, PETRI_TRANSITIONS=619} [2024-11-07 15:43:51,268 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 21 predicate places. [2024-11-07 15:43:51,268 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 619 transitions, 1815 flow [2024-11-07 15:43:51,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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:43:51,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:51,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:51,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 15:43:51,269 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:51,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash -306177816, now seen corresponding path program 1 times [2024-11-07 15:43:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:51,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882669318] [2024-11-07 15:43:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:43:51,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:51,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882669318] [2024-11-07 15:43:51,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882669318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:51,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:51,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:43:51,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148237708] [2024-11-07 15:43:51,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:51,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:43:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:51,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:43:51,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:43:52,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-07 15:43:52,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 619 transitions, 1815 flow. Second operand has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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:43:52,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:52,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-07 15:43:52,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:53,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][595], [322#L90-4true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 803#true, 679#(= |#race~count1~0| 0), 902#(= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-07 15:43:53,015 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-07 15:43:53,015 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-11-07 15:43:53,015 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-07 15:43:53,015 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-07 15:43:53,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][599], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 803#true, 679#(= |#race~count1~0| 0), 138#L90-5true, 903#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0)), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-07 15:43:53,017 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-11-07 15:43:53,017 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-07 15:43:53,017 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-07 15:43:53,017 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-11-07 15:43:53,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][603], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 803#true, 679#(= |#race~count1~0| 0), 421#L90-6true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), 904#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0)), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-07 15:43:53,018 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-11-07 15:43:53,018 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-07 15:43:53,019 INFO L297 olderBase$Statistics]: existing Event has 328 ancestors and is cut-off event [2024-11-07 15:43:53,019 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-07 15:43:53,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][607], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, 108#L90-7true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-07 15:43:53,020 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2024-11-07 15:43:53,020 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-07 15:43:53,020 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2024-11-07 15:43:53,020 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-07 15:43:53,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][607], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), 612#L90-8true, Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-07 15:43:53,022 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2024-11-07 15:43:53,022 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-07 15:43:53,022 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-07 15:43:53,022 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2024-11-07 15:43:53,028 INFO L124 PetriNetUnfolderBase]: 641/6977 cut-off events. [2024-11-07 15:43:53,028 INFO L125 PetriNetUnfolderBase]: For 1955/2194 co-relation queries the response was YES. [2024-11-07 15:43:53,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10507 conditions, 6977 events. 641/6977 cut-off events. For 1955/2194 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 67633 event pairs, 87 based on Foata normal form. 39/6607 useless extension candidates. Maximal degree in co-relation 10378. Up to 441 conditions per place. [2024-11-07 15:43:53,098 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/626 dead transitions. [2024-11-07 15:43:53,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 626 transitions, 1937 flow [2024-11-07 15:43:53,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:43:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:43:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-07 15:43:53,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-07 15:43:53,104 INFO L175 Difference]: Start difference. First operand has 632 places, 619 transitions, 1815 flow. Second operand 6 states and 3674 transitions. [2024-11-07 15:43:53,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 626 transitions, 1937 flow [2024-11-07 15:43:53,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 626 transitions, 1937 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:43:53,126 INFO L231 Difference]: Finished difference. Result has 636 places, 618 transitions, 1834 flow [2024-11-07 15:43:53,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1834, PETRI_PLACES=636, PETRI_TRANSITIONS=618} [2024-11-07 15:43:53,127 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 25 predicate places. [2024-11-07 15:43:53,131 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 618 transitions, 1834 flow [2024-11-07 15:43:53,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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:43:53,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:53,132 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:53,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 15:43:53,132 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:53,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:53,132 INFO L85 PathProgramCache]: Analyzing trace with hash -151739267, now seen corresponding path program 1 times [2024-11-07 15:43:53,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:53,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795590644] [2024-11-07 15:43:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:53,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:43:53,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:53,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795590644] [2024-11-07 15:43:53,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795590644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:53,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:53,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:43:53,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107835845] [2024-11-07 15:43:53,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:53,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:43:53,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:53,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:43:53,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:43:54,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-07 15:43:54,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 618 transitions, 1834 flow. Second operand has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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:43:54,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:54,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-07 15:43:54,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:55,961 INFO L124 PetriNetUnfolderBase]: 785/11057 cut-off events. [2024-11-07 15:43:55,962 INFO L125 PetriNetUnfolderBase]: For 2519/2652 co-relation queries the response was YES. [2024-11-07 15:43:56,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16324 conditions, 11057 events. 785/11057 cut-off events. For 2519/2652 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 119138 event pairs, 72 based on Foata normal form. 17/10450 useless extension candidates. Maximal degree in co-relation 16193. Up to 417 conditions per place. [2024-11-07 15:43:56,107 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/624 dead transitions. [2024-11-07 15:43:56,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 624 transitions, 1950 flow [2024-11-07 15:43:56,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:43:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:43:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-07 15:43:56,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-07 15:43:56,115 INFO L175 Difference]: Start difference. First operand has 636 places, 618 transitions, 1834 flow. Second operand 6 states and 3674 transitions. [2024-11-07 15:43:56,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 624 transitions, 1950 flow [2024-11-07 15:43:56,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 624 transitions, 1937 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-07 15:43:56,164 INFO L231 Difference]: Finished difference. Result has 635 places, 616 transitions, 1829 flow [2024-11-07 15:43:56,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1829, PETRI_PLACES=635, PETRI_TRANSITIONS=616} [2024-11-07 15:43:56,168 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 24 predicate places. [2024-11-07 15:43:56,172 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 616 transitions, 1829 flow [2024-11-07 15:43:56,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 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:43:56,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:56,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:56,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 15:43:56,173 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:56,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:56,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1023730657, now seen corresponding path program 1 times [2024-11-07 15:43:56,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:56,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631418126] [2024-11-07 15:43:56,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:56,240 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:43:56,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:56,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631418126] [2024-11-07 15:43:56,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631418126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:56,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:56,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:43:56,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929228471] [2024-11-07 15:43:56,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:56,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:43:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:56,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:43:56,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:43:56,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 655 [2024-11-07 15:43:56,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 616 transitions, 1829 flow. Second operand has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 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:43:56,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:56,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 655 [2024-11-07 15:43:56,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:43:57,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][431], [Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 913#true, Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 808#(<= ~n2~0 0), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 907#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-07 15:43:57,930 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-11-07 15:43:57,930 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-11-07 15:43:57,930 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-07 15:43:57,931 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-07 15:43:57,942 INFO L124 PetriNetUnfolderBase]: 643/10323 cut-off events. [2024-11-07 15:43:57,942 INFO L125 PetriNetUnfolderBase]: For 1813/1847 co-relation queries the response was YES. [2024-11-07 15:43:58,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14625 conditions, 10323 events. 643/10323 cut-off events. For 1813/1847 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 107073 event pairs, 42 based on Foata normal form. 0/9769 useless extension candidates. Maximal degree in co-relation 14495. Up to 304 conditions per place. [2024-11-07 15:43:58,067 INFO L140 encePairwiseOnDemand]: 653/655 looper letters, 10 selfloop transitions, 1 changer transitions 0/615 dead transitions. [2024-11-07 15:43:58,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 615 transitions, 1849 flow [2024-11-07 15:43:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:43:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:43:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-07 15:43:58,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-07 15:43:58,070 INFO L175 Difference]: Start difference. First operand has 635 places, 616 transitions, 1829 flow. Second operand 3 states and 1896 transitions. [2024-11-07 15:43:58,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 615 transitions, 1849 flow [2024-11-07 15:43:58,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 615 transitions, 1837 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:43:58,089 INFO L231 Difference]: Finished difference. Result has 631 places, 615 transitions, 1817 flow [2024-11-07 15:43:58,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1817, PETRI_PLACES=631, PETRI_TRANSITIONS=615} [2024-11-07 15:43:58,094 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 20 predicate places. [2024-11-07 15:43:58,094 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 615 transitions, 1817 flow [2024-11-07 15:43:58,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 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:43:58,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:43:58,094 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:58,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 15:43:58,094 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:43:58,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:43:58,095 INFO L85 PathProgramCache]: Analyzing trace with hash 384614286, now seen corresponding path program 1 times [2024-11-07 15:43:58,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:43:58,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540018772] [2024-11-07 15:43:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:43:58,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:43:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:43:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:43:58,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:43:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540018772] [2024-11-07 15:43:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540018772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:43:58,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:43:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:43:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436350998] [2024-11-07 15:43:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:43:58,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:43:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:43:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:43:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:43:59,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-07 15:43:59,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 615 transitions, 1817 flow. Second operand has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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:43:59,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:43:59,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-07 15:43:59,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:44:00,809 INFO L124 PetriNetUnfolderBase]: 577/6749 cut-off events. [2024-11-07 15:44:00,809 INFO L125 PetriNetUnfolderBase]: For 2163/2368 co-relation queries the response was YES. [2024-11-07 15:44:00,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10196 conditions, 6749 events. 577/6749 cut-off events. For 2163/2368 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 64460 event pairs, 87 based on Foata normal form. 37/6463 useless extension candidates. Maximal degree in co-relation 10065. Up to 445 conditions per place. [2024-11-07 15:44:00,879 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/621 dead transitions. [2024-11-07 15:44:00,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 621 transitions, 1933 flow [2024-11-07 15:44:00,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:44:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:44:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-07 15:44:00,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-07 15:44:00,883 INFO L175 Difference]: Start difference. First operand has 631 places, 615 transitions, 1817 flow. Second operand 6 states and 3674 transitions. [2024-11-07 15:44:00,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 621 transitions, 1933 flow [2024-11-07 15:44:00,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 621 transitions, 1932 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:44:00,897 INFO L231 Difference]: Finished difference. Result has 633 places, 613 transitions, 1824 flow [2024-11-07 15:44:00,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1824, PETRI_PLACES=633, PETRI_TRANSITIONS=613} [2024-11-07 15:44:00,899 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 22 predicate places. [2024-11-07 15:44:00,899 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 613 transitions, 1824 flow [2024-11-07 15:44:00,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 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:44:00,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:44:00,900 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:00,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-07 15:44:00,901 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:44:00,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:44:00,901 INFO L85 PathProgramCache]: Analyzing trace with hash 889734991, now seen corresponding path program 1 times [2024-11-07 15:44:00,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:44:00,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654257361] [2024-11-07 15:44:00,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:44:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:44:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:44:00,976 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:44:00,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:44:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654257361] [2024-11-07 15:44:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654257361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:44:00,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:44:00,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:44:00,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315196075] [2024-11-07 15:44:00,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:44:00,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:44:00,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:44:00,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:44:00,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:44:01,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-07 15:44:01,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 613 transitions, 1824 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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:44:01,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:44:01,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-07 15:44:01,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:44:02,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][431], [Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, 916#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 808#(<= ~n2~0 0), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2024-11-07 15:44:02,866 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-11-07 15:44:02,866 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-07 15:44:02,866 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-11-07 15:44:02,866 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-07 15:44:02,881 INFO L124 PetriNetUnfolderBase]: 687/10501 cut-off events. [2024-11-07 15:44:02,882 INFO L125 PetriNetUnfolderBase]: For 1849/1915 co-relation queries the response was YES. [2024-11-07 15:44:02,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15134 conditions, 10501 events. 687/10501 cut-off events. For 1849/1915 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 109186 event pairs, 72 based on Foata normal form. 0/10015 useless extension candidates. Maximal degree in co-relation 15004. Up to 388 conditions per place. [2024-11-07 15:44:03,008 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 12 selfloop transitions, 1 changer transitions 0/611 dead transitions. [2024-11-07 15:44:03,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 611 transitions, 1846 flow [2024-11-07 15:44:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:44:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:44:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1890 transitions. [2024-11-07 15:44:03,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9618320610687023 [2024-11-07 15:44:03,009 INFO L175 Difference]: Start difference. First operand has 633 places, 613 transitions, 1824 flow. Second operand 3 states and 1890 transitions. [2024-11-07 15:44:03,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 611 transitions, 1846 flow [2024-11-07 15:44:03,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 611 transitions, 1834 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:44:03,030 INFO L231 Difference]: Finished difference. Result has 628 places, 611 transitions, 1810 flow [2024-11-07 15:44:03,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1810, PETRI_PLACES=628, PETRI_TRANSITIONS=611} [2024-11-07 15:44:03,035 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 17 predicate places. [2024-11-07 15:44:03,035 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 611 transitions, 1810 flow [2024-11-07 15:44:03,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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:44:03,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:44:03,036 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:03,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-07 15:44:03,036 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:44:03,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:44:03,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1875686641, now seen corresponding path program 1 times [2024-11-07 15:44:03,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:44:03,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894834273] [2024-11-07 15:44:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:44:03,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:44:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:44:03,090 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:44:03,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:44:03,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894834273] [2024-11-07 15:44:03,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894834273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:44:03,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:44:03,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:44:03,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632233451] [2024-11-07 15:44:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:44:03,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:44:03,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:44:03,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:44:03,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:44:03,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-07 15:44:03,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 611 transitions, 1810 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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:44:03,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:44:03,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-07 15:44:03,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:44:03,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1726] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][392], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), 499#L97-7true, Black: 748#true, 827#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2024-11-07 15:44:03,946 INFO L294 olderBase$Statistics]: this new event has 390 ancestors and is cut-off event [2024-11-07 15:44:03,946 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-07 15:44:03,946 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-07 15:44:03,946 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-07 15:44:03,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][431], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, 827#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2024-11-07 15:44:03,952 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-11-07 15:44:03,952 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is cut-off event [2024-11-07 15:44:03,952 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2024-11-07 15:44:03,952 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2024-11-07 15:44:03,953 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][431], [Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 808#(<= ~n2~0 0), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0), 922#true]) [2024-11-07 15:44:03,953 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2024-11-07 15:44:03,953 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-07 15:44:03,953 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2024-11-07 15:44:03,953 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-07 15:44:03,953 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2024-11-07 15:44:03,955 INFO L124 PetriNetUnfolderBase]: 441/5955 cut-off events. [2024-11-07 15:44:03,955 INFO L125 PetriNetUnfolderBase]: For 1032/1092 co-relation queries the response was YES. [2024-11-07 15:44:04,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8596 conditions, 5955 events. 441/5955 cut-off events. For 1032/1092 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 55181 event pairs, 87 based on Foata normal form. 15/5680 useless extension candidates. Maximal degree in co-relation 8466. Up to 367 conditions per place. [2024-11-07 15:44:04,045 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 8 selfloop transitions, 0 changer transitions 27/609 dead transitions. [2024-11-07 15:44:04,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 609 transitions, 1830 flow [2024-11-07 15:44:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:44:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:44:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-07 15:44:04,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-07 15:44:04,050 INFO L175 Difference]: Start difference. First operand has 628 places, 611 transitions, 1810 flow. Second operand 3 states and 1889 transitions. [2024-11-07 15:44:04,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 609 transitions, 1830 flow [2024-11-07 15:44:04,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 609 transitions, 1829 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:44:04,074 INFO L231 Difference]: Finished difference. Result has 627 places, 582 transitions, 1670 flow [2024-11-07 15:44:04,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1670, PETRI_PLACES=627, PETRI_TRANSITIONS=582} [2024-11-07 15:44:04,078 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 16 predicate places. [2024-11-07 15:44:04,079 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 582 transitions, 1670 flow [2024-11-07 15:44:04,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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:44:04,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:44:04,079 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:04,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-07 15:44:04,079 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:44:04,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:44:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1721043426, now seen corresponding path program 1 times [2024-11-07 15:44:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:44:04,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349936255] [2024-11-07 15:44:04,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:44:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:44:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:44:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:44:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:44:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349936255] [2024-11-07 15:44:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349936255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:44:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:44:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:44:04,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673095072] [2024-11-07 15:44:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:44:04,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:44:04,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:44:04,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:44:04,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:44:04,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-07 15:44:04,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 582 transitions, 1670 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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:44:04,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:44:04,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-07 15:44:04,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:44:05,868 INFO L124 PetriNetUnfolderBase]: 590/9291 cut-off events. [2024-11-07 15:44:05,869 INFO L125 PetriNetUnfolderBase]: For 1281/1307 co-relation queries the response was YES. [2024-11-07 15:44:05,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12881 conditions, 9291 events. 590/9291 cut-off events. For 1281/1307 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 93202 event pairs, 42 based on Foata normal form. 0/8884 useless extension candidates. Maximal degree in co-relation 12840. Up to 261 conditions per place. [2024-11-07 15:44:05,996 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 11 selfloop transitions, 2 changer transitions 15/583 dead transitions. [2024-11-07 15:44:05,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 583 transitions, 1700 flow [2024-11-07 15:44:05,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:44:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:44:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-07 15:44:05,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-07 15:44:05,998 INFO L175 Difference]: Start difference. First operand has 627 places, 582 transitions, 1670 flow. Second operand 3 states and 1892 transitions. [2024-11-07 15:44:05,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 583 transitions, 1700 flow [2024-11-07 15:44:06,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 583 transitions, 1686 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-07 15:44:06,015 INFO L231 Difference]: Finished difference. Result has 607 places, 566 transitions, 1554 flow [2024-11-07 15:44:06,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=607, PETRI_TRANSITIONS=566} [2024-11-07 15:44:06,016 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -4 predicate places. [2024-11-07 15:44:06,016 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 566 transitions, 1554 flow [2024-11-07 15:44:06,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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:44:06,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:44:06,017 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:06,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-07 15:44:06,017 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:44:06,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:44:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash -713272875, now seen corresponding path program 1 times [2024-11-07 15:44:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:44:06,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844286934] [2024-11-07 15:44:06,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:44:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:44:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:44:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:44:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:44:06,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844286934] [2024-11-07 15:44:06,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844286934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:44:06,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:44:06,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:44:06,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434951365] [2024-11-07 15:44:06,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:44:06,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:44:06,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:44:06,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:44:06,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:44:06,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-07 15:44:06,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 566 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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:44:06,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:44:06,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-07 15:44:06,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:44:07,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1510] L50-8-->L50-9: Formula: (= |v_#race~get2~0_1| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_1|} AuxVars[] AssignedVars[#race~get2~0][492], [931#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 104#L50-9true, Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), 615#L122-4true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, 136#L90-1true, Black: 685#true, 667#(= |#race~n2~0| 0), 925#true, Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 576#L70-1true, Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), 928#true, Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-07 15:44:07,556 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-11-07 15:44:07,556 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-11-07 15:44:07,556 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-11-07 15:44:07,556 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-07 15:44:07,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][420], [931#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 136#L90-1true, 667#(= |#race~n2~0| 0), 925#true, Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), 928#true, Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-07 15:44:07,581 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-11-07 15:44:07,581 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-11-07 15:44:07,581 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2024-11-07 15:44:07,581 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-11-07 15:44:07,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1613] L77-6-->L77-7: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_7|) InVars {thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_7|} AuxVars[] AssignedVars[#race~res2~0][349], [931#true, Black: 896#true, Black: 757#(<= ~n1~0 0), 687#(= |#race~count3~0| 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 136#L90-1true, 667#(= |#race~n2~0| 0), 925#true, Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 249#L77-7true, Black: 697#true, 190#L123-1true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), 928#true, Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-07 15:44:07,583 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2024-11-07 15:44:07,583 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-07 15:44:07,583 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-07 15:44:07,583 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-07 15:44:07,583 INFO L124 PetriNetUnfolderBase]: 527/7901 cut-off events. [2024-11-07 15:44:07,584 INFO L125 PetriNetUnfolderBase]: For 913/972 co-relation queries the response was YES. [2024-11-07 15:44:07,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10853 conditions, 7901 events. 527/7901 cut-off events. For 913/972 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 76412 event pairs, 61 based on Foata normal form. 0/7573 useless extension candidates. Maximal degree in co-relation 10811. Up to 233 conditions per place. [2024-11-07 15:44:07,710 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 11 selfloop transitions, 2 changer transitions 14/567 dead transitions. [2024-11-07 15:44:07,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 567 transitions, 1584 flow [2024-11-07 15:44:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:44:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:44:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-07 15:44:07,712 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-07 15:44:07,712 INFO L175 Difference]: Start difference. First operand has 607 places, 566 transitions, 1554 flow. Second operand 3 states and 1889 transitions. [2024-11-07 15:44:07,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 567 transitions, 1584 flow [2024-11-07 15:44:07,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 567 transitions, 1526 flow, removed 13 selfloop flow, removed 15 redundant places. [2024-11-07 15:44:07,731 INFO L231 Difference]: Finished difference. Result has 586 places, 551 transitions, 1406 flow [2024-11-07 15:44:07,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1406, PETRI_PLACES=586, PETRI_TRANSITIONS=551} [2024-11-07 15:44:07,731 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -25 predicate places. [2024-11-07 15:44:07,731 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 551 transitions, 1406 flow [2024-11-07 15:44:07,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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:44:07,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:44:07,732 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:07,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-07 15:44:07,732 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread3Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-07 15:44:07,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:44:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash -782181195, now seen corresponding path program 1 times [2024-11-07 15:44:07,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:44:07,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097226973] [2024-11-07 15:44:07,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:44:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:44:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:44:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:44:07,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:44:07,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097226973] [2024-11-07 15:44:07,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097226973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:44:07,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:44:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:44:07,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933361773] [2024-11-07 15:44:07,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:44:07,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:44:07,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:44:07,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:44:07,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:44:07,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-07 15:44:07,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 551 transitions, 1406 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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:44:07,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:44:07,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-07 15:44:07,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:44:08,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][386], [931#true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 683#(= |#race~count2~0| 0), 803#true, 679#(= |#race~count1~0| 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 677#true, 655#(= |#race~n1~0| 0), Black: 681#true, 499#L97-7true, Black: 748#true, Black: 685#true, 934#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 808#(<= ~n2~0 0), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-11-07 15:44:08,579 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is not cut-off event [2024-11-07 15:44:08,580 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-11-07 15:44:08,580 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-11-07 15:44:08,580 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is not cut-off event [2024-11-07 15:44:08,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1726] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][392], [931#true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 683#(= |#race~count2~0| 0), 803#true, 679#(= |#race~count1~0| 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 783#(<= ~n2~0 0), 673#(= |#race~n3~0| 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 677#true, 655#(= |#race~n1~0| 0), Black: 681#true, 499#L97-7true, Black: 748#true, Black: 685#true, 934#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, 667#(= |#race~n2~0| 0), 925#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 808#(<= ~n2~0 0), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 898#(= |#race~get3~0| 0), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-11-07 15:44:08,584 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2024-11-07 15:44:08,584 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-07 15:44:08,584 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-07 15:44:08,584 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-07 15:44:08,584 INFO L124 PetriNetUnfolderBase]: 276/3453 cut-off events. [2024-11-07 15:44:08,584 INFO L125 PetriNetUnfolderBase]: For 214/268 co-relation queries the response was YES. [2024-11-07 15:44:08,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 3453 events. 276/3453 cut-off events. For 214/268 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 26710 event pairs, 54 based on Foata normal form. 2/3284 useless extension candidates. Maximal degree in co-relation 4547. Up to 190 conditions per place. [2024-11-07 15:44:08,641 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 0 selfloop transitions, 0 changer transitions 552/552 dead transitions. [2024-11-07 15:44:08,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 552 transitions, 1436 flow [2024-11-07 15:44:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:44:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:44:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-07 15:44:08,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-07 15:44:08,643 INFO L175 Difference]: Start difference. First operand has 586 places, 551 transitions, 1406 flow. Second operand 3 states and 1889 transitions. [2024-11-07 15:44:08,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 552 transitions, 1436 flow [2024-11-07 15:44:08,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 552 transitions, 1382 flow, removed 11 selfloop flow, removed 15 redundant places. [2024-11-07 15:44:08,656 INFO L231 Difference]: Finished difference. Result has 565 places, 0 transitions, 0 flow [2024-11-07 15:44:08,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=565, PETRI_TRANSITIONS=0} [2024-11-07 15:44:08,657 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -46 predicate places. [2024-11-07 15:44:08,657 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 0 transitions, 0 flow [2024-11-07 15:44:08,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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:44:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (136 of 137 remaining) [2024-11-07 15:44:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (135 of 137 remaining) [2024-11-07 15:44:08,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (134 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (133 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (132 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (131 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (130 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (129 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (128 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (127 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (126 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (125 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (124 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (123 of 137 remaining) [2024-11-07 15:44:08,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (122 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (121 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (120 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (119 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (118 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (117 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (116 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (115 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (114 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (113 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (112 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (111 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (110 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (109 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (108 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (107 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (106 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (105 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (104 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (103 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (102 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (101 of 137 remaining) [2024-11-07 15:44:08,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (100 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (99 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (98 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (97 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (96 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (95 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (94 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (93 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (92 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (91 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (90 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (89 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (88 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (87 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (86 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (85 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (84 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (82 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (80 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (79 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (78 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (77 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (75 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (73 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (72 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (71 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (70 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (69 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (68 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (67 of 137 remaining) [2024-11-07 15:44:08,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (66 of 137 remaining) [2024-11-07 15:44:08,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (65 of 137 remaining) [2024-11-07 15:44:08,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (64 of 137 remaining) [2024-11-07 15:44:08,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (63 of 137 remaining) [2024-11-07 15:44:08,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (62 of 137 remaining) [2024-11-07 15:44:08,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (61 of 137 remaining) [2024-11-07 15:44:08,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (60 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (52 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (51 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (49 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (48 of 137 remaining) [2024-11-07 15:44:08,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (46 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (42 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (41 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (40 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (38 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (36 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (33 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (32 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (31 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (30 of 137 remaining) [2024-11-07 15:44:08,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (29 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (27 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (18 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (17 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (14 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (11 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (10 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (8 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 137 remaining) [2024-11-07 15:44:08,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 137 remaining) [2024-11-07 15:44:08,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 137 remaining) [2024-11-07 15:44:08,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 137 remaining) [2024-11-07 15:44:08,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 137 remaining) [2024-11-07 15:44:08,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 137 remaining) [2024-11-07 15:44:08,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 137 remaining) [2024-11-07 15:44:08,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 137 remaining) [2024-11-07 15:44:08,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-07 15:44:08,669 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:08,674 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:44:08,674 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:44:08,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:44:08 BasicIcfg [2024-11-07 15:44:08,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:44:08,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:44:08,679 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:44:08,679 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:44:08,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:43:12" (3/4) ... [2024-11-07 15:44:08,681 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 15:44:08,683 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-07 15:44:08,683 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-07 15:44:08,683 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-07 15:44:08,689 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-07 15:44:08,689 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 15:44:08,690 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 15:44:08,690 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 15:44:08,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:44:08,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 15:44:08,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:44:08,777 INFO L158 Benchmark]: Toolchain (without parser) took 57176.62ms. Allocated memory was 117.4MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 93.2MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-07 15:44:08,778 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 47.2MB in the beginning and 47.1MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:44:08,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.64ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 78.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 15:44:08,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.20ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 76.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:44:08,779 INFO L158 Benchmark]: Boogie Preprocessor took 45.05ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 73.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:44:08,779 INFO L158 Benchmark]: RCFGBuilder took 852.26ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 80.8MB in the end (delta: -7.1MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2024-11-07 15:44:08,779 INFO L158 Benchmark]: TraceAbstraction took 55899.64ms. Allocated memory was 117.4MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 80.8MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-07 15:44:08,779 INFO L158 Benchmark]: Witness Printer took 97.86ms. Allocated memory is still 4.0GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:44:08,781 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 47.2MB in the beginning and 47.1MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.64ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 78.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.20ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 76.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.05ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 73.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 852.26ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 80.8MB in the end (delta: -7.1MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * TraceAbstraction took 55899.64ms. Allocated memory was 117.4MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 80.8MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 97.86ms. Allocated memory is still 4.0GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 950 locations, 137 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 55.7s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 49.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7056 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4432 mSDsluCounter, 6738 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6314 mSDsCounter, 1364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10469 IncrementalHoareTripleChecker+Invalid, 11833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1364 mSolverCounterUnsat, 424 mSDtfsCounter, 10469 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1834occurred in iteration=38, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 8464 NumberOfCodeBlocks, 8464 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 8418 ConstructedInterpolants, 0 QuantifiedInterpolants, 10508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 77 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 15:44:08,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE