./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-time-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-time-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef62179d17d90afe74c7b4fe8189ca3bb011e55daf3a169b42e4b3589691fc53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:38:34,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:38:34,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:38:34,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:38:34,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:38:35,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:38:35,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:38:35,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:38:35,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:38:35,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:38:35,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:38:35,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:38:35,008 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:38:35,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:38:35,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:38:35,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:38:35,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:38:35,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:38:35,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:38:35,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:38:35,009 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:35,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:38:35,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:38:35,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:38:35,010 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 -> ef62179d17d90afe74c7b4fe8189ca3bb011e55daf3a169b42e4b3589691fc53 [2025-02-08 05:38:35,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:38:35,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:38:35,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:38:35,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:38:35,241 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:38:35,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-time-trans.wvr.c [2025-02-08 05:38:36,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397b149a8/eb196dbedd0147f59139739b4d078231/FLAG02e8abad1 [2025-02-08 05:38:36,669 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:38:36,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-trans.wvr.c [2025-02-08 05:38:36,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397b149a8/eb196dbedd0147f59139739b4d078231/FLAG02e8abad1 [2025-02-08 05:38:36,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397b149a8/eb196dbedd0147f59139739b4d078231 [2025-02-08 05:38:36,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:38:36,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:38:36,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:36,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:38:36,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:38:36,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1747c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36, skipping insertion in model container [2025-02-08 05:38:36,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:38:36,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:36,852 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:38:36,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:36,890 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:38:36,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36 WrapperNode [2025-02-08 05:38:36,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:36,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:36,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:38:36,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:38:36,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,927 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 319 [2025-02-08 05:38:36,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:36,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:38:36,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:38:36,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:38:36,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:38:36,957 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:38:36,957 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:38:36,957 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:38:36,958 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (1/1) ... [2025-02-08 05:38:36,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:36,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:36,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:38:36,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:38:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:38:37,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:38:37,017 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:38:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:38:37,017 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:38:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:38:37,017 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:38:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:38:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:38:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:38:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:38:37,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:38:37,019 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:38:37,103 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:38:37,104 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:38:37,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-7: #t~ite4#1 := #t~ret3#1; [2025-02-08 05:38:37,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 05:38:37,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:38:37,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:37,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-11: #t~ret3#1 := minus_#res#1; [2025-02-08 05:38:37,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-7: #t~ite9#1 := #t~ret8#1; [2025-02-08 05:38:37,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 05:38:37,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:38:37,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:37,302 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-11: #t~ret8#1 := minus_#res#1; [2025-02-08 05:38:37,372 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-7: #t~ite14#1 := #t~ret13#1; [2025-02-08 05:38:37,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 05:38:37,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:38:37,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:37,373 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-11: #t~ret13#1 := minus_#res#1; [2025-02-08 05:38:37,482 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:38:37,482 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:38:37,702 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L101 is not an error location. [2025-02-08 05:38:37,702 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L101 is not an error location. [2025-02-08 05:38:37,702 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L101 is not an error location. [2025-02-08 05:38:37,703 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:38:37,703 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:38:37,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:37 BoogieIcfgContainer [2025-02-08 05:38:37,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:38:37,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:38:37,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:38:37,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:38:37,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:38:36" (1/3) ... [2025-02-08 05:38:37,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c61037e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:37, skipping insertion in model container [2025-02-08 05:38:37,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:36" (2/3) ... [2025-02-08 05:38:37,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c61037e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:37, skipping insertion in model container [2025-02-08 05:38:37,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:37" (3/3) ... [2025-02-08 05:38:37,710 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-time-trans.wvr.c [2025-02-08 05:38:37,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:38:37,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-time-trans.wvr.c that has 4 procedures, 197 locations, 1 initial locations, 0 loop locations, and 36 error locations. [2025-02-08 05:38:37,722 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:38:37,778 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:38:37,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 199 transitions, 419 flow [2025-02-08 05:38:37,866 INFO L124 PetriNetUnfolderBase]: 3/196 cut-off events. [2025-02-08 05:38:37,867 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:37,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 196 events. 3/196 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 204 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2025-02-08 05:38:37,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 199 transitions, 419 flow [2025-02-08 05:38:37,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 175 transitions, 368 flow [2025-02-08 05:38:37,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:38:37,886 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;@1457bcbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:38:37,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-02-08 05:38:37,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:38:37,894 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:38:37,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:38:37,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:37,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:37,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:37,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:37,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1673187656, now seen corresponding path program 1 times [2025-02-08 05:38:37,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750004134] [2025-02-08 05:38:37,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:37,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:37,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:38:37,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:38:37,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:37,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:38,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:38,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750004134] [2025-02-08 05:38:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750004134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:38,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:38,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950582609] [2025-02-08 05:38:38,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:38,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:38,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:38,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:38,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:38,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 199 [2025-02-08 05:38:38,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 175 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:38,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 199 [2025-02-08 05:38:38,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:38,156 INFO L124 PetriNetUnfolderBase]: 57/282 cut-off events. [2025-02-08 05:38:38,156 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-08 05:38:38,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 282 events. 57/282 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 737 event pairs, 56 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 269. Up to 112 conditions per place. [2025-02-08 05:38:38,162 INFO L140 encePairwiseOnDemand]: 172/199 looper letters, 12 selfloop transitions, 2 changer transitions 3/150 dead transitions. [2025-02-08 05:38:38,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 150 transitions, 352 flow [2025-02-08 05:38:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2025-02-08 05:38:38,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8442211055276382 [2025-02-08 05:38:38,174 INFO L175 Difference]: Start difference. First operand has 184 places, 175 transitions, 368 flow. Second operand 3 states and 504 transitions. [2025-02-08 05:38:38,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 150 transitions, 352 flow [2025-02-08 05:38:38,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 150 transitions, 340 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:38:38,183 INFO L231 Difference]: Finished difference. Result has 155 places, 147 transitions, 304 flow [2025-02-08 05:38:38,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=155, PETRI_TRANSITIONS=147} [2025-02-08 05:38:38,189 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -29 predicate places. [2025-02-08 05:38:38,190 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 147 transitions, 304 flow [2025-02-08 05:38:38,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:38,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:38,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:38:38,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:38,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1487371093, now seen corresponding path program 1 times [2025-02-08 05:38:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182319178] [2025-02-08 05:38:38,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:38,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:38,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:38:38,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:38:38,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:38,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:38,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:38,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182319178] [2025-02-08 05:38:38,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182319178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:38,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:38,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:38,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016967470] [2025-02-08 05:38:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:38,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:38,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:38,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:38,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:38,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 199 [2025-02-08 05:38:38,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 147 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:38,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 199 [2025-02-08 05:38:38,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:38,296 INFO L124 PetriNetUnfolderBase]: 16/193 cut-off events. [2025-02-08 05:38:38,297 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:38,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 193 events. 16/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 219 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 212. Up to 40 conditions per place. [2025-02-08 05:38:38,298 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 12 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-02-08 05:38:38,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 146 transitions, 330 flow [2025-02-08 05:38:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-02-08 05:38:38,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7989949748743719 [2025-02-08 05:38:38,300 INFO L175 Difference]: Start difference. First operand has 155 places, 147 transitions, 304 flow. Second operand 3 states and 477 transitions. [2025-02-08 05:38:38,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 146 transitions, 330 flow [2025-02-08 05:38:38,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 146 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:38,303 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 302 flow [2025-02-08 05:38:38,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=151, PETRI_TRANSITIONS=146} [2025-02-08 05:38:38,304 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -33 predicate places. [2025-02-08 05:38:38,304 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 302 flow [2025-02-08 05:38:38,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:38,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:38,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:38:38,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:38,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1190315541, now seen corresponding path program 1 times [2025-02-08 05:38:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:38,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601057312] [2025-02-08 05:38:38,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:38,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:38:38,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:38:38,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:38,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:38,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:38,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601057312] [2025-02-08 05:38:38,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601057312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:38,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:38,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678021638] [2025-02-08 05:38:38,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:38,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:38,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:38,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:38,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 199 [2025-02-08 05:38:38,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:38,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 199 [2025-02-08 05:38:38,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:38,402 INFO L124 PetriNetUnfolderBase]: 16/192 cut-off events. [2025-02-08 05:38:38,403 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:38,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 192 events. 16/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 216 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 203. Up to 40 conditions per place. [2025-02-08 05:38:38,404 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 12 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-02-08 05:38:38,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 145 transitions, 328 flow [2025-02-08 05:38:38,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-02-08 05:38:38,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7989949748743719 [2025-02-08 05:38:38,406 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 302 flow. Second operand 3 states and 477 transitions. [2025-02-08 05:38:38,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 145 transitions, 328 flow [2025-02-08 05:38:38,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 145 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:38,408 INFO L231 Difference]: Finished difference. Result has 150 places, 145 transitions, 300 flow [2025-02-08 05:38:38,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=150, PETRI_TRANSITIONS=145} [2025-02-08 05:38:38,409 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -34 predicate places. [2025-02-08 05:38:38,409 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 145 transitions, 300 flow [2025-02-08 05:38:38,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:38,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:38,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:38,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:38,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1428239405, now seen corresponding path program 1 times [2025-02-08 05:38:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:38,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791805706] [2025-02-08 05:38:38,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:38,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:38,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:38:38,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:38:38,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:38,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:38,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791805706] [2025-02-08 05:38:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791805706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:38,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503757225] [2025-02-08 05:38:38,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:38,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:38,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:38,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:38,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:38,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 199 [2025-02-08 05:38:38,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 145 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:38,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 199 [2025-02-08 05:38:38,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:38,498 INFO L124 PetriNetUnfolderBase]: 16/191 cut-off events. [2025-02-08 05:38:38,498 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:38,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 191 events. 16/191 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 194. Up to 40 conditions per place. [2025-02-08 05:38:38,499 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 12 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-02-08 05:38:38,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 144 transitions, 326 flow [2025-02-08 05:38:38,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-02-08 05:38:38,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7989949748743719 [2025-02-08 05:38:38,501 INFO L175 Difference]: Start difference. First operand has 150 places, 145 transitions, 300 flow. Second operand 3 states and 477 transitions. [2025-02-08 05:38:38,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 144 transitions, 326 flow [2025-02-08 05:38:38,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:38,504 INFO L231 Difference]: Finished difference. Result has 149 places, 144 transitions, 298 flow [2025-02-08 05:38:38,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=149, PETRI_TRANSITIONS=144} [2025-02-08 05:38:38,504 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -35 predicate places. [2025-02-08 05:38:38,504 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 144 transitions, 298 flow [2025-02-08 05:38:38,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:38,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:38,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:38,507 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:38,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1908668591, now seen corresponding path program 1 times [2025-02-08 05:38:38,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:38,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7890742] [2025-02-08 05:38:38,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:38,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:38,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:38:38,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:38:38,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:38,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7890742] [2025-02-08 05:38:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7890742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:38,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:38,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:38,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203718908] [2025-02-08 05:38:38,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:38,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:38,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:38,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:38,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:38,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 199 [2025-02-08 05:38:38,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 144 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:38,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 199 [2025-02-08 05:38:38,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:38,619 INFO L124 PetriNetUnfolderBase]: 16/190 cut-off events. [2025-02-08 05:38:38,619 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:38,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 190 events. 16/190 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 212 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 185. Up to 40 conditions per place. [2025-02-08 05:38:38,620 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 12 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2025-02-08 05:38:38,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 143 transitions, 324 flow [2025-02-08 05:38:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-02-08 05:38:38,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7989949748743719 [2025-02-08 05:38:38,621 INFO L175 Difference]: Start difference. First operand has 149 places, 144 transitions, 298 flow. Second operand 3 states and 477 transitions. [2025-02-08 05:38:38,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 143 transitions, 324 flow [2025-02-08 05:38:38,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 143 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:38,623 INFO L231 Difference]: Finished difference. Result has 148 places, 143 transitions, 296 flow [2025-02-08 05:38:38,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=148, PETRI_TRANSITIONS=143} [2025-02-08 05:38:38,624 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -36 predicate places. [2025-02-08 05:38:38,624 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 143 transitions, 296 flow [2025-02-08 05:38:38,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:38,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:38,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:38,624 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:38,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash 631301027, now seen corresponding path program 1 times [2025-02-08 05:38:38,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:38,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377271068] [2025-02-08 05:38:38,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:38,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:38,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:38:38,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:38:38,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:38,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:38,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:38,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377271068] [2025-02-08 05:38:38,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377271068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:38,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:38,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302272991] [2025-02-08 05:38:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:38,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:38,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:38,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:38,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:38,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 199 [2025-02-08 05:38:38,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 143 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:38,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 199 [2025-02-08 05:38:38,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:38,719 INFO L124 PetriNetUnfolderBase]: 16/189 cut-off events. [2025-02-08 05:38:38,719 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:38,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 189 events. 16/189 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 210 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 176. Up to 40 conditions per place. [2025-02-08 05:38:38,720 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 12 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-02-08 05:38:38,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 142 transitions, 322 flow [2025-02-08 05:38:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-02-08 05:38:38,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7989949748743719 [2025-02-08 05:38:38,721 INFO L175 Difference]: Start difference. First operand has 148 places, 143 transitions, 296 flow. Second operand 3 states and 477 transitions. [2025-02-08 05:38:38,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 142 transitions, 322 flow [2025-02-08 05:38:38,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 142 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:38,723 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 294 flow [2025-02-08 05:38:38,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2025-02-08 05:38:38,724 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -37 predicate places. [2025-02-08 05:38:38,724 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 294 flow [2025-02-08 05:38:38,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:38,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:38,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:38,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:38,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:38,725 INFO L85 PathProgramCache]: Analyzing trace with hash 112393168, now seen corresponding path program 1 times [2025-02-08 05:38:38,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:38,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292791692] [2025-02-08 05:38:38,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:38,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:38,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:38:38,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:38:38,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:38,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292791692] [2025-02-08 05:38:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292791692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:38,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:38,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911649345] [2025-02-08 05:38:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:38,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:38,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:38,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:38,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 199 [2025-02-08 05:38:38,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:38,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 199 [2025-02-08 05:38:38,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:38,810 INFO L124 PetriNetUnfolderBase]: 16/188 cut-off events. [2025-02-08 05:38:38,810 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:38,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 188 events. 16/188 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 209 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 168. Up to 41 conditions per place. [2025-02-08 05:38:38,811 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 13 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-02-08 05:38:38,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 141 transitions, 322 flow [2025-02-08 05:38:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-02-08 05:38:38,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7956448911222781 [2025-02-08 05:38:38,813 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 294 flow. Second operand 3 states and 475 transitions. [2025-02-08 05:38:38,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 141 transitions, 322 flow [2025-02-08 05:38:38,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 141 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:38,815 INFO L231 Difference]: Finished difference. Result has 146 places, 141 transitions, 292 flow [2025-02-08 05:38:38,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=146, PETRI_TRANSITIONS=141} [2025-02-08 05:38:38,815 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -38 predicate places. [2025-02-08 05:38:38,816 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 141 transitions, 292 flow [2025-02-08 05:38:38,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:38,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:38,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:38,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:38,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1540771058, now seen corresponding path program 1 times [2025-02-08 05:38:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210863784] [2025-02-08 05:38:38,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:38,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:38:38,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:38:38,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:38,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:38,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:38,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210863784] [2025-02-08 05:38:38,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210863784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:38,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:38,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298839768] [2025-02-08 05:38:38,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:38,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:38,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:38,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:38,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:38,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 199 [2025-02-08 05:38:38,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 141 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:38,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 199 [2025-02-08 05:38:38,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:38,924 INFO L124 PetriNetUnfolderBase]: 16/187 cut-off events. [2025-02-08 05:38:38,924 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:38,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 187 events. 16/187 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 207 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 159. Up to 41 conditions per place. [2025-02-08 05:38:38,925 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 13 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2025-02-08 05:38:38,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 320 flow [2025-02-08 05:38:38,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-02-08 05:38:38,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7956448911222781 [2025-02-08 05:38:38,927 INFO L175 Difference]: Start difference. First operand has 146 places, 141 transitions, 292 flow. Second operand 3 states and 475 transitions. [2025-02-08 05:38:38,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 320 flow [2025-02-08 05:38:38,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 140 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:38,929 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 290 flow [2025-02-08 05:38:38,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2025-02-08 05:38:38,931 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -39 predicate places. [2025-02-08 05:38:38,931 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 290 flow [2025-02-08 05:38:38,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:38,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:38,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:38,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:38,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:38,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1464209344, now seen corresponding path program 1 times [2025-02-08 05:38:38,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:38,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429610212] [2025-02-08 05:38:38,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:38,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:38,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:38:38,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:38:38,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:38,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:38,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:38,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429610212] [2025-02-08 05:38:38,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429610212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:38,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:38,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:38,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163588723] [2025-02-08 05:38:38,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:38,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:38,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:38,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:38,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:38,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 199 [2025-02-08 05:38:38,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:38,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:38,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 199 [2025-02-08 05:38:38,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:39,023 INFO L124 PetriNetUnfolderBase]: 16/186 cut-off events. [2025-02-08 05:38:39,024 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:39,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 186 events. 16/186 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 150. Up to 41 conditions per place. [2025-02-08 05:38:39,025 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 13 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2025-02-08 05:38:39,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 139 transitions, 318 flow [2025-02-08 05:38:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-02-08 05:38:39,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7956448911222781 [2025-02-08 05:38:39,026 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 290 flow. Second operand 3 states and 475 transitions. [2025-02-08 05:38:39,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 139 transitions, 318 flow [2025-02-08 05:38:39,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 139 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:39,029 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 288 flow [2025-02-08 05:38:39,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2025-02-08 05:38:39,030 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -40 predicate places. [2025-02-08 05:38:39,031 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 288 flow [2025-02-08 05:38:39,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:39,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:39,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:39,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:39,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:39,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1750439259, now seen corresponding path program 1 times [2025-02-08 05:38:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:39,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319183270] [2025-02-08 05:38:39,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:39,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-08 05:38:39,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-08 05:38:39,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:39,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:39,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319183270] [2025-02-08 05:38:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319183270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:39,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:39,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119317334] [2025-02-08 05:38:39,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:39,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:39,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:39,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:39,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2025-02-08 05:38:39,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:39,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:39,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2025-02-08 05:38:39,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:39,144 INFO L124 PetriNetUnfolderBase]: 16/185 cut-off events. [2025-02-08 05:38:39,145 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:39,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 185 events. 16/185 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 202 event pairs, 15 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 138. Up to 38 conditions per place. [2025-02-08 05:38:39,145 INFO L140 encePairwiseOnDemand]: 197/199 looper letters, 11 selfloop transitions, 1 changer transitions 0/138 dead transitions. [2025-02-08 05:38:39,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 138 transitions, 310 flow [2025-02-08 05:38:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-02-08 05:38:39,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8107202680067002 [2025-02-08 05:38:39,147 INFO L175 Difference]: Start difference. First operand has 144 places, 139 transitions, 288 flow. Second operand 3 states and 484 transitions. [2025-02-08 05:38:39,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 138 transitions, 310 flow [2025-02-08 05:38:39,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 138 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:39,149 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 284 flow [2025-02-08 05:38:39,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2025-02-08 05:38:39,149 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -41 predicate places. [2025-02-08 05:38:39,149 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 284 flow [2025-02-08 05:38:39,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:39,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:39,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:39,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:39,150 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:39,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1878136575, now seen corresponding path program 1 times [2025-02-08 05:38:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:39,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403191158] [2025-02-08 05:38:39,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:39,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-08 05:38:39,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 05:38:39,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:39,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:39,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:39,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403191158] [2025-02-08 05:38:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403191158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:39,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:39,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:39,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868164467] [2025-02-08 05:38:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:39,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:39,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:39,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:39,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2025-02-08 05:38:39,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:39,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:39,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2025-02-08 05:38:39,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:39,230 INFO L124 PetriNetUnfolderBase]: 15/188 cut-off events. [2025-02-08 05:38:39,230 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:39,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 188 events. 15/188 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 203 event pairs, 15 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 216. Up to 38 conditions per place. [2025-02-08 05:38:39,231 INFO L140 encePairwiseOnDemand]: 197/199 looper letters, 11 selfloop transitions, 1 changer transitions 0/137 dead transitions. [2025-02-08 05:38:39,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 306 flow [2025-02-08 05:38:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-02-08 05:38:39,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8107202680067002 [2025-02-08 05:38:39,233 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 284 flow. Second operand 3 states and 484 transitions. [2025-02-08 05:38:39,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 306 flow [2025-02-08 05:38:39,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:39,235 INFO L231 Difference]: Finished difference. Result has 143 places, 137 transitions, 283 flow [2025-02-08 05:38:39,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=283, PETRI_PLACES=143, PETRI_TRANSITIONS=137} [2025-02-08 05:38:39,235 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -41 predicate places. [2025-02-08 05:38:39,235 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 137 transitions, 283 flow [2025-02-08 05:38:39,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:39,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:39,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:39,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:39,236 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:38:39,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1007588972, now seen corresponding path program 1 times [2025-02-08 05:38:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:39,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486739187] [2025-02-08 05:38:39,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:39,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-08 05:38:39,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-08 05:38:39,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:39,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:39,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:39,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486739187] [2025-02-08 05:38:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486739187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:39,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:39,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485580110] [2025-02-08 05:38:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:39,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:39,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:39,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:39,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:39,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2025-02-08 05:38:39,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 137 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:39,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:39,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2025-02-08 05:38:39,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:39,325 INFO L124 PetriNetUnfolderBase]: 15/186 cut-off events. [2025-02-08 05:38:39,325 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:39,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 186 events. 15/186 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 201 event pairs, 15 based on Foata normal form. 2/183 useless extension candidates. Maximal degree in co-relation 226. Up to 38 conditions per place. [2025-02-08 05:38:39,326 INFO L140 encePairwiseOnDemand]: 197/199 looper letters, 0 selfloop transitions, 0 changer transitions 136/136 dead transitions. [2025-02-08 05:38:39,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 303 flow [2025-02-08 05:38:39,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-02-08 05:38:39,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8090452261306532 [2025-02-08 05:38:39,327 INFO L175 Difference]: Start difference. First operand has 143 places, 137 transitions, 283 flow. Second operand 3 states and 483 transitions. [2025-02-08 05:38:39,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 303 flow [2025-02-08 05:38:39,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 136 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:39,328 INFO L231 Difference]: Finished difference. Result has 143 places, 0 transitions, 0 flow [2025-02-08 05:38:39,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=143, PETRI_TRANSITIONS=0} [2025-02-08 05:38:39,329 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -41 predicate places. [2025-02-08 05:38:39,329 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 0 transitions, 0 flow [2025-02-08 05:38:39,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:39,331 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (61 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (60 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (59 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (58 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (55 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (54 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (50 of 63 remaining) [2025-02-08 05:38:39,332 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (49 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (48 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (46 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (45 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (42 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (41 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (40 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (38 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (36 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 63 remaining) [2025-02-08 05:38:39,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (20 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (19 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (18 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (17 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (16 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (13 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (10 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 63 remaining) [2025-02-08 05:38:39,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 63 remaining) [2025-02-08 05:38:39,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:39,335 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:39,339 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:38:39,339 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:38:39,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:38:39 BasicIcfg [2025-02-08 05:38:39,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:38:39,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:38:39,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:38:39,345 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:38:39,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:37" (3/4) ... [2025-02-08 05:38:39,347 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:38:39,348 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:38:39,348 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:38:39,348 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:38:39,352 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:38:39,352 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:38:39,352 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:38:39,352 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:38:39,407 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:38:39,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:38:39,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:38:39,408 INFO L158 Benchmark]: Toolchain (without parser) took 2720.32ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 79.4MB in the end (delta: 33.0MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2025-02-08 05:38:39,409 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:39,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.89ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 100.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:39,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.56ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 97.9MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:39,410 INFO L158 Benchmark]: Boogie Preprocessor took 25.72ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:39,410 INFO L158 Benchmark]: IcfgBuilder took 746.13ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 89.0MB in the end (delta: 7.5MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2025-02-08 05:38:39,411 INFO L158 Benchmark]: TraceAbstraction took 1639.53ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:39,411 INFO L158 Benchmark]: Witness Printer took 62.83ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 79.4MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:39,412 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.89ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 100.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.56ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 97.9MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.72ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 746.13ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 89.0MB in the end (delta: 7.5MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1639.53ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.83ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 79.4MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 242 locations, 63 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 334 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 34 mSDtfsCounter, 334 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 901 ConstructedInterpolants, 0 QuantifiedInterpolants, 925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:38:39,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE