./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_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_05-lockfuns_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', '1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5'] 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_05-lockfuns_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 1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:38:14,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:38:14,507 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:38:14,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:38:14,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:38:14,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:38:14,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:38:14,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:38:14,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:38:14,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:38:14,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:38:14,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:38:14,555 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:38:14,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:38:14,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:38:14,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:38:14,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:38:14,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:38:14,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:38:14,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:38:14,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:38:14,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:38:14,557 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:38:14,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:38:14,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:38:14,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:38:14,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:38:14,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:38:14,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:38:14,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:38:14,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:38:14,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:38:14,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:38:14,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:38:14,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:38:14,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:38:14,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:38:14,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:38:14,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:38:14,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:38:14,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:38:14,560 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 -> 1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5 [2024-11-07 15:38:15,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:38:15,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:38:15,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:38:15,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:38:15,041 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:38:15,043 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_05-lockfuns_racefree.i [2024-11-07 15:38:16,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:38:17,360 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:38:17,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i [2024-11-07 15:38:17,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7d1e023b/effc6f252a59418b982f9d355200ebe9/FLAGd66036acf [2024-11-07 15:38:17,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7d1e023b/effc6f252a59418b982f9d355200ebe9 [2024-11-07 15:38:17,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:38:17,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:38:17,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:38:17,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:38:17,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:38:17,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:38:17" (1/1) ... [2024-11-07 15:38:17,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fab6fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:17, skipping insertion in model container [2024-11-07 15:38:17,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:38:17" (1/1) ... [2024-11-07 15:38:17,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:38:17,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:38:17,905 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:38:17,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:38:18,011 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:38:18,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18 WrapperNode [2024-11-07 15:38:18,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:38:18,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:38:18,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:38:18,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:38:18,018 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:38:18" (1/1) ... [2024-11-07 15:38:18,036 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:38:18" (1/1) ... [2024-11-07 15:38:18,069 INFO L138 Inliner]: procedures = 173, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-07 15:38:18,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:38:18,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:38:18,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:38:18,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:38:18,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18" (1/1) ... [2024-11-07 15:38:18,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18" (1/1) ... [2024-11-07 15:38:18,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18" (1/1) ... [2024-11-07 15:38:18,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18" (1/1) ... [2024-11-07 15:38:18,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18" (1/1) ... [2024-11-07 15:38:18,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18" (1/1) ... [2024-11-07 15:38:18,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18" (1/1) ... [2024-11-07 15:38:18,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18" (1/1) ... [2024-11-07 15:38:18,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:38:18,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:38:18,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:38:18,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:38:18,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18" (1/1) ... [2024-11-07 15:38:18,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:38:18,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:38:18,168 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:38:18,183 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:38:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:38:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:38:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 15:38:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:38:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 15:38:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-07 15:38:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-07 15:38:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 15:38:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:38:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 15:38:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:38:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:38:18,236 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:38:18,404 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:38:18,406 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:38:18,704 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:38:18,704 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:38:18,748 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:38:18,748 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-07 15:38:18,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:38:18 BoogieIcfgContainer [2024-11-07 15:38:18,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:38:18,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:38:18,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:38:18,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:38:18,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:38:17" (1/3) ... [2024-11-07 15:38:18,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a01b058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:38:18, skipping insertion in model container [2024-11-07 15:38:18,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:38:18" (2/3) ... [2024-11-07 15:38:18,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a01b058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:38:18, skipping insertion in model container [2024-11-07 15:38:18,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:38:18" (3/3) ... [2024-11-07 15:38:18,760 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_05-lockfuns_racefree.i [2024-11-07 15:38:18,774 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:38:18,775 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 15:38:18,775 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:38:18,899 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-07 15:38:18,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 148 transitions, 303 flow [2024-11-07 15:38:19,045 INFO L124 PetriNetUnfolderBase]: 19/211 cut-off events. [2024-11-07 15:38:19,047 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:38:19,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 211 events. 19/211 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 651 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 117. Up to 4 conditions per place. [2024-11-07 15:38:19,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 148 transitions, 303 flow [2024-11-07 15:38:19,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 148 transitions, 303 flow [2024-11-07 15:38:19,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:38:19,079 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;@70b99cad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:38:19,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-07 15:38:19,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:38:19,103 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-11-07 15:38:19,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:38:19,104 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:19,104 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:38:19,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-07 15:38:19,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1574672023, now seen corresponding path program 1 times [2024-11-07 15:38:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480732220] [2024-11-07 15:38:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:20,099 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:38:20,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:20,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480732220] [2024-11-07 15:38:20,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480732220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:38:20,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:38:20,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:38:20,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908273106] [2024-11-07 15:38:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:38:20,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:38:20,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:20,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:38:20,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:38:20,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 148 [2024-11-07 15:38:20,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 148 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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:38:20,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:20,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 148 [2024-11-07 15:38:20,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:38:20,600 INFO L124 PetriNetUnfolderBase]: 109/637 cut-off events. [2024-11-07 15:38:20,600 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:38:20,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 637 events. 109/637 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3765 event pairs, 12 based on Foata normal form. 116/701 useless extension candidates. Maximal degree in co-relation 786. Up to 186 conditions per place. [2024-11-07 15:38:20,606 INFO L140 encePairwiseOnDemand]: 130/148 looper letters, 48 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2024-11-07 15:38:20,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 157 transitions, 427 flow [2024-11-07 15:38:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:38:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:38:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 720 transitions. [2024-11-07 15:38:20,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8108108108108109 [2024-11-07 15:38:20,625 INFO L175 Difference]: Start difference. First operand has 138 places, 148 transitions, 303 flow. Second operand 6 states and 720 transitions. [2024-11-07 15:38:20,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 157 transitions, 427 flow [2024-11-07 15:38:20,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 157 transitions, 427 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:38:20,641 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 283 flow [2024-11-07 15:38:20,643 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2024-11-07 15:38:20,647 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2024-11-07 15:38:20,647 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 283 flow [2024-11-07 15:38:20,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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:38:20,647 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:20,647 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:38:20,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:38:20,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-07 15:38:20,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1940040889, now seen corresponding path program 1 times [2024-11-07 15:38:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098729924] [2024-11-07 15:38:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:20,769 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:38:20,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:20,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098729924] [2024-11-07 15:38:20,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098729924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:38:20,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:38:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:38:20,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755408888] [2024-11-07 15:38:20,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:38:20,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:38:20,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:20,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:38:20,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:38:20,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-11-07 15:38:20,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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:38:20,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:20,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-11-07 15:38:20,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:38:21,026 INFO L124 PetriNetUnfolderBase]: 48/523 cut-off events. [2024-11-07 15:38:21,033 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-07 15:38:21,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 523 events. 48/523 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2466 event pairs, 35 based on Foata normal form. 1/475 useless extension candidates. Maximal degree in co-relation 590. Up to 108 conditions per place. [2024-11-07 15:38:21,044 INFO L140 encePairwiseOnDemand]: 145/148 looper letters, 22 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2024-11-07 15:38:21,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 139 transitions, 343 flow [2024-11-07 15:38:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:38:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:38:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2024-11-07 15:38:21,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8468468468468469 [2024-11-07 15:38:21,048 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 283 flow. Second operand 3 states and 376 transitions. [2024-11-07 15:38:21,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 139 transitions, 343 flow [2024-11-07 15:38:21,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 139 transitions, 333 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:38:21,064 INFO L231 Difference]: Finished difference. Result has 138 places, 133 transitions, 281 flow [2024-11-07 15:38:21,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=138, PETRI_TRANSITIONS=133} [2024-11-07 15:38:21,069 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 0 predicate places. [2024-11-07 15:38:21,070 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 133 transitions, 281 flow [2024-11-07 15:38:21,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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:38:21,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:21,070 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] [2024-11-07 15:38:21,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:38:21,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-07 15:38:21,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1208707053, now seen corresponding path program 1 times [2024-11-07 15:38:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:21,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625240610] [2024-11-07 15:38:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:21,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:21,163 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:38:21,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:21,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625240610] [2024-11-07 15:38:21,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625240610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:38:21,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:38:21,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:38:21,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129018984] [2024-11-07 15:38:21,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:38:21,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:38:21,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:21,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:38:21,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:38:21,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 148 [2024-11-07 15:38:21,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 133 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:38:21,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:21,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 148 [2024-11-07 15:38:21,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:38:21,383 INFO L124 PetriNetUnfolderBase]: 91/830 cut-off events. [2024-11-07 15:38:21,384 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-07 15:38:21,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 830 events. 91/830 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4957 event pairs, 30 based on Foata normal form. 0/761 useless extension candidates. Maximal degree in co-relation 1010. Up to 125 conditions per place. [2024-11-07 15:38:21,391 INFO L140 encePairwiseOnDemand]: 139/148 looper letters, 30 selfloop transitions, 6 changer transitions 0/146 dead transitions. [2024-11-07 15:38:21,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 146 transitions, 382 flow [2024-11-07 15:38:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:38:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:38:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2024-11-07 15:38:21,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8445945945945946 [2024-11-07 15:38:21,393 INFO L175 Difference]: Start difference. First operand has 138 places, 133 transitions, 281 flow. Second operand 3 states and 375 transitions. [2024-11-07 15:38:21,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 146 transitions, 382 flow [2024-11-07 15:38:21,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 146 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:38:21,397 INFO L231 Difference]: Finished difference. Result has 138 places, 135 transitions, 315 flow [2024-11-07 15:38:21,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=138, PETRI_TRANSITIONS=135} [2024-11-07 15:38:21,398 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 0 predicate places. [2024-11-07 15:38:21,398 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 135 transitions, 315 flow [2024-11-07 15:38:21,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:38:21,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:21,399 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:38:21,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:38:21,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-07 15:38:21,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash 900544954, now seen corresponding path program 1 times [2024-11-07 15:38:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849704494] [2024-11-07 15:38:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:38:21,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:38:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:38:21,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:38:21,492 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:38:21,493 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-07 15:38:21,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-07 15:38:21,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-07 15:38:21,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-07 15:38:21,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-07 15:38:21,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-07 15:38:21,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-07 15:38:21,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-07 15:38:21,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-07 15:38:21,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-07 15:38:21,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-07 15:38:21,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-07 15:38:21,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:38:21,498 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 15:38:21,500 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:38:21,500 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-07 15:38:21,539 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 15:38:21,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 201 transitions, 418 flow [2024-11-07 15:38:21,604 INFO L124 PetriNetUnfolderBase]: 34/355 cut-off events. [2024-11-07 15:38:21,604 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 15:38:21,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 355 events. 34/355 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1268 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 213. Up to 8 conditions per place. [2024-11-07 15:38:21,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 201 transitions, 418 flow [2024-11-07 15:38:21,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 201 transitions, 418 flow [2024-11-07 15:38:21,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:38:21,615 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;@70b99cad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:38:21,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-07 15:38:21,623 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:38:21,623 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-11-07 15:38:21,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:38:21,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:21,626 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:38:21,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:38:21,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash 468291648, now seen corresponding path program 1 times [2024-11-07 15:38:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:21,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336288271] [2024-11-07 15:38:21,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:21,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:22,098 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:38:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336288271] [2024-11-07 15:38:22,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336288271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:38:22,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:38:22,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:38:22,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794954935] [2024-11-07 15:38:22,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:38:22,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:38:22,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:22,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:38:22,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:38:22,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 201 [2024-11-07 15:38:22,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 201 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 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:38:22,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:22,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 201 [2024-11-07 15:38:22,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:38:23,588 INFO L124 PetriNetUnfolderBase]: 1724/7651 cut-off events. [2024-11-07 15:38:23,589 INFO L125 PetriNetUnfolderBase]: For 69/86 co-relation queries the response was YES. [2024-11-07 15:38:23,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10556 conditions, 7651 events. 1724/7651 cut-off events. For 69/86 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 79186 event pairs, 844 based on Foata normal form. 1383/8275 useless extension candidates. Maximal degree in co-relation 3207. Up to 2030 conditions per place. [2024-11-07 15:38:23,638 INFO L140 encePairwiseOnDemand]: 177/201 looper letters, 80 selfloop transitions, 5 changer transitions 0/228 dead transitions. [2024-11-07 15:38:23,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 228 transitions, 642 flow [2024-11-07 15:38:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:38:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:38:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1016 transitions. [2024-11-07 15:38:23,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8424543946932007 [2024-11-07 15:38:23,642 INFO L175 Difference]: Start difference. First operand has 186 places, 201 transitions, 418 flow. Second operand 6 states and 1016 transitions. [2024-11-07 15:38:23,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 228 transitions, 642 flow [2024-11-07 15:38:23,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 228 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:38:23,646 INFO L231 Difference]: Finished difference. Result has 188 places, 180 transitions, 386 flow [2024-11-07 15:38:23,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=188, PETRI_TRANSITIONS=180} [2024-11-07 15:38:23,648 INFO L277 CegarLoopForPetriNet]: 186 programPoint places, 2 predicate places. [2024-11-07 15:38:23,648 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 180 transitions, 386 flow [2024-11-07 15:38:23,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 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:38:23,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:23,649 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:38:23,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:38:23,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:38:23,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:23,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1248546032, now seen corresponding path program 1 times [2024-11-07 15:38:23,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:23,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051462540] [2024-11-07 15:38:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:23,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:23,691 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:38:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:23,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051462540] [2024-11-07 15:38:23,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051462540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:38:23,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:38:23,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:38:23,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779678977] [2024-11-07 15:38:23,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:38:23,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:38:23,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:23,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:38:23,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:38:23,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 201 [2024-11-07 15:38:23,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 180 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:38:23,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:23,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 201 [2024-11-07 15:38:23,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:38:24,371 INFO L124 PetriNetUnfolderBase]: 788/4609 cut-off events. [2024-11-07 15:38:24,372 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-07 15:38:24,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6207 conditions, 4609 events. 788/4609 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 44003 event pairs, 703 based on Foata normal form. 1/4183 useless extension candidates. Maximal degree in co-relation 4654. Up to 1303 conditions per place. [2024-11-07 15:38:24,412 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 31 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2024-11-07 15:38:24,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 187 transitions, 468 flow [2024-11-07 15:38:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:38:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:38:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2024-11-07 15:38:24,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8325041459369817 [2024-11-07 15:38:24,415 INFO L175 Difference]: Start difference. First operand has 188 places, 180 transitions, 386 flow. Second operand 3 states and 502 transitions. [2024-11-07 15:38:24,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 187 transitions, 468 flow [2024-11-07 15:38:24,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 187 transitions, 456 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:38:24,422 INFO L231 Difference]: Finished difference. Result has 186 places, 181 transitions, 388 flow [2024-11-07 15:38:24,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=186, PETRI_TRANSITIONS=181} [2024-11-07 15:38:24,424 INFO L277 CegarLoopForPetriNet]: 186 programPoint places, 0 predicate places. [2024-11-07 15:38:24,424 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 181 transitions, 388 flow [2024-11-07 15:38:24,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:38:24,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:24,425 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:38:24,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:38:24,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:38:24,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1050030490, now seen corresponding path program 1 times [2024-11-07 15:38:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:24,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742699468] [2024-11-07 15:38:24,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:24,476 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:38:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:24,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742699468] [2024-11-07 15:38:24,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742699468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:38:24,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:38:24,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:38:24,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458913186] [2024-11-07 15:38:24,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:38:24,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:38:24,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:24,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:38:24,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:38:24,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 201 [2024-11-07 15:38:24,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 181 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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:38:24,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:24,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 201 [2024-11-07 15:38:24,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:38:26,291 INFO L124 PetriNetUnfolderBase]: 3895/15099 cut-off events. [2024-11-07 15:38:26,291 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-11-07 15:38:26,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21639 conditions, 15099 events. 3895/15099 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 172273 event pairs, 1409 based on Foata normal form. 0/13576 useless extension candidates. Maximal degree in co-relation 21589. Up to 3516 conditions per place. [2024-11-07 15:38:26,381 INFO L140 encePairwiseOnDemand]: 182/201 looper letters, 58 selfloop transitions, 14 changer transitions 0/214 dead transitions. [2024-11-07 15:38:26,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 214 transitions, 609 flow [2024-11-07 15:38:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:38:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:38:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-07 15:38:26,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8391376451077943 [2024-11-07 15:38:26,384 INFO L175 Difference]: Start difference. First operand has 186 places, 181 transitions, 388 flow. Second operand 3 states and 506 transitions. [2024-11-07 15:38:26,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 214 transitions, 609 flow [2024-11-07 15:38:26,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 214 transitions, 607 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:38:26,388 INFO L231 Difference]: Finished difference. Result has 189 places, 195 transitions, 508 flow [2024-11-07 15:38:26,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=189, PETRI_TRANSITIONS=195} [2024-11-07 15:38:26,389 INFO L277 CegarLoopForPetriNet]: 186 programPoint places, 3 predicate places. [2024-11-07 15:38:26,389 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 195 transitions, 508 flow [2024-11-07 15:38:26,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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:38:26,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:26,390 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] [2024-11-07 15:38:26,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:38:26,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:38:26,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash 297492844, now seen corresponding path program 1 times [2024-11-07 15:38:26,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:26,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242460975] [2024-11-07 15:38:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:26,433 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:38:26,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:26,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242460975] [2024-11-07 15:38:26,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242460975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:38:26,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:38:26,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:38:26,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895683841] [2024-11-07 15:38:26,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:38:26,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:38:26,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:26,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:38:26,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:38:26,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 201 [2024-11-07 15:38:26,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 195 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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:38:26,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:26,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 201 [2024-11-07 15:38:26,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:38:28,849 INFO L124 PetriNetUnfolderBase]: 4045/17167 cut-off events. [2024-11-07 15:38:28,849 INFO L125 PetriNetUnfolderBase]: For 4377/4541 co-relation queries the response was YES. [2024-11-07 15:38:28,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27922 conditions, 17167 events. 4045/17167 cut-off events. For 4377/4541 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 205513 event pairs, 2517 based on Foata normal form. 46/15665 useless extension candidates. Maximal degree in co-relation 26605. Up to 5540 conditions per place. [2024-11-07 15:38:28,953 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 52 selfloop transitions, 14 changer transitions 0/219 dead transitions. [2024-11-07 15:38:28,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 219 transitions, 726 flow [2024-11-07 15:38:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:38:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:38:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2024-11-07 15:38:28,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8291873963515755 [2024-11-07 15:38:28,955 INFO L175 Difference]: Start difference. First operand has 189 places, 195 transitions, 508 flow. Second operand 3 states and 500 transitions. [2024-11-07 15:38:28,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 219 transitions, 726 flow [2024-11-07 15:38:28,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 219 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:38:28,969 INFO L231 Difference]: Finished difference. Result has 191 places, 207 transitions, 606 flow [2024-11-07 15:38:28,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=191, PETRI_TRANSITIONS=207} [2024-11-07 15:38:28,970 INFO L277 CegarLoopForPetriNet]: 186 programPoint places, 5 predicate places. [2024-11-07 15:38:28,970 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 207 transitions, 606 flow [2024-11-07 15:38:28,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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:38:28,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:28,971 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:38:28,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:38:28,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:38:28,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:28,971 INFO L85 PathProgramCache]: Analyzing trace with hash -698898661, now seen corresponding path program 1 times [2024-11-07 15:38:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:28,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956365151] [2024-11-07 15:38:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:28,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:29,073 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:38:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956365151] [2024-11-07 15:38:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956365151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:38:29,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139321419] [2024-11-07 15:38:29,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:29,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:38:29,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:38:29,081 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:38:29,085 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:38:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:29,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 15:38:29,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:38:29,290 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:38:29,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:38:29,388 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:38:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139321419] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:38:29,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:38:29,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-07 15:38:29,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548622071] [2024-11-07 15:38:29,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:38:29,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 15:38:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:29,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 15:38:29,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 15:38:29,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 201 [2024-11-07 15:38:29,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 207 transitions, 606 flow. Second operand has 10 states, 10 states have (on average 155.5) internal successors, (1555), 10 states have internal predecessors, (1555), 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:38:29,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:29,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 201 [2024-11-07 15:38:29,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:38:30,029 INFO L124 PetriNetUnfolderBase]: 864/4121 cut-off events. [2024-11-07 15:38:30,029 INFO L125 PetriNetUnfolderBase]: For 664/708 co-relation queries the response was YES. [2024-11-07 15:38:30,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6709 conditions, 4121 events. 864/4121 cut-off events. For 664/708 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 39253 event pairs, 123 based on Foata normal form. 104/3934 useless extension candidates. Maximal degree in co-relation 3159. Up to 434 conditions per place. [2024-11-07 15:38:30,058 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 72 selfloop transitions, 7 changer transitions 0/210 dead transitions. [2024-11-07 15:38:30,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 210 transitions, 724 flow [2024-11-07 15:38:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 15:38:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 15:38:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1458 transitions. [2024-11-07 15:38:30,063 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8059701492537313 [2024-11-07 15:38:30,064 INFO L175 Difference]: Start difference. First operand has 191 places, 207 transitions, 606 flow. Second operand 9 states and 1458 transitions. [2024-11-07 15:38:30,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 210 transitions, 724 flow [2024-11-07 15:38:30,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 210 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:38:30,073 INFO L231 Difference]: Finished difference. Result has 150 places, 154 transitions, 448 flow [2024-11-07 15:38:30,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=448, PETRI_PLACES=150, PETRI_TRANSITIONS=154} [2024-11-07 15:38:30,074 INFO L277 CegarLoopForPetriNet]: 186 programPoint places, -36 predicate places. [2024-11-07 15:38:30,074 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 154 transitions, 448 flow [2024-11-07 15:38:30,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 155.5) internal successors, (1555), 10 states have internal predecessors, (1555), 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:38:30,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:30,075 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:38:30,096 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:38:30,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:38:30,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-07 15:38:30,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1777973031, now seen corresponding path program 1 times [2024-11-07 15:38:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:30,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268622370] [2024-11-07 15:38:30,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:30,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:38:30,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:38:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:38:30,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:38:30,376 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-07 15:38:30,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-07 15:38:30,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:38:30,382 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 15:38:30,383 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:38:30,383 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-07 15:38:30,472 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-07 15:38:30,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 254 transitions, 535 flow [2024-11-07 15:38:30,525 INFO L124 PetriNetUnfolderBase]: 54/544 cut-off events. [2024-11-07 15:38:30,526 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-07 15:38:30,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 544 events. 54/544 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2105 event pairs, 1 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 363. Up to 16 conditions per place. [2024-11-07 15:38:30,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 254 transitions, 535 flow [2024-11-07 15:38:30,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 254 transitions, 535 flow [2024-11-07 15:38:30,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:38:30,535 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;@70b99cad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:38:30,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-07 15:38:30,538 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:38:30,538 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-11-07 15:38:30,538 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:38:30,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:30,538 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:38:30,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-07 15:38:30,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:30,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1805282686, now seen corresponding path program 1 times [2024-11-07 15:38:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:30,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323284268] [2024-11-07 15:38:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:30,751 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:38:30,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:30,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323284268] [2024-11-07 15:38:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323284268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:38:30,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:38:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:38:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94708395] [2024-11-07 15:38:30,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:38:30,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:38:30,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:30,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:38:30,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:38:30,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 254 [2024-11-07 15:38:30,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 254 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 184.5) internal successors, (1107), 6 states have internal predecessors, (1107), 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:38:30,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:30,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 254 [2024-11-07 15:38:30,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:38:36,423 INFO L124 PetriNetUnfolderBase]: 19556/52155 cut-off events. [2024-11-07 15:38:36,423 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2024-11-07 15:38:36,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80512 conditions, 52155 events. 19556/52155 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 638028 event pairs, 2086 based on Foata normal form. 15316/63891 useless extension candidates. Maximal degree in co-relation 9041. Up to 20053 conditions per place. [2024-11-07 15:38:36,832 INFO L140 encePairwiseOnDemand]: 224/254 looper letters, 112 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2024-11-07 15:38:36,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 299 transitions, 859 flow [2024-11-07 15:38:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:38:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:38:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1312 transitions. [2024-11-07 15:38:36,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8608923884514436 [2024-11-07 15:38:36,839 INFO L175 Difference]: Start difference. First operand has 234 places, 254 transitions, 535 flow. Second operand 6 states and 1312 transitions. [2024-11-07 15:38:36,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 299 transitions, 859 flow [2024-11-07 15:38:36,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 299 transitions, 859 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:38:36,846 INFO L231 Difference]: Finished difference. Result has 236 places, 227 transitions, 491 flow [2024-11-07 15:38:36,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=491, PETRI_PLACES=236, PETRI_TRANSITIONS=227} [2024-11-07 15:38:36,847 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, 2 predicate places. [2024-11-07 15:38:36,848 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 227 transitions, 491 flow [2024-11-07 15:38:36,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.5) internal successors, (1107), 6 states have internal predecessors, (1107), 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:38:36,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:36,849 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:38:36,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:38:36,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-07 15:38:36,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1709430226, now seen corresponding path program 1 times [2024-11-07 15:38:36,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:36,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991327267] [2024-11-07 15:38:36,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:36,883 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:38:36,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:36,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991327267] [2024-11-07 15:38:36,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991327267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:38:36,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:38:36,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:38:36,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153872948] [2024-11-07 15:38:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:38:36,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:38:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:36,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:38:36,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:38:36,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 254 [2024-11-07 15:38:36,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 227 transitions, 491 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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:38:36,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:36,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 254 [2024-11-07 15:38:36,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:38:40,736 INFO L124 PetriNetUnfolderBase]: 8936/36954 cut-off events. [2024-11-07 15:38:40,737 INFO L125 PetriNetUnfolderBase]: For 2308/2308 co-relation queries the response was YES. [2024-11-07 15:38:40,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52071 conditions, 36954 events. 8936/36954 cut-off events. For 2308/2308 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 487394 event pairs, 8324 based on Foata normal form. 1/33970 useless extension candidates. Maximal degree in co-relation 6218. Up to 12753 conditions per place. [2024-11-07 15:38:40,984 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 39 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-11-07 15:38:40,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 234 transitions, 589 flow [2024-11-07 15:38:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:38:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:38:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2024-11-07 15:38:40,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8228346456692913 [2024-11-07 15:38:40,986 INFO L175 Difference]: Start difference. First operand has 236 places, 227 transitions, 491 flow. Second operand 3 states and 627 transitions. [2024-11-07 15:38:40,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 234 transitions, 589 flow [2024-11-07 15:38:40,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 234 transitions, 577 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:38:40,998 INFO L231 Difference]: Finished difference. Result has 234 places, 228 transitions, 493 flow [2024-11-07 15:38:40,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=234, PETRI_TRANSITIONS=228} [2024-11-07 15:38:41,000 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, 0 predicate places. [2024-11-07 15:38:41,000 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 228 transitions, 493 flow [2024-11-07 15:38:41,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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:38:41,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:38:41,001 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] [2024-11-07 15:38:41,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:38:41,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-07 15:38:41,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:38:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1085180711, now seen corresponding path program 1 times [2024-11-07 15:38:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:38:41,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458319283] [2024-11-07 15:38:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:38:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:38:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:38:41,051 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:38:41,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:38:41,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458319283] [2024-11-07 15:38:41,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458319283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:38:41,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:38:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:38:41,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92786983] [2024-11-07 15:38:41,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:38:41,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:38:41,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:38:41,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:38:41,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:38:41,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 254 [2024-11-07 15:38:41,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 228 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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:38:41,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:38:41,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 254 [2024-11-07 15:38:41,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:39:07,765 INFO L124 PetriNetUnfolderBase]: 108047/282832 cut-off events. [2024-11-07 15:39:07,765 INFO L125 PetriNetUnfolderBase]: For 6263/6263 co-relation queries the response was YES. [2024-11-07 15:39:09,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438783 conditions, 282832 events. 108047/282832 cut-off events. For 6263/6263 co-relation queries the response was YES. Maximal size of possible extension queue 5928. Compared 4178721 event pairs, 45980 based on Foata normal form. 0/251483 useless extension candidates. Maximal degree in co-relation 438732. Up to 82478 conditions per place. [2024-11-07 15:39:10,315 INFO L140 encePairwiseOnDemand]: 227/254 looper letters, 82 selfloop transitions, 20 changer transitions 0/275 dead transitions. [2024-11-07 15:39:10,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 275 transitions, 812 flow [2024-11-07 15:39:10,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:39:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:39:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2024-11-07 15:39:10,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8280839895013123 [2024-11-07 15:39:10,317 INFO L175 Difference]: Start difference. First operand has 234 places, 228 transitions, 493 flow. Second operand 3 states and 631 transitions. [2024-11-07 15:39:10,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 275 transitions, 812 flow [2024-11-07 15:39:10,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 275 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:39:10,332 INFO L231 Difference]: Finished difference. Result has 237 places, 248 transitions, 665 flow [2024-11-07 15:39:10,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=665, PETRI_PLACES=237, PETRI_TRANSITIONS=248} [2024-11-07 15:39:10,333 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, 3 predicate places. [2024-11-07 15:39:10,333 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 248 transitions, 665 flow [2024-11-07 15:39:10,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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:10,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:39:10,333 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] [2024-11-07 15:39:10,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:39:10,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-07 15:39:10,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:39:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash -920079555, now seen corresponding path program 1 times [2024-11-07 15:39:10,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:39:10,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975908788] [2024-11-07 15:39:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:39:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:39:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:39:10,391 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:10,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:39:10,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975908788] [2024-11-07 15:39:10,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975908788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:39:10,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:39:10,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:39:10,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912737573] [2024-11-07 15:39:10,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:39:10,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:39:10,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:39:10,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:39:10,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:39:10,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 254 [2024-11-07 15:39:10,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 248 transitions, 665 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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:10,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:39:10,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 254 [2024-11-07 15:39:10,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand