./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bf2f5f336333cdf96c271b32cdeb9b70ee932e1c07acf27a63b4425ec902f3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:55:09,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:10,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:55:10,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:10,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:10,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:10,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:10,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:10,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:10,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:10,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:10,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:10,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:10,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:10,053 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:10,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:10,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:10,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:10,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:10,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:10,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:10,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:10,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:10,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:10,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:10,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:10,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:10,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:10,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:10,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:10,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:10,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:55:10,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:55:10,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:10,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:10,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:10,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:10,056 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 0bf2f5f336333cdf96c271b32cdeb9b70ee932e1c07acf27a63b4425ec902f3e [2025-01-10 00:55:10,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:10,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:10,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:10,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:10,314 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:10,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i [2025-01-10 00:55:11,497 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1a479914/d6c634c617184fbb9f28cbf6be39c3fc/FLAGd7874652a [2025-01-10 00:55:11,824 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:11,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i [2025-01-10 00:55:11,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1a479914/d6c634c617184fbb9f28cbf6be39c3fc/FLAGd7874652a [2025-01-10 00:55:12,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1a479914/d6c634c617184fbb9f28cbf6be39c3fc [2025-01-10 00:55:12,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:12,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:12,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:12,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:12,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:12,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f57c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12, skipping insertion in model container [2025-01-10 00:55:12,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:12,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:12,636 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:12,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:12,771 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:12,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12 WrapperNode [2025-01-10 00:55:12,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:12,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:12,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:12,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:12,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,825 INFO L138 Inliner]: procedures = 525, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 105 [2025-01-10 00:55:12,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:12,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:12,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:12,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:12,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,849 INFO L175 MemorySlicer]: Split 13 memory accesses to 9 slices as follows [5, 1, 1, 1, 1, 1, 1, 1, 1]. 38 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5, 0, 0, 0, 0, 0, 0, 0, 0]. The 8 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-01-10 00:55:12,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:12,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:12,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:12,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:12,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (1/1) ... [2025-01-10 00:55:12,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:12,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:12,923 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-01-10 00:55:12,930 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-01-10 00:55:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure counter_thread [2025-01-10 00:55:12,952 INFO L138 BoogieDeclarations]: Found implementation of procedure counter_thread [2025-01-10 00:55:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure monitor_thread [2025-01-10 00:55:12,953 INFO L138 BoogieDeclarations]: Found implementation of procedure monitor_thread [2025-01-10 00:55:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:12,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-01-10 00:55:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:55:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:55:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:55:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:55:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 00:55:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 00:55:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 00:55:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 00:55:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 00:55:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:55:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:55:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:55:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:55:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 00:55:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 00:55:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 00:55:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 00:55:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 00:55:12,957 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:55:13,183 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:13,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:13,453 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:13,453 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:13,546 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:13,546 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-10 00:55:13,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:13 BoogieIcfgContainer [2025-01-10 00:55:13,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:13,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:13,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:13,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:13,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:12" (1/3) ... [2025-01-10 00:55:13,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eadb45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:13, skipping insertion in model container [2025-01-10 00:55:13,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:12" (2/3) ... [2025-01-10 00:55:13,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eadb45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:13, skipping insertion in model container [2025-01-10 00:55:13,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:13" (3/3) ... [2025-01-10 00:55:13,557 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_36-trylock_nr.i [2025-01-10 00:55:13,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:13,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_36-trylock_nr.i that has 3 procedures, 102 locations, 1 initial locations, 11 loop locations, and 17 error locations. [2025-01-10 00:55:13,569 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:13,638 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:55:13,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 140 transitions, 294 flow [2025-01-10 00:55:13,703 INFO L124 PetriNetUnfolderBase]: 39/138 cut-off events. [2025-01-10 00:55:13,706 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:13,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 138 events. 39/138 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 395 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 105. Up to 5 conditions per place. [2025-01-10 00:55:13,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 140 transitions, 294 flow [2025-01-10 00:55:13,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 137 transitions, 286 flow [2025-01-10 00:55:13,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:13,735 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=None, 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;@6638d945, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:13,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-01-10 00:55:13,739 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:13,739 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:55:13,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:13,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:13,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:55:13,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:13,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash 590126, now seen corresponding path program 1 times [2025-01-10 00:55:13,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:13,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253641390] [2025-01-10 00:55:13,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:13,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:13,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:55:13,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:55:13,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:13,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253641390] [2025-01-10 00:55:13,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253641390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:13,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:13,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447208132] [2025-01-10 00:55:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:14,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:14,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:14,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:14,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 140 [2025-01-10 00:55:14,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 137 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-01-10 00:55:14,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:14,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 140 [2025-01-10 00:55:14,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:14,442 INFO L124 PetriNetUnfolderBase]: 1002/2869 cut-off events. [2025-01-10 00:55:14,442 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 00:55:14,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 2869 events. 1002/2869 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 24525 event pairs, 359 based on Foata normal form. 988/3014 useless extension candidates. Maximal degree in co-relation 4247. Up to 834 conditions per place. [2025-01-10 00:55:14,467 INFO L140 encePairwiseOnDemand]: 112/140 looper letters, 62 selfloop transitions, 9 changer transitions 5/135 dead transitions. [2025-01-10 00:55:14,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 135 transitions, 432 flow [2025-01-10 00:55:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2025-01-10 00:55:14,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7785714285714286 [2025-01-10 00:55:14,480 INFO L175 Difference]: Start difference. First operand has 105 places, 137 transitions, 286 flow. Second operand 3 states and 327 transitions. [2025-01-10 00:55:14,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 135 transitions, 432 flow [2025-01-10 00:55:14,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 420 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:14,490 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 253 flow [2025-01-10 00:55:14,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=95, PETRI_TRANSITIONS=104} [2025-01-10 00:55:14,495 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -10 predicate places. [2025-01-10 00:55:14,495 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 253 flow [2025-01-10 00:55:14,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-01-10 00:55:14,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:14,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:14,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:55:14,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:14,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash -290626051, now seen corresponding path program 1 times [2025-01-10 00:55:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:14,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935881758] [2025-01-10 00:55:14,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:14,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:55:14,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:55:14,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:14,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:14,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:14,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935881758] [2025-01-10 00:55:14,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935881758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:14,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:14,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690040465] [2025-01-10 00:55:14,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:14,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:14,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:14,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:14,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:14,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-01-10 00:55:14,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 104 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-01-10 00:55:14,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:14,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-01-10 00:55:14,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:14,963 INFO L124 PetriNetUnfolderBase]: 1101/2671 cut-off events. [2025-01-10 00:55:14,964 INFO L125 PetriNetUnfolderBase]: For 326/326 co-relation queries the response was YES. [2025-01-10 00:55:14,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 2671 events. 1101/2671 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 20604 event pairs, 779 based on Foata normal form. 0/2088 useless extension candidates. Maximal degree in co-relation 1901. Up to 1541 conditions per place. [2025-01-10 00:55:14,983 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 57 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-01-10 00:55:14,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 115 transitions, 397 flow [2025-01-10 00:55:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-01-10 00:55:14,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-01-10 00:55:14,988 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 253 flow. Second operand 3 states and 266 transitions. [2025-01-10 00:55:14,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 115 transitions, 397 flow [2025-01-10 00:55:14,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 115 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:14,993 INFO L231 Difference]: Finished difference. Result has 92 places, 103 transitions, 246 flow [2025-01-10 00:55:14,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=92, PETRI_TRANSITIONS=103} [2025-01-10 00:55:14,995 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -13 predicate places. [2025-01-10 00:55:14,995 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 103 transitions, 246 flow [2025-01-10 00:55:14,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-01-10 00:55:14,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:14,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:14,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:55:14,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:14,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:14,997 INFO L85 PathProgramCache]: Analyzing trace with hash -290626050, now seen corresponding path program 1 times [2025-01-10 00:55:14,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:14,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547366722] [2025-01-10 00:55:14,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:14,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:15,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:55:15,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:55:15,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:15,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:15,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:15,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547366722] [2025-01-10 00:55:15,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547366722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:15,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:15,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000118637] [2025-01-10 00:55:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:15,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:15,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:15,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:15,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-01-10 00:55:15,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 103 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-01-10 00:55:15,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:15,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-01-10 00:55:15,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:15,489 INFO L124 PetriNetUnfolderBase]: 1099/2671 cut-off events. [2025-01-10 00:55:15,489 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-10 00:55:15,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 2671 events. 1099/2671 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 20657 event pairs, 777 based on Foata normal form. 0/2082 useless extension candidates. Maximal degree in co-relation 4506. Up to 1547 conditions per place. [2025-01-10 00:55:15,503 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 54 selfloop transitions, 5 changer transitions 2/116 dead transitions. [2025-01-10 00:55:15,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 116 transitions, 398 flow [2025-01-10 00:55:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2025-01-10 00:55:15,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-01-10 00:55:15,505 INFO L175 Difference]: Start difference. First operand has 92 places, 103 transitions, 246 flow. Second operand 3 states and 268 transitions. [2025-01-10 00:55:15,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 116 transitions, 398 flow [2025-01-10 00:55:15,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 116 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:15,510 INFO L231 Difference]: Finished difference. Result has 95 places, 106 transitions, 282 flow [2025-01-10 00:55:15,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=95, PETRI_TRANSITIONS=106} [2025-01-10 00:55:15,511 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -10 predicate places. [2025-01-10 00:55:15,511 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 106 transitions, 282 flow [2025-01-10 00:55:15,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-01-10 00:55:15,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:15,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:15,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:55:15,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting counter_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:15,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash -586311730, now seen corresponding path program 1 times [2025-01-10 00:55:15,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:15,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409604671] [2025-01-10 00:55:15,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:15,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:15,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:55:15,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:55:15,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:15,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:15,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:15,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409604671] [2025-01-10 00:55:15,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409604671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:15,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:15,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:15,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206347189] [2025-01-10 00:55:15,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:15,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:15,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:15,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:15,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:15,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-01-10 00:55:15,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 106 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 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-01-10 00:55:15,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:15,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-01-10 00:55:15,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:15,961 INFO L124 PetriNetUnfolderBase]: 1467/3213 cut-off events. [2025-01-10 00:55:15,961 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2025-01-10 00:55:15,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6066 conditions, 3213 events. 1467/3213 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23460 event pairs, 540 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5877. Up to 1036 conditions per place. [2025-01-10 00:55:15,977 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 118 selfloop transitions, 6 changer transitions 0/174 dead transitions. [2025-01-10 00:55:15,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 174 transitions, 722 flow [2025-01-10 00:55:15,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2025-01-10 00:55:15,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6542857142857142 [2025-01-10 00:55:15,979 INFO L175 Difference]: Start difference. First operand has 95 places, 106 transitions, 282 flow. Second operand 5 states and 458 transitions. [2025-01-10 00:55:15,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 174 transitions, 722 flow [2025-01-10 00:55:15,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 174 transitions, 706 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:15,983 INFO L231 Difference]: Finished difference. Result has 91 places, 99 transitions, 258 flow [2025-01-10 00:55:15,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=91, PETRI_TRANSITIONS=99} [2025-01-10 00:55:15,983 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -14 predicate places. [2025-01-10 00:55:15,984 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 99 transitions, 258 flow [2025-01-10 00:55:15,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 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-01-10 00:55:15,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:15,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:15,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:55:15,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:15,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1312599068, now seen corresponding path program 1 times [2025-01-10 00:55:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:15,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417679333] [2025-01-10 00:55:15,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:16,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:55:16,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:55:16,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:16,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:16,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:16,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417679333] [2025-01-10 00:55:16,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417679333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:16,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:16,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:16,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85047329] [2025-01-10 00:55:16,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:16,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:16,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:16,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:16,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:16,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-01-10 00:55:16,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 99 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-01-10 00:55:16,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:16,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-01-10 00:55:16,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:16,378 INFO L124 PetriNetUnfolderBase]: 2295/4900 cut-off events. [2025-01-10 00:55:16,378 INFO L125 PetriNetUnfolderBase]: For 779/800 co-relation queries the response was YES. [2025-01-10 00:55:16,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9348 conditions, 4900 events. 2295/4900 cut-off events. For 779/800 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 38601 event pairs, 1160 based on Foata normal form. 20/4090 useless extension candidates. Maximal degree in co-relation 8928. Up to 2087 conditions per place. [2025-01-10 00:55:16,405 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 72 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2025-01-10 00:55:16,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 124 transitions, 474 flow [2025-01-10 00:55:16,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2025-01-10 00:55:16,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6595238095238095 [2025-01-10 00:55:16,407 INFO L175 Difference]: Start difference. First operand has 91 places, 99 transitions, 258 flow. Second operand 3 states and 277 transitions. [2025-01-10 00:55:16,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 124 transitions, 474 flow [2025-01-10 00:55:16,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 124 transitions, 466 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:16,413 INFO L231 Difference]: Finished difference. Result has 91 places, 98 transitions, 256 flow [2025-01-10 00:55:16,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=91, PETRI_TRANSITIONS=98} [2025-01-10 00:55:16,414 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -14 predicate places. [2025-01-10 00:55:16,414 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 98 transitions, 256 flow [2025-01-10 00:55:16,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-01-10 00:55:16,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:16,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:16,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:55:16,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1312599067, now seen corresponding path program 1 times [2025-01-10 00:55:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:16,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302426652] [2025-01-10 00:55:16,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:16,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:55:16,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:55:16,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:16,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:16,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:16,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302426652] [2025-01-10 00:55:16,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302426652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:16,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:16,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:16,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274553502] [2025-01-10 00:55:16,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:16,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:16,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:16,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:16,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:16,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-01-10 00:55:16,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 98 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-01-10 00:55:16,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:16,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-01-10 00:55:16,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:16,836 INFO L124 PetriNetUnfolderBase]: 2409/5030 cut-off events. [2025-01-10 00:55:16,836 INFO L125 PetriNetUnfolderBase]: For 1129/1150 co-relation queries the response was YES. [2025-01-10 00:55:16,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9843 conditions, 5030 events. 2409/5030 cut-off events. For 1129/1150 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 39131 event pairs, 1233 based on Foata normal form. 20/4125 useless extension candidates. Maximal degree in co-relation 9301. Up to 2379 conditions per place. [2025-01-10 00:55:16,856 INFO L140 encePairwiseOnDemand]: 134/140 looper letters, 70 selfloop transitions, 6 changer transitions 0/125 dead transitions. [2025-01-10 00:55:16,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 125 transitions, 476 flow [2025-01-10 00:55:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-01-10 00:55:16,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2025-01-10 00:55:16,858 INFO L175 Difference]: Start difference. First operand has 91 places, 98 transitions, 256 flow. Second operand 3 states and 279 transitions. [2025-01-10 00:55:16,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 125 transitions, 476 flow [2025-01-10 00:55:16,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 125 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:16,864 INFO L231 Difference]: Finished difference. Result has 94 places, 102 transitions, 304 flow [2025-01-10 00:55:16,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=94, PETRI_TRANSITIONS=102} [2025-01-10 00:55:16,864 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -11 predicate places. [2025-01-10 00:55:16,865 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 304 flow [2025-01-10 00:55:16,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-01-10 00:55:16,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:16,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:16,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:55:16,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting counter_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:16,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:16,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1403317775, now seen corresponding path program 1 times [2025-01-10 00:55:16,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:16,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543337351] [2025-01-10 00:55:16,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:16,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:16,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:16,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:16,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:16,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:16,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543337351] [2025-01-10 00:55:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543337351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:16,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:16,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:16,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306853235] [2025-01-10 00:55:16,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:16,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:16,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:16,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:16,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:16,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 00:55:16,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-01-10 00:55:16,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:16,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 00:55:16,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:17,196 INFO L124 PetriNetUnfolderBase]: 1574/3818 cut-off events. [2025-01-10 00:55:17,196 INFO L125 PetriNetUnfolderBase]: For 2337/2337 co-relation queries the response was YES. [2025-01-10 00:55:17,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8220 conditions, 3818 events. 1574/3818 cut-off events. For 2337/2337 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 30534 event pairs, 1222 based on Foata normal form. 0/3032 useless extension candidates. Maximal degree in co-relation 7610. Up to 2329 conditions per place. [2025-01-10 00:55:17,211 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 72 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2025-01-10 00:55:17,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 125 transitions, 534 flow [2025-01-10 00:55:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2025-01-10 00:55:17,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2025-01-10 00:55:17,216 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 304 flow. Second operand 3 states and 276 transitions. [2025-01-10 00:55:17,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 125 transitions, 534 flow [2025-01-10 00:55:17,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 125 transitions, 502 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:17,225 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 296 flow [2025-01-10 00:55:17,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2025-01-10 00:55:17,226 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -10 predicate places. [2025-01-10 00:55:17,227 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 296 flow [2025-01-10 00:55:17,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-01-10 00:55:17,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:17,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:17,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:55:17,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:17,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash 369015338, now seen corresponding path program 1 times [2025-01-10 00:55:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989577886] [2025-01-10 00:55:17,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:17,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:17,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:17,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:17,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:17,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:17,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989577886] [2025-01-10 00:55:17,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989577886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:17,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:17,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195545711] [2025-01-10 00:55:17,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:17,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:17,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:17,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:17,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 00:55:17,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-01-10 00:55:17,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:17,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 00:55:17,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:17,589 INFO L124 PetriNetUnfolderBase]: 1524/3794 cut-off events. [2025-01-10 00:55:17,589 INFO L125 PetriNetUnfolderBase]: For 1187/1273 co-relation queries the response was YES. [2025-01-10 00:55:17,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7789 conditions, 3794 events. 1524/3794 cut-off events. For 1187/1273 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 30949 event pairs, 1181 based on Foata normal form. 115/3126 useless extension candidates. Maximal degree in co-relation 7511. Up to 2246 conditions per place. [2025-01-10 00:55:17,602 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 64 selfloop transitions, 7 changer transitions 0/122 dead transitions. [2025-01-10 00:55:17,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 122 transitions, 503 flow [2025-01-10 00:55:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2025-01-10 00:55:17,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6452380952380953 [2025-01-10 00:55:17,604 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 296 flow. Second operand 3 states and 271 transitions. [2025-01-10 00:55:17,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 122 transitions, 503 flow [2025-01-10 00:55:17,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 122 transitions, 496 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:17,607 INFO L231 Difference]: Finished difference. Result has 97 places, 107 transitions, 346 flow [2025-01-10 00:55:17,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=97, PETRI_TRANSITIONS=107} [2025-01-10 00:55:17,611 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -8 predicate places. [2025-01-10 00:55:17,611 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 107 transitions, 346 flow [2025-01-10 00:55:17,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-01-10 00:55:17,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:17,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:17,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:55:17,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:17,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:17,612 INFO L85 PathProgramCache]: Analyzing trace with hash 369015337, now seen corresponding path program 1 times [2025-01-10 00:55:17,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:17,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736706841] [2025-01-10 00:55:17,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:17,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:17,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:17,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:17,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:17,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:17,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:17,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736706841] [2025-01-10 00:55:17,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736706841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:17,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:17,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:17,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144325889] [2025-01-10 00:55:17,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:17,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:17,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:17,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:17,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:17,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-01-10 00:55:17,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 107 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-01-10 00:55:17,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:17,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-01-10 00:55:17,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:17,936 INFO L124 PetriNetUnfolderBase]: 1641/3895 cut-off events. [2025-01-10 00:55:17,936 INFO L125 PetriNetUnfolderBase]: For 1834/1928 co-relation queries the response was YES. [2025-01-10 00:55:17,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8361 conditions, 3895 events. 1641/3895 cut-off events. For 1834/1928 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 30938 event pairs, 1174 based on Foata normal form. 46/3213 useless extension candidates. Maximal degree in co-relation 7996. Up to 2155 conditions per place. [2025-01-10 00:55:17,948 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 70 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2025-01-10 00:55:17,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 123 transitions, 544 flow [2025-01-10 00:55:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2025-01-10 00:55:17,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-01-10 00:55:17,950 INFO L175 Difference]: Start difference. First operand has 97 places, 107 transitions, 346 flow. Second operand 3 states and 268 transitions. [2025-01-10 00:55:17,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 123 transitions, 544 flow [2025-01-10 00:55:17,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 123 transitions, 529 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:17,955 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 335 flow [2025-01-10 00:55:17,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=335, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-01-10 00:55:17,955 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -8 predicate places. [2025-01-10 00:55:17,955 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 335 flow [2025-01-10 00:55:17,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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-01-10 00:55:17,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:17,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:17,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:55:17,956 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting counter_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:17,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash 72674897, now seen corresponding path program 1 times [2025-01-10 00:55:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:17,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328706769] [2025-01-10 00:55:17,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:17,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:55:17,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:55:17,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:17,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:18,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328706769] [2025-01-10 00:55:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328706769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144719503] [2025-01-10 00:55:18,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:18,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:18,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:18,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:18,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:55:18,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:55:18,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:55:18,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:18,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:18,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:55:18,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:18,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:18,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144719503] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:18,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:18,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:55:18,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555732362] [2025-01-10 00:55:18,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:18,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:18,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:18,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:18,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-01-10 00:55:18,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 335 flow. Second operand has 7 states, 7 states have (on average 74.71428571428571) internal successors, (523), 7 states have internal predecessors, (523), 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-01-10 00:55:18,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:18,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-01-10 00:55:18,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:18,493 INFO L124 PetriNetUnfolderBase]: 1772/4145 cut-off events. [2025-01-10 00:55:18,494 INFO L125 PetriNetUnfolderBase]: For 1953/1953 co-relation queries the response was YES. [2025-01-10 00:55:18,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9118 conditions, 4145 events. 1772/4145 cut-off events. For 1953/1953 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 32455 event pairs, 1225 based on Foata normal form. 0/3383 useless extension candidates. Maximal degree in co-relation 8874. Up to 2334 conditions per place. [2025-01-10 00:55:18,512 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 146 selfloop transitions, 5 changer transitions 0/201 dead transitions. [2025-01-10 00:55:18,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 201 transitions, 989 flow [2025-01-10 00:55:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:55:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:55:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2025-01-10 00:55:18,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6595238095238095 [2025-01-10 00:55:18,514 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 335 flow. Second operand 6 states and 554 transitions. [2025-01-10 00:55:18,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 201 transitions, 989 flow [2025-01-10 00:55:18,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 201 transitions, 978 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:18,550 INFO L231 Difference]: Finished difference. Result has 104 places, 109 transitions, 368 flow [2025-01-10 00:55:18,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=104, PETRI_TRANSITIONS=109} [2025-01-10 00:55:18,551 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -1 predicate places. [2025-01-10 00:55:18,551 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 109 transitions, 368 flow [2025-01-10 00:55:18,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.71428571428571) internal successors, (523), 7 states have internal predecessors, (523), 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-01-10 00:55:18,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:18,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:18,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:18,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 00:55:18,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:18,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1071846384, now seen corresponding path program 1 times [2025-01-10 00:55:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482697995] [2025-01-10 00:55:18,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:18,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:55:18,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:55:18,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:18,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:18,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482697995] [2025-01-10 00:55:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482697995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:18,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:18,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442761087] [2025-01-10 00:55:18,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:18,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:18,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:18,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:18,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 140 [2025-01-10 00:55:18,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 109 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-01-10 00:55:18,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:18,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 140 [2025-01-10 00:55:18,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:19,139 INFO L124 PetriNetUnfolderBase]: 2815/6137 cut-off events. [2025-01-10 00:55:19,140 INFO L125 PetriNetUnfolderBase]: For 2869/2951 co-relation queries the response was YES. [2025-01-10 00:55:19,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13592 conditions, 6137 events. 2815/6137 cut-off events. For 2869/2951 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 48422 event pairs, 1223 based on Foata normal form. 46/5011 useless extension candidates. Maximal degree in co-relation 13331. Up to 2703 conditions per place. [2025-01-10 00:55:19,164 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 89 selfloop transitions, 3 changer transitions 2/129 dead transitions. [2025-01-10 00:55:19,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 129 transitions, 648 flow [2025-01-10 00:55:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2025-01-10 00:55:19,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-01-10 00:55:19,166 INFO L175 Difference]: Start difference. First operand has 104 places, 109 transitions, 368 flow. Second operand 3 states and 260 transitions. [2025-01-10 00:55:19,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 129 transitions, 648 flow [2025-01-10 00:55:19,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 129 transitions, 621 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:19,174 INFO L231 Difference]: Finished difference. Result has 94 places, 93 transitions, 317 flow [2025-01-10 00:55:19,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=94, PETRI_TRANSITIONS=93} [2025-01-10 00:55:19,175 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -11 predicate places. [2025-01-10 00:55:19,175 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 317 flow [2025-01-10 00:55:19,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-01-10 00:55:19,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:19,176 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:19,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:55:19,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting counter_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:19,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:19,176 INFO L85 PathProgramCache]: Analyzing trace with hash -903927311, now seen corresponding path program 2 times [2025-01-10 00:55:19,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:19,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664039302] [2025-01-10 00:55:19,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:19,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:19,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 00:55:19,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-01-10 00:55:19,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:55:19,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 00:55:19,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:19,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664039302] [2025-01-10 00:55:19,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664039302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:19,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:19,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427780015] [2025-01-10 00:55:19,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:19,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:19,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:19,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:19,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:19,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-01-10 00:55:19,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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-01-10 00:55:19,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:19,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-01-10 00:55:19,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:19,537 INFO L124 PetriNetUnfolderBase]: 1598/3254 cut-off events. [2025-01-10 00:55:19,537 INFO L125 PetriNetUnfolderBase]: For 1994/1994 co-relation queries the response was YES. [2025-01-10 00:55:19,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8187 conditions, 3254 events. 1598/3254 cut-off events. For 1994/1994 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 22342 event pairs, 510 based on Foata normal form. 47/2935 useless extension candidates. Maximal degree in co-relation 8003. Up to 1489 conditions per place. [2025-01-10 00:55:19,550 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 83 selfloop transitions, 4 changer transitions 10/127 dead transitions. [2025-01-10 00:55:19,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 127 transitions, 612 flow [2025-01-10 00:55:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 361 transitions. [2025-01-10 00:55:19,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6446428571428572 [2025-01-10 00:55:19,551 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 317 flow. Second operand 4 states and 361 transitions. [2025-01-10 00:55:19,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 127 transitions, 612 flow [2025-01-10 00:55:19,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 127 transitions, 594 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:19,559 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 226 flow [2025-01-10 00:55:19,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2025-01-10 00:55:19,560 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -21 predicate places. [2025-01-10 00:55:19,560 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 226 flow [2025-01-10 00:55:19,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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-01-10 00:55:19,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:19,561 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] [2025-01-10 00:55:19,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:55:19,561 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:19,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash -436420198, now seen corresponding path program 1 times [2025-01-10 00:55:19,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:19,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821247782] [2025-01-10 00:55:19,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:19,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:19,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:55:19,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:55:19,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:19,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:19,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:19,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821247782] [2025-01-10 00:55:19,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821247782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:19,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:19,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:19,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543918306] [2025-01-10 00:55:19,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:19,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:19,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:19,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:19,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:19,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-01-10 00:55:19,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 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-01-10 00:55:19,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:19,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-01-10 00:55:19,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:20,108 INFO L124 PetriNetUnfolderBase]: 2118/4211 cut-off events. [2025-01-10 00:55:20,108 INFO L125 PetriNetUnfolderBase]: For 1767/1880 co-relation queries the response was YES. [2025-01-10 00:55:20,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9729 conditions, 4211 events. 2118/4211 cut-off events. For 1767/1880 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 29274 event pairs, 1030 based on Foata normal form. 75/3799 useless extension candidates. Maximal degree in co-relation 8171. Up to 1870 conditions per place. [2025-01-10 00:55:20,125 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 64 selfloop transitions, 3 changer transitions 1/96 dead transitions. [2025-01-10 00:55:20,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 431 flow [2025-01-10 00:55:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2025-01-10 00:55:20,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-01-10 00:55:20,127 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 226 flow. Second operand 3 states and 264 transitions. [2025-01-10 00:55:20,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 431 flow [2025-01-10 00:55:20,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 96 transitions, 417 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:55:20,131 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 213 flow [2025-01-10 00:55:20,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2025-01-10 00:55:20,132 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -27 predicate places. [2025-01-10 00:55:20,132 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 213 flow [2025-01-10 00:55:20,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 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-01-10 00:55:20,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:20,133 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] [2025-01-10 00:55:20,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:55:20,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:20,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:20,133 INFO L85 PathProgramCache]: Analyzing trace with hash -319665634, now seen corresponding path program 1 times [2025-01-10 00:55:20,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:20,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734742843] [2025-01-10 00:55:20,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:20,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:55:20,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:55:20,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:20,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:20,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:20,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734742843] [2025-01-10 00:55:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734742843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655404254] [2025-01-10 00:55:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:20,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:20,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:20,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:20,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-01-10 00:55:20,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 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-01-10 00:55:20,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:20,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-01-10 00:55:20,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:20,505 INFO L124 PetriNetUnfolderBase]: 1437/3087 cut-off events. [2025-01-10 00:55:20,505 INFO L125 PetriNetUnfolderBase]: For 2123/2176 co-relation queries the response was YES. [2025-01-10 00:55:20,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7183 conditions, 3087 events. 1437/3087 cut-off events. For 2123/2176 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 21166 event pairs, 1066 based on Foata normal form. 55/2731 useless extension candidates. Maximal degree in co-relation 5951. Up to 1929 conditions per place. [2025-01-10 00:55:20,515 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 37 selfloop transitions, 0 changer transitions 22/87 dead transitions. [2025-01-10 00:55:20,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 87 transitions, 381 flow [2025-01-10 00:55:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2025-01-10 00:55:20,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2025-01-10 00:55:20,516 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 213 flow. Second operand 3 states and 256 transitions. [2025-01-10 00:55:20,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 87 transitions, 381 flow [2025-01-10 00:55:20,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 87 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:20,522 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 187 flow [2025-01-10 00:55:20,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2025-01-10 00:55:20,523 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -27 predicate places. [2025-01-10 00:55:20,523 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 187 flow [2025-01-10 00:55:20,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 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-01-10 00:55:20,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:20,523 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] [2025-01-10 00:55:20,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:55:20,523 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 00:55:20,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash -969804080, now seen corresponding path program 1 times [2025-01-10 00:55:20,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:20,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729516139] [2025-01-10 00:55:20,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:20,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:55:20,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:55:20,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:20,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:20,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729516139] [2025-01-10 00:55:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729516139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281172901] [2025-01-10 00:55:20,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:20,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:20,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:20,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:20,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-01-10 00:55:20,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 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-01-10 00:55:20,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:20,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-01-10 00:55:20,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:20,764 INFO L124 PetriNetUnfolderBase]: 1620/2822 cut-off events. [2025-01-10 00:55:20,764 INFO L125 PetriNetUnfolderBase]: For 1401/1465 co-relation queries the response was YES. [2025-01-10 00:55:20,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7133 conditions, 2822 events. 1620/2822 cut-off events. For 1401/1465 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 15909 event pairs, 654 based on Foata normal form. 40/2657 useless extension candidates. Maximal degree in co-relation 7121. Up to 1293 conditions per place. [2025-01-10 00:55:20,769 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 0 selfloop transitions, 0 changer transitions 97/97 dead transitions. [2025-01-10 00:55:20,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 443 flow [2025-01-10 00:55:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2025-01-10 00:55:20,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6107142857142858 [2025-01-10 00:55:20,772 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 187 flow. Second operand 4 states and 342 transitions. [2025-01-10 00:55:20,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 443 flow [2025-01-10 00:55:20,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 97 transitions, 427 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:20,775 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2025-01-10 00:55:20,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2025-01-10 00:55:20,777 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -39 predicate places. [2025-01-10 00:55:20,777 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2025-01-10 00:55:20,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 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-01-10 00:55:20,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (18 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2025-01-10 00:55:20,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2025-01-10 00:55:20,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2025-01-10 00:55:20,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2025-01-10 00:55:20,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 27 remaining) [2025-01-10 00:55:20,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:55:20,782 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:20,788 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:55:20,788 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:55:20,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:55:20 BasicIcfg [2025-01-10 00:55:20,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:55:20,793 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:55:20,793 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:55:20,793 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:55:20,794 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:13" (3/4) ... [2025-01-10 00:55:20,795 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:55:20,797 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure monitor_thread [2025-01-10 00:55:20,797 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure counter_thread [2025-01-10 00:55:20,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2025-01-10 00:55:20,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-10 00:55:20,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 00:55:20,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 00:55:20,863 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:55:20,863 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:55:20,863 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:55:20,864 INFO L158 Benchmark]: Toolchain (without parser) took 8785.94ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 102.3MB in the beginning and 253.0MB in the end (delta: -150.7MB). Peak memory consumption was 187.9MB. Max. memory is 16.1GB. [2025-01-10 00:55:20,864 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:20,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.53ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 42.5MB in the end (delta: 59.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 00:55:20,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.21ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 39.2MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:55:20,865 INFO L158 Benchmark]: Boogie Preprocessor took 50.87ms. Allocated memory is still 142.6MB. Free memory was 39.2MB in the beginning and 35.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:20,865 INFO L158 Benchmark]: RCFGBuilder took 669.15ms. Allocated memory is still 142.6MB. Free memory was 35.9MB in the beginning and 63.9MB in the end (delta: -28.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2025-01-10 00:55:20,866 INFO L158 Benchmark]: TraceAbstraction took 7244.13ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 63.2MB in the beginning and 257.3MB in the end (delta: -194.1MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. [2025-01-10 00:55:20,866 INFO L158 Benchmark]: Witness Printer took 70.08ms. Allocated memory is still 478.2MB. Free memory was 257.3MB in the beginning and 253.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:55:20,867 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.21ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.53ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 42.5MB in the end (delta: 59.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.21ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 39.2MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.87ms. Allocated memory is still 142.6MB. Free memory was 39.2MB in the beginning and 35.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 669.15ms. Allocated memory is still 142.6MB. Free memory was 35.9MB in the beginning and 63.9MB in the end (delta: -28.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7244.13ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 63.2MB in the beginning and 257.3MB in the end (delta: -194.1MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. * Witness Printer took 70.08ms. Allocated memory is still 478.2MB. Free memory was 257.3MB in the beginning and 253.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1835]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 159 locations, 27 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: 7.1s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1046 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 698 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2107 IncrementalHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 47 mSDtfsCounter, 2107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=10, InterpolantAutomatonStates: 52, 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, 1.1s InterpolantComputationTime, 245 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 108 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 10/13 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 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 00:55:20,882 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