./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! data-race) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:39:18,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:39:18,160 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:39:18,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:39:18,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:39:18,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:39:18,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:39:18,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:39:18,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:39:18,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:39:18,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:39:18,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:39:18,199 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:39:18,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:39:18,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:39:18,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:39:18,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:39:18,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:39:18,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:39:18,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:39:18,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:39:18,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:39:18,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:39:18,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:39:18,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:39:18,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:39:18,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:39:18,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:39:18,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:39:18,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:39:18,202 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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 [2024-11-07 15:39:18,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:39:18,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:39:18,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:39:18,499 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:39:18,500 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:39:18,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-11-07 15:39:19,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:39:20,114 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:39:20,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-11-07 15:39:20,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8625a1fe0/38d5574f12e34a8b9589a68c96ca5d59/FLAGcd40dac4f [2024-11-07 15:39:20,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8625a1fe0/38d5574f12e34a8b9589a68c96ca5d59 [2024-11-07 15:39:20,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:39:20,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:39:20,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:39:20,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:39:20,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:39:20,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4e3988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20, skipping insertion in model container [2024-11-07 15:39:20,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:39:20,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:39:20,792 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:39:20,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:39:20,890 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:39:20,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20 WrapperNode [2024-11-07 15:39:20,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:39:20,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:39:20,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:39:20,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:39:20,897 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:39:20" (1/1) ... [2024-11-07 15:39:20,916 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:39:20" (1/1) ... [2024-11-07 15:39:20,939 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-11-07 15:39:20,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:39:20,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:39:20,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:39:20,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:39:20,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:39:20,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:39:20,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:39:20,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:39:20,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20" (1/1) ... [2024-11-07 15:39:20,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:39:20,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:39:21,032 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:39:21,036 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:39:21,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:39:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:39:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 15:39:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:39:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 15:39:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-07 15:39:21,064 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-07 15:39:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 15:39:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2024-11-07 15:39:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:39:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 15:39:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:39:21,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:39:21,066 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:39:21,194 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:39:21,195 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:39:21,445 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:39:21,446 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:39:21,486 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:39:21,488 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-07 15:39:21,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:39:21 BoogieIcfgContainer [2024-11-07 15:39:21,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:39:21,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:39:21,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:39:21,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:39:21,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:39:20" (1/3) ... [2024-11-07 15:39:21,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c6c24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:39:21, skipping insertion in model container [2024-11-07 15:39:21,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:39:20" (2/3) ... [2024-11-07 15:39:21,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c6c24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:39:21, skipping insertion in model container [2024-11-07 15:39:21,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:39:21" (3/3) ... [2024-11-07 15:39:21,500 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2024-11-07 15:39:21,514 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:39:21,514 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 15:39:21,515 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:39:21,595 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-07 15:39:21,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 144 transitions, 295 flow [2024-11-07 15:39:21,727 INFO L124 PetriNetUnfolderBase]: 23/207 cut-off events. [2024-11-07 15:39:21,729 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:39:21,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 207 events. 23/207 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 659 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 113. Up to 6 conditions per place. [2024-11-07 15:39:21,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 144 transitions, 295 flow [2024-11-07 15:39:21,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 144 transitions, 295 flow [2024-11-07 15:39:21,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:39:21,762 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;@37dd9709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:39:21,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-07 15:39:21,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:39:21,779 INFO L124 PetriNetUnfolderBase]: 4/49 cut-off events. [2024-11-07 15:39:21,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:39:21,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:21,780 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:39:21,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-07 15:39:21,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash -339722752, now seen corresponding path program 1 times [2024-11-07 15:39:21,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:21,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870779499] [2024-11-07 15:39:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:21,981 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:39:21,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:21,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870779499] [2024-11-07 15:39:21,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870779499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:21,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418171224] [2024-11-07 15:39:21,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:21,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:39:21,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:22,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:39:22,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:39:22,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 144 [2024-11-07 15:39:22,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 144 transitions, 295 flow. Second operand has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 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:39:22,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:22,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 144 [2024-11-07 15:39:22,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:22,161 INFO L124 PetriNetUnfolderBase]: 27/367 cut-off events. [2024-11-07 15:39:22,162 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 15:39:22,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 367 events. 27/367 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1446 event pairs, 24 based on Foata normal form. 54/383 useless extension candidates. Maximal degree in co-relation 340. Up to 65 conditions per place. [2024-11-07 15:39:22,167 INFO L140 encePairwiseOnDemand]: 131/144 looper letters, 12 selfloop transitions, 0 changer transitions 0/129 dead transitions. [2024-11-07 15:39:22,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 129 transitions, 289 flow [2024-11-07 15:39:22,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:39:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 15:39:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions. [2024-11-07 15:39:22,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.90625 [2024-11-07 15:39:22,186 INFO L175 Difference]: Start difference. First operand has 132 places, 144 transitions, 295 flow. Second operand 2 states and 261 transitions. [2024-11-07 15:39:22,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 129 transitions, 289 flow [2024-11-07 15:39:22,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:39:22,197 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 265 flow [2024-11-07 15:39:22,200 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=265, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2024-11-07 15:39:22,205 INFO L277 CegarLoopForPetriNet]: 132 programPoint places, -1 predicate places. [2024-11-07 15:39:22,206 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 265 flow [2024-11-07 15:39:22,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 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:39:22,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:22,207 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:39:22,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:39:22,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-07 15:39:22,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash -104795701, now seen corresponding path program 1 times [2024-11-07 15:39:22,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:22,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321717833] [2024-11-07 15:39:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:22,390 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:39:22,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321717833] [2024-11-07 15:39:22,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321717833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:22,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:39:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938870040] [2024-11-07 15:39:22,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:22,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:22,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:22,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:22,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:22,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 144 [2024-11-07 15:39:22,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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:39:22,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:22,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 144 [2024-11-07 15:39:22,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:22,545 INFO L124 PetriNetUnfolderBase]: 55/546 cut-off events. [2024-11-07 15:39:22,546 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 15:39:22,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 546 events. 55/546 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2704 event pairs, 0 based on Foata normal form. 1/490 useless extension candidates. Maximal degree in co-relation 664. Up to 108 conditions per place. [2024-11-07 15:39:22,552 INFO L140 encePairwiseOnDemand]: 141/144 looper letters, 22 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2024-11-07 15:39:22,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 135 transitions, 325 flow [2024-11-07 15:39:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:39:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:39:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-11-07 15:39:22,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8356481481481481 [2024-11-07 15:39:22,558 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 265 flow. Second operand 3 states and 361 transitions. [2024-11-07 15:39:22,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 135 transitions, 325 flow [2024-11-07 15:39:22,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 135 transitions, 325 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:39:22,563 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 273 flow [2024-11-07 15:39:22,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2024-11-07 15:39:22,566 INFO L277 CegarLoopForPetriNet]: 132 programPoint places, 2 predicate places. [2024-11-07 15:39:22,566 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 273 flow [2024-11-07 15:39:22,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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:39:22,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:22,567 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] [2024-11-07 15:39:22,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:39:22,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-07 15:39:22,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:22,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1760864711, now seen corresponding path program 1 times [2024-11-07 15:39:22,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:22,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283335177] [2024-11-07 15:39:22,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:23,128 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:39:23,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:23,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283335177] [2024-11-07 15:39:23,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283335177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:23,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:23,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:39:23,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924200610] [2024-11-07 15:39:23,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:23,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:39:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:39:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:39:23,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 144 [2024-11-07 15:39:23,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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:39:23,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:23,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 144 [2024-11-07 15:39:23,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:23,442 INFO L124 PetriNetUnfolderBase]: 115/660 cut-off events. [2024-11-07 15:39:23,442 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-07 15:39:23,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 660 events. 115/660 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3757 event pairs, 12 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 942. Up to 181 conditions per place. [2024-11-07 15:39:23,448 INFO L140 encePairwiseOnDemand]: 138/144 looper letters, 48 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2024-11-07 15:39:23,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 152 transitions, 425 flow [2024-11-07 15:39:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:39:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:39:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 654 transitions. [2024-11-07 15:39:23,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-11-07 15:39:23,452 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 273 flow. Second operand 6 states and 654 transitions. [2024-11-07 15:39:23,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 152 transitions, 425 flow [2024-11-07 15:39:23,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:39:23,456 INFO L231 Difference]: Finished difference. Result has 136 places, 128 transitions, 277 flow [2024-11-07 15:39:23,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=136, PETRI_TRANSITIONS=128} [2024-11-07 15:39:23,457 INFO L277 CegarLoopForPetriNet]: 132 programPoint places, 4 predicate places. [2024-11-07 15:39:23,457 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 128 transitions, 277 flow [2024-11-07 15:39:23,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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:39:23,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:23,458 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] [2024-11-07 15:39:23,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:39:23,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-07 15:39:23,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1856796326, now seen corresponding path program 1 times [2024-11-07 15:39:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381006419] [2024-11-07 15:39:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:23,532 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:39:23,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:23,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381006419] [2024-11-07 15:39:23,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381006419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:23,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:23,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:23,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451640849] [2024-11-07 15:39:23,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:23,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:23,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:23,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 144 [2024-11-07 15:39:23,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 128 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:39:23,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:23,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 144 [2024-11-07 15:39:23,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:23,694 INFO L124 PetriNetUnfolderBase]: 92/791 cut-off events. [2024-11-07 15:39:23,696 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 15:39:23,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 791 events. 92/791 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4695 event pairs, 30 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1022. Up to 125 conditions per place. [2024-11-07 15:39:23,702 INFO L140 encePairwiseOnDemand]: 135/144 looper letters, 30 selfloop transitions, 6 changer transitions 0/141 dead transitions. [2024-11-07 15:39:23,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 141 transitions, 378 flow [2024-11-07 15:39:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:39:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:39:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2024-11-07 15:39:23,704 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-11-07 15:39:23,704 INFO L175 Difference]: Start difference. First operand has 136 places, 128 transitions, 277 flow. Second operand 3 states and 360 transitions. [2024-11-07 15:39:23,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 141 transitions, 378 flow [2024-11-07 15:39:23,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 141 transitions, 368 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:39:23,710 INFO L231 Difference]: Finished difference. Result has 133 places, 130 transitions, 305 flow [2024-11-07 15:39:23,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=133, PETRI_TRANSITIONS=130} [2024-11-07 15:39:23,712 INFO L277 CegarLoopForPetriNet]: 132 programPoint places, 1 predicate places. [2024-11-07 15:39:23,712 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 305 flow [2024-11-07 15:39:23,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:39:23,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:23,713 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] [2024-11-07 15:39:23,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:39:23,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-07 15:39:23,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:23,714 INFO L85 PathProgramCache]: Analyzing trace with hash -983623192, now seen corresponding path program 1 times [2024-11-07 15:39:23,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:23,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785238070] [2024-11-07 15:39:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:23,763 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:39:23,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:23,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785238070] [2024-11-07 15:39:23,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785238070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:23,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:23,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41050177] [2024-11-07 15:39:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:23,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:23,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:23,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:23,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 144 [2024-11-07 15:39:23,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:39:23,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:23,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 144 [2024-11-07 15:39:23,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:23,923 INFO L124 PetriNetUnfolderBase]: 95/793 cut-off events. [2024-11-07 15:39:23,923 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-11-07 15:39:23,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 793 events. 95/793 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4750 event pairs, 60 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 1121. Up to 189 conditions per place. [2024-11-07 15:39:23,930 INFO L140 encePairwiseOnDemand]: 139/144 looper letters, 27 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2024-11-07 15:39:23,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 137 transitions, 385 flow [2024-11-07 15:39:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:39:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:39:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-11-07 15:39:23,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2024-11-07 15:39:23,931 INFO L175 Difference]: Start difference. First operand has 133 places, 130 transitions, 305 flow. Second operand 3 states and 356 transitions. [2024-11-07 15:39:23,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 137 transitions, 385 flow [2024-11-07 15:39:23,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 137 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:39:23,937 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 325 flow [2024-11-07 15:39:23,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2024-11-07 15:39:23,937 INFO L277 CegarLoopForPetriNet]: 132 programPoint places, 3 predicate places. [2024-11-07 15:39:23,937 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 325 flow [2024-11-07 15:39:23,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:39:23,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:23,938 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:39:23,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:39:23,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-07 15:39:23,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1999974289, now seen corresponding path program 1 times [2024-11-07 15:39:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:23,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234993191] [2024-11-07 15:39:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:39:23,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:39:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:39:24,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:39:24,019 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:39:24,020 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-07 15:39:24,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-07 15:39:24,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-07 15:39:24,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-07 15:39:24,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-07 15:39:24,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-07 15:39:24,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-07 15:39:24,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-07 15:39:24,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-07 15:39:24,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-07 15:39:24,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-07 15:39:24,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-07 15:39:24,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:39:24,023 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 15:39:24,025 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:39:24,025 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-07 15:39:24,052 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 15:39:24,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 193 transitions, 402 flow [2024-11-07 15:39:24,103 INFO L124 PetriNetUnfolderBase]: 40/347 cut-off events. [2024-11-07 15:39:24,104 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 15:39:24,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 347 events. 40/347 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1223 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 209. Up to 9 conditions per place. [2024-11-07 15:39:24,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 193 transitions, 402 flow [2024-11-07 15:39:24,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 193 transitions, 402 flow [2024-11-07 15:39:24,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:39:24,111 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;@37dd9709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:39:24,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-07 15:39:24,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:39:24,115 INFO L124 PetriNetUnfolderBase]: 4/49 cut-off events. [2024-11-07 15:39:24,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:39:24,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:24,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:39:24,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:39:24,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -930480128, now seen corresponding path program 1 times [2024-11-07 15:39:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300938228] [2024-11-07 15:39:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39: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:39:24,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:24,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300938228] [2024-11-07 15:39:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300938228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:24,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:24,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:24,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425483112] [2024-11-07 15:39:24,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:24,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:39:24,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:24,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:39:24,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:39:24,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2024-11-07 15:39:24,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 193 transitions, 402 flow. Second operand has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 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:39:24,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:24,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2024-11-07 15:39:24,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:24,492 INFO L124 PetriNetUnfolderBase]: 421/2602 cut-off events. [2024-11-07 15:39:24,493 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-07 15:39:24,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3361 conditions, 2602 events. 421/2602 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 21186 event pairs, 414 based on Foata normal form. 577/2911 useless extension candidates. Maximal degree in co-relation 2797. Up to 716 conditions per place. [2024-11-07 15:39:24,510 INFO L140 encePairwiseOnDemand]: 174/193 looper letters, 20 selfloop transitions, 0 changer transitions 0/172 dead transitions. [2024-11-07 15:39:24,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 172 transitions, 400 flow [2024-11-07 15:39:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:39:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 15:39:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2024-11-07 15:39:24,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8937823834196891 [2024-11-07 15:39:24,515 INFO L175 Difference]: Start difference. First operand has 176 places, 193 transitions, 402 flow. Second operand 2 states and 345 transitions. [2024-11-07 15:39:24,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 172 transitions, 400 flow [2024-11-07 15:39:24,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:39:24,519 INFO L231 Difference]: Finished difference. Result has 175 places, 172 transitions, 360 flow [2024-11-07 15:39:24,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=175, PETRI_TRANSITIONS=172} [2024-11-07 15:39:24,521 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, -1 predicate places. [2024-11-07 15:39:24,522 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 172 transitions, 360 flow [2024-11-07 15:39:24,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 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:39:24,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:24,523 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:39:24,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:39:24,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:39:24,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash -886944789, now seen corresponding path program 1 times [2024-11-07 15:39:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:24,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275746079] [2024-11-07 15:39:24,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:24,558 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:39:24,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:24,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275746079] [2024-11-07 15:39:24,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275746079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:24,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:24,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:39:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523199667] [2024-11-07 15:39:24,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:24,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:24,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:24,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:24,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 193 [2024-11-07 15:39:24,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 172 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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:39:24,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:24,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 193 [2024-11-07 15:39:24,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:25,112 INFO L124 PetriNetUnfolderBase]: 802/4340 cut-off events. [2024-11-07 15:39:25,113 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-07 15:39:25,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5694 conditions, 4340 events. 802/4340 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 41568 event pairs, 348 based on Foata normal form. 1/3941 useless extension candidates. Maximal degree in co-relation 5689. Up to 1303 conditions per place. [2024-11-07 15:39:25,141 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 31 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2024-11-07 15:39:25,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 179 transitions, 440 flow [2024-11-07 15:39:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:39:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:39:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2024-11-07 15:39:25,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8203799654576857 [2024-11-07 15:39:25,143 INFO L175 Difference]: Start difference. First operand has 175 places, 172 transitions, 360 flow. Second operand 3 states and 475 transitions. [2024-11-07 15:39:25,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 179 transitions, 440 flow [2024-11-07 15:39:25,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 179 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:39:25,147 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 372 flow [2024-11-07 15:39:25,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=178, PETRI_TRANSITIONS=173} [2024-11-07 15:39:25,148 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 2 predicate places. [2024-11-07 15:39:25,148 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 372 flow [2024-11-07 15:39:25,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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:39:25,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:25,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] [2024-11-07 15:39:25,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:39:25,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:39:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1010920344, now seen corresponding path program 1 times [2024-11-07 15:39:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824651455] [2024-11-07 15:39:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:25,461 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:39:25,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824651455] [2024-11-07 15:39:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824651455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:25,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:25,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:39:25,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145377081] [2024-11-07 15:39:25,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:25,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:39:25,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:25,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:39:25,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:39:25,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 193 [2024-11-07 15:39:25,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 173 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:39:25,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:25,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 193 [2024-11-07 15:39:25,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:26,435 INFO L124 PetriNetUnfolderBase]: 1739/6865 cut-off events. [2024-11-07 15:39:26,436 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-11-07 15:39:26,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9836 conditions, 6865 events. 1739/6865 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 68791 event pairs, 760 based on Foata normal form. 0/6164 useless extension candidates. Maximal degree in co-relation 9829. Up to 2015 conditions per place. [2024-11-07 15:39:26,484 INFO L140 encePairwiseOnDemand]: 187/193 looper letters, 80 selfloop transitions, 6 changer transitions 0/220 dead transitions. [2024-11-07 15:39:26,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 220 transitions, 638 flow [2024-11-07 15:39:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:39:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:39:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions. [2024-11-07 15:39:26,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7737478411053541 [2024-11-07 15:39:26,488 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 372 flow. Second operand 6 states and 896 transitions. [2024-11-07 15:39:26,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 220 transitions, 638 flow [2024-11-07 15:39:26,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 220 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:39:26,492 INFO L231 Difference]: Finished difference. Result has 181 places, 172 transitions, 380 flow [2024-11-07 15:39:26,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=181, PETRI_TRANSITIONS=172} [2024-11-07 15:39:26,493 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 5 predicate places. [2024-11-07 15:39:26,493 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 172 transitions, 380 flow [2024-11-07 15:39:26,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:39:26,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:26,494 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] [2024-11-07 15:39:26,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:39:26,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:39:26,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1827650231, now seen corresponding path program 1 times [2024-11-07 15:39:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:26,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145601620] [2024-11-07 15:39:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:26,574 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:39:26,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:26,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145601620] [2024-11-07 15:39:26,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145601620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:26,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:26,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5553000] [2024-11-07 15:39:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:26,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:26,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:26,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 193 [2024-11-07 15:39:26,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 172 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:39:26,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:26,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 193 [2024-11-07 15:39:26,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:28,236 INFO L124 PetriNetUnfolderBase]: 4085/14792 cut-off events. [2024-11-07 15:39:28,236 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-11-07 15:39:28,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21539 conditions, 14792 events. 4085/14792 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 164322 event pairs, 1409 based on Foata normal form. 0/13243 useless extension candidates. Maximal degree in co-relation 21532. Up to 3578 conditions per place. [2024-11-07 15:39:28,326 INFO L140 encePairwiseOnDemand]: 174/193 looper letters, 58 selfloop transitions, 14 changer transitions 0/205 dead transitions. [2024-11-07 15:39:28,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 205 transitions, 601 flow [2024-11-07 15:39:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:39:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:39:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2024-11-07 15:39:28,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8272884283246977 [2024-11-07 15:39:28,329 INFO L175 Difference]: Start difference. First operand has 181 places, 172 transitions, 380 flow. Second operand 3 states and 479 transitions. [2024-11-07 15:39:28,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 205 transitions, 601 flow [2024-11-07 15:39:28,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 205 transitions, 589 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:39:28,333 INFO L231 Difference]: Finished difference. Result has 180 places, 186 transitions, 490 flow [2024-11-07 15:39:28,333 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=180, PETRI_TRANSITIONS=186} [2024-11-07 15:39:28,334 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 4 predicate places. [2024-11-07 15:39:28,334 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 186 transitions, 490 flow [2024-11-07 15:39:28,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:39:28,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:28,334 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] [2024-11-07 15:39:28,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:39:28,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:39:28,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash 909106138, now seen corresponding path program 1 times [2024-11-07 15:39:28,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:28,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230373095] [2024-11-07 15:39:28,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:28,370 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:39:28,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:28,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230373095] [2024-11-07 15:39:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230373095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:28,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:28,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:28,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034033069] [2024-11-07 15:39:28,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:28,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:28,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:28,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:28,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2024-11-07 15:39:28,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 186 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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:39:28,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:28,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2024-11-07 15:39:28,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:29,964 INFO L124 PetriNetUnfolderBase]: 4151/16635 cut-off events. [2024-11-07 15:39:29,964 INFO L125 PetriNetUnfolderBase]: For 4322/4497 co-relation queries the response was YES. [2024-11-07 15:39:30,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27453 conditions, 16635 events. 4151/16635 cut-off events. For 4322/4497 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 195215 event pairs, 2411 based on Foata normal form. 46/15100 useless extension candidates. Maximal degree in co-relation 27445. Up to 5625 conditions per place. [2024-11-07 15:39:30,089 INFO L140 encePairwiseOnDemand]: 184/193 looper letters, 52 selfloop transitions, 14 changer transitions 0/210 dead transitions. [2024-11-07 15:39:30,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 210 transitions, 708 flow [2024-11-07 15:39:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:39:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:39:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2024-11-07 15:39:30,092 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8169257340241797 [2024-11-07 15:39:30,092 INFO L175 Difference]: Start difference. First operand has 180 places, 186 transitions, 490 flow. Second operand 3 states and 473 transitions. [2024-11-07 15:39:30,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 210 transitions, 708 flow [2024-11-07 15:39:30,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 210 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:39:30,106 INFO L231 Difference]: Finished difference. Result has 182 places, 198 transitions, 588 flow [2024-11-07 15:39:30,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=182, PETRI_TRANSITIONS=198} [2024-11-07 15:39:30,107 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 6 predicate places. [2024-11-07 15:39:30,107 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 198 transitions, 588 flow [2024-11-07 15:39:30,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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:39:30,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:30,107 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] [2024-11-07 15:39:30,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:39:30,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:39:30,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:30,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1460415895, now seen corresponding path program 1 times [2024-11-07 15:39:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:30,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981231169] [2024-11-07 15:39:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:30,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:39:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:30,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981231169] [2024-11-07 15:39:30,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981231169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:39:30,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545352413] [2024-11-07 15:39:30,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:30,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:39:30,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:39:30,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:39:30,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 15:39:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:30,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 15:39:30,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:39:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:39:30,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:39:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:39:30,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545352413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:39:30,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:39:30,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-07 15:39:30,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524118337] [2024-11-07 15:39:30,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:39:30,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:39:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:30,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:39:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:39:30,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 193 [2024-11-07 15:39:30,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 198 transitions, 588 flow. Second operand has 10 states, 10 states have (on average 146.5) internal successors, (1465), 10 states have internal predecessors, (1465), 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:39:30,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:30,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 193 [2024-11-07 15:39:30,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:30,988 INFO L124 PetriNetUnfolderBase]: 762/3672 cut-off events. [2024-11-07 15:39:30,988 INFO L125 PetriNetUnfolderBase]: For 511/522 co-relation queries the response was YES. [2024-11-07 15:39:30,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5704 conditions, 3672 events. 762/3672 cut-off events. For 511/522 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 33068 event pairs, 75 based on Foata normal form. 105/3541 useless extension candidates. Maximal degree in co-relation 5695. Up to 478 conditions per place. [2024-11-07 15:39:31,011 INFO L140 encePairwiseOnDemand]: 188/193 looper letters, 72 selfloop transitions, 7 changer transitions 0/202 dead transitions. [2024-11-07 15:39:31,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 202 transitions, 708 flow [2024-11-07 15:39:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:39:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 15:39:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1377 transitions. [2024-11-07 15:39:31,015 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7927461139896373 [2024-11-07 15:39:31,016 INFO L175 Difference]: Start difference. First operand has 182 places, 198 transitions, 588 flow. Second operand 9 states and 1377 transitions. [2024-11-07 15:39:31,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 202 transitions, 708 flow [2024-11-07 15:39:31,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 202 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:39:31,023 INFO L231 Difference]: Finished difference. Result has 143 places, 146 transitions, 432 flow [2024-11-07 15:39:31,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=432, PETRI_PLACES=143, PETRI_TRANSITIONS=146} [2024-11-07 15:39:31,024 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, -33 predicate places. [2024-11-07 15:39:31,024 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 146 transitions, 432 flow [2024-11-07 15:39:31,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.5) internal successors, (1465), 10 states have internal predecessors, (1465), 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:39:31,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:31,026 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:39:31,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 15:39:31,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 15:39:31,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:39:31,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash -685547369, now seen corresponding path program 1 times [2024-11-07 15:39:31,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:31,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951965531] [2024-11-07 15:39:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 15:39:31,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:31,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951965531] [2024-11-07 15:39:31,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951965531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:31,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:31,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:31,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686628002] [2024-11-07 15:39:31,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:31,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:31,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:31,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:31,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2024-11-07 15:39:31,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 146 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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:39:31,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:31,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2024-11-07 15:39:31,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:31,508 INFO L124 PetriNetUnfolderBase]: 260/1287 cut-off events. [2024-11-07 15:39:31,509 INFO L125 PetriNetUnfolderBase]: For 454/475 co-relation queries the response was YES. [2024-11-07 15:39:31,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2333 conditions, 1287 events. 260/1287 cut-off events. For 454/475 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8696 event pairs, 132 based on Foata normal form. 7/1202 useless extension candidates. Maximal degree in co-relation 2324. Up to 459 conditions per place. [2024-11-07 15:39:31,521 INFO L140 encePairwiseOnDemand]: 185/193 looper letters, 42 selfloop transitions, 12 changer transitions 0/160 dead transitions. [2024-11-07 15:39:31,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 160 transitions, 584 flow [2024-11-07 15:39:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:39:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:39:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2024-11-07 15:39:31,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7927461139896373 [2024-11-07 15:39:31,523 INFO L175 Difference]: Start difference. First operand has 143 places, 146 transitions, 432 flow. Second operand 3 states and 459 transitions. [2024-11-07 15:39:31,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 160 transitions, 584 flow [2024-11-07 15:39:31,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 160 transitions, 569 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-07 15:39:31,529 INFO L231 Difference]: Finished difference. Result has 142 places, 154 transitions, 515 flow [2024-11-07 15:39:31,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=142, PETRI_TRANSITIONS=154} [2024-11-07 15:39:31,530 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, -34 predicate places. [2024-11-07 15:39:31,530 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 154 transitions, 515 flow [2024-11-07 15:39:31,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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:39:31,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:31,531 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] [2024-11-07 15:39:31,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:39:31,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:39:31,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1241489000, now seen corresponding path program 1 times [2024-11-07 15:39:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:31,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851987467] [2024-11-07 15:39:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:31,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:31,580 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:39:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851987467] [2024-11-07 15:39:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851987467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:31,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515985137] [2024-11-07 15:39:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:31,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:31,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:31,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:31,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:31,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2024-11-07 15:39:31,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 154 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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:39:31,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:31,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2024-11-07 15:39:31,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:31,855 INFO L124 PetriNetUnfolderBase]: 291/1359 cut-off events. [2024-11-07 15:39:31,855 INFO L125 PetriNetUnfolderBase]: For 1124/1159 co-relation queries the response was YES. [2024-11-07 15:39:31,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1359 events. 291/1359 cut-off events. For 1124/1159 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9379 event pairs, 134 based on Foata normal form. 9/1292 useless extension candidates. Maximal degree in co-relation 2778. Up to 501 conditions per place. [2024-11-07 15:39:31,863 INFO L140 encePairwiseOnDemand]: 185/193 looper letters, 49 selfloop transitions, 12 changer transitions 0/169 dead transitions. [2024-11-07 15:39:31,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 169 transitions, 704 flow [2024-11-07 15:39:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:39:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:39:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2024-11-07 15:39:31,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7944732297063903 [2024-11-07 15:39:31,865 INFO L175 Difference]: Start difference. First operand has 142 places, 154 transitions, 515 flow. Second operand 3 states and 460 transitions. [2024-11-07 15:39:31,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 169 transitions, 704 flow [2024-11-07 15:39:31,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 169 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:39:31,870 INFO L231 Difference]: Finished difference. Result has 144 places, 162 transitions, 601 flow [2024-11-07 15:39:31,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=144, PETRI_TRANSITIONS=162} [2024-11-07 15:39:31,871 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, -32 predicate places. [2024-11-07 15:39:31,871 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 162 transitions, 601 flow [2024-11-07 15:39:31,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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:39:31,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:31,872 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:39:31,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:39:31,872 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:39:31,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:31,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1863380673, now seen corresponding path program 1 times [2024-11-07 15:39:31,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:31,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326701917] [2024-11-07 15:39:31,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:31,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:39:31,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:39:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:39:31,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:39:31,911 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:39:31,912 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-07 15:39:31,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-07 15:39:31,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-07 15:39:31,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-07 15:39:31,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-07 15:39:31,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-07 15:39:31,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-07 15:39:31,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-07 15:39:31,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-07 15:39:31,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-07 15:39:31,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-07 15:39:31,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-07 15:39:31,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-07 15:39:31,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-07 15:39:31,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-07 15:39:31,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-07 15:39:31,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:39:31,913 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:39:31,914 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:39:31,914 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-07 15:39:31,941 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-07 15:39:31,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 242 transitions, 511 flow [2024-11-07 15:39:31,986 INFO L124 PetriNetUnfolderBase]: 62/532 cut-off events. [2024-11-07 15:39:31,986 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-07 15:39:31,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 532 events. 62/532 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2051 event pairs, 1 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 355. Up to 16 conditions per place. [2024-11-07 15:39:31,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 242 transitions, 511 flow [2024-11-07 15:39:31,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 242 transitions, 511 flow [2024-11-07 15:39:31,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:39:31,998 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;@37dd9709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:39:31,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-07 15:39:32,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:39:32,000 INFO L124 PetriNetUnfolderBase]: 4/49 cut-off events. [2024-11-07 15:39:32,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:39:32,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:32,000 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:39:32,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-07 15:39:32,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:32,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1938267136, now seen corresponding path program 1 times [2024-11-07 15:39:32,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:32,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359524849] [2024-11-07 15:39:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:32,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:32,020 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:39:32,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:32,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359524849] [2024-11-07 15:39:32,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359524849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:32,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:32,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:32,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53657341] [2024-11-07 15:39:32,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:32,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:39:32,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:32,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:39:32,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:39:32,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 242 [2024-11-07 15:39:32,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 242 transitions, 511 flow. Second operand has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 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:39:32,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:32,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 242 [2024-11-07 15:39:32,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:33,697 INFO L124 PetriNetUnfolderBase]: 4833/20255 cut-off events. [2024-11-07 15:39:33,697 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2024-11-07 15:39:33,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27680 conditions, 20255 events. 4833/20255 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 243219 event pairs, 4795 based on Foata normal form. 5465/23774 useless extension candidates. Maximal degree in co-relation 23268. Up to 6995 conditions per place. [2024-11-07 15:39:33,835 INFO L140 encePairwiseOnDemand]: 217/242 looper letters, 28 selfloop transitions, 0 changer transitions 0/215 dead transitions. [2024-11-07 15:39:33,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 513 flow [2024-11-07 15:39:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:39:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-07 15:39:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 429 transitions. [2024-11-07 15:39:33,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2024-11-07 15:39:33,837 INFO L175 Difference]: Start difference. First operand has 220 places, 242 transitions, 511 flow. Second operand 2 states and 429 transitions. [2024-11-07 15:39:33,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 513 flow [2024-11-07 15:39:33,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 513 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:39:33,841 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 457 flow [2024-11-07 15:39:33,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=457, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2024-11-07 15:39:33,842 INFO L277 CegarLoopForPetriNet]: 220 programPoint places, -1 predicate places. [2024-11-07 15:39:33,842 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 457 flow [2024-11-07 15:39:33,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 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:39:33,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:33,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:39:33,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:39:33,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-07 15:39:33,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:33,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1292357163, now seen corresponding path program 1 times [2024-11-07 15:39:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:33,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045443339] [2024-11-07 15:39:33,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:33,873 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:39:33,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045443339] [2024-11-07 15:39:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045443339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:33,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:33,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:39:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273542326] [2024-11-07 15:39:33,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:33,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:33,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:33,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:33,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:33,898 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 242 [2024-11-07 15:39:33,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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:39:33,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:33,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 242 [2024-11-07 15:39:33,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:37,047 INFO L124 PetriNetUnfolderBase]: 8969/35405 cut-off events. [2024-11-07 15:39:37,047 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-11-07 15:39:37,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48644 conditions, 35405 events. 8969/35405 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 458373 event pairs, 8324 based on Foata normal form. 1/32003 useless extension candidates. Maximal degree in co-relation 48638. Up to 12802 conditions per place. [2024-11-07 15:39:37,242 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 39 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-11-07 15:39:37,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 222 transitions, 553 flow [2024-11-07 15:39:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:39:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:39:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2024-11-07 15:39:37,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8099173553719008 [2024-11-07 15:39:37,244 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 457 flow. Second operand 3 states and 588 transitions. [2024-11-07 15:39:37,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 222 transitions, 553 flow [2024-11-07 15:39:37,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:39:37,249 INFO L231 Difference]: Finished difference. Result has 222 places, 216 transitions, 469 flow [2024-11-07 15:39:37,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=222, PETRI_TRANSITIONS=216} [2024-11-07 15:39:37,250 INFO L277 CegarLoopForPetriNet]: 220 programPoint places, 2 predicate places. [2024-11-07 15:39:37,250 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 216 transitions, 469 flow [2024-11-07 15:39:37,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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:39:37,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:37,251 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] [2024-11-07 15:39:37,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:39:37,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-07 15:39:37,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2122930970, now seen corresponding path program 1 times [2024-11-07 15:39:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:37,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499771820] [2024-11-07 15:39:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:37,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:37,612 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:39:37,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:37,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499771820] [2024-11-07 15:39:37,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499771820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:37,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:37,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:39:37,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674042576] [2024-11-07 15:39:37,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:37,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:39:37,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:37,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:39:37,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:39:37,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 242 [2024-11-07 15:39:37,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 216 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 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:39:37,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:37,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 242 [2024-11-07 15:39:37,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:43,882 INFO L124 PetriNetUnfolderBase]: 19695/66075 cut-off events. [2024-11-07 15:39:43,882 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2024-11-07 15:39:44,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95001 conditions, 66075 events. 19695/66075 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 1355. Compared 893559 event pairs, 7382 based on Foata normal form. 0/60323 useless extension candidates. Maximal degree in co-relation 94993. Up to 20118 conditions per place. [2024-11-07 15:39:44,249 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 112 selfloop transitions, 6 changer transitions 0/287 dead transitions. [2024-11-07 15:39:44,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 287 transitions, 847 flow [2024-11-07 15:39:44,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:39:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:39:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1138 transitions. [2024-11-07 15:39:44,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7837465564738292 [2024-11-07 15:39:44,252 INFO L175 Difference]: Start difference. First operand has 222 places, 216 transitions, 469 flow. Second operand 6 states and 1138 transitions. [2024-11-07 15:39:44,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 287 transitions, 847 flow [2024-11-07 15:39:44,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 287 transitions, 845 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:39:44,258 INFO L231 Difference]: Finished difference. Result has 225 places, 215 transitions, 477 flow [2024-11-07 15:39:44,258 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=225, PETRI_TRANSITIONS=215} [2024-11-07 15:39:44,259 INFO L277 CegarLoopForPetriNet]: 220 programPoint places, 5 predicate places. [2024-11-07 15:39:44,259 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 215 transitions, 477 flow [2024-11-07 15:39:44,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 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:39:44,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:44,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] [2024-11-07 15:39:44,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:39:44,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-07 15:39:44,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2072502008, now seen corresponding path program 1 times [2024-11-07 15:39:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730448004] [2024-11-07 15:39:44,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:44,286 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:39:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730448004] [2024-11-07 15:39:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730448004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:44,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:44,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:44,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476939354] [2024-11-07 15:39:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:44,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:44,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:44,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:44,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 242 [2024-11-07 15:39:44,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 215 transitions, 477 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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:39:44,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:44,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 242 [2024-11-07 15:39:44,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand