./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 c00e63dc 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-?-c00e63d-m [2025-02-06 12:54:07,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:54:07,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:54:07,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:54:07,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:54:07,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:54:07,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:54:07,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:54:07,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:54:07,698 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:54:07,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:54:07,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:54:07,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:54:07,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:54:07,698 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:54:07,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:54:07,698 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:54:07,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:54:07,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:54:07,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:54:07,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:54:07,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:54:07,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:54:07,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:54:07,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:54:07,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:54:07,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:54:07,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:54:07,700 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-02-06 12:54:07,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:54:07,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:54:07,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:54:07,955 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:54:07,955 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:54:07,956 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-02-06 12:54:09,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67bd103d6/006a861f55c54b9592dff430e73a5452/FLAGad203af95 [2025-02-06 12:54:09,698 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:54:09,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i [2025-02-06 12:54:09,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67bd103d6/006a861f55c54b9592dff430e73a5452/FLAGad203af95 [2025-02-06 12:54:09,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67bd103d6/006a861f55c54b9592dff430e73a5452 [2025-02-06 12:54:09,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:54:09,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:54:09,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:54:09,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:54:09,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:54:09,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:54:09" (1/1) ... [2025-02-06 12:54:09,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a70fe34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:09, skipping insertion in model container [2025-02-06 12:54:09,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:54:09" (1/1) ... [2025-02-06 12:54:09,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:54:10,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:54:10,478 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:54:10,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:54:10,617 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:54:10,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10 WrapperNode [2025-02-06 12:54:10,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:54:10,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:54:10,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:54:10,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:54:10,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,670 INFO L138 Inliner]: procedures = 525, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 105 [2025-02-06 12:54:10,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:54:10,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:54:10,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:54:10,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:54:10,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,695 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-02-06 12:54:10,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,712 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:54:10,725 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:54:10,729 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:54:10,729 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:54:10,730 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (1/1) ... [2025-02-06 12:54:10,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:54:10,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:10,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:54:10,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure counter_thread [2025-02-06 12:54:10,788 INFO L138 BoogieDeclarations]: Found implementation of procedure counter_thread [2025-02-06 12:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure monitor_thread [2025-02-06 12:54:10,788 INFO L138 BoogieDeclarations]: Found implementation of procedure monitor_thread [2025-02-06 12:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:54:10,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-02-06 12:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:54:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 12:54:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 12:54:10,794 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:54:11,004 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:54:11,006 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:54:11,385 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:54:11,385 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:54:11,490 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:54:11,490 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:54:11,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:54:11 BoogieIcfgContainer [2025-02-06 12:54:11,491 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:54:11,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:54:11,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:54:11,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:54:11,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:54:09" (1/3) ... [2025-02-06 12:54:11,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a81a378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:54:11, skipping insertion in model container [2025-02-06 12:54:11,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:10" (2/3) ... [2025-02-06 12:54:11,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a81a378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:54:11, skipping insertion in model container [2025-02-06 12:54:11,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:54:11" (3/3) ... [2025-02-06 12:54:11,497 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_36-trylock_nr.i [2025-02-06 12:54:11,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:54:11,513 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-02-06 12:54:11,513 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:54:11,575 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:54:11,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 140 transitions, 294 flow [2025-02-06 12:54:11,649 INFO L124 PetriNetUnfolderBase]: 39/138 cut-off events. [2025-02-06 12:54:11,654 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:54:11,657 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 400 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-02-06 12:54:11,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 140 transitions, 294 flow [2025-02-06 12:54:11,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 137 transitions, 286 flow [2025-02-06 12:54:11,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:54:11,682 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;@11dfc437, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:54:11,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-06 12:54:11,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:54:11,685 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:54:11,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:54:11,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:11,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:54:11,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:11,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:11,693 INFO L85 PathProgramCache]: Analyzing trace with hash 509813, now seen corresponding path program 1 times [2025-02-06 12:54:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985970380] [2025-02-06 12:54:11,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:11,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:54:11,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:54:11,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:11,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:11,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:11,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985970380] [2025-02-06 12:54:11,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985970380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:11,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:11,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:54:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147273592] [2025-02-06 12:54:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:11,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:11,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:12,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:12,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:12,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 140 [2025-02-06 12:54:12,073 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-02-06 12:54:12,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:12,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 140 [2025-02-06 12:54:12,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:12,445 INFO L124 PetriNetUnfolderBase]: 993/2847 cut-off events. [2025-02-06 12:54:12,446 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-06 12:54:12,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4422 conditions, 2847 events. 993/2847 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 24340 event pairs, 355 based on Foata normal form. 1000/3012 useless extension candidates. Maximal degree in co-relation 4213. Up to 832 conditions per place. [2025-02-06 12:54:12,465 INFO L140 encePairwiseOnDemand]: 112/140 looper letters, 62 selfloop transitions, 9 changer transitions 5/135 dead transitions. [2025-02-06 12:54:12,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 135 transitions, 432 flow [2025-02-06 12:54:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2025-02-06 12:54:12,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7785714285714286 [2025-02-06 12:54:12,475 INFO L175 Difference]: Start difference. First operand has 105 places, 137 transitions, 286 flow. Second operand 3 states and 327 transitions. [2025-02-06 12:54:12,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 135 transitions, 432 flow [2025-02-06 12:54:12,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 420 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:54:12,481 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 253 flow [2025-02-06 12:54:12,483 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-02-06 12:54:12,484 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -10 predicate places. [2025-02-06 12:54:12,485 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 253 flow [2025-02-06 12:54:12,485 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-02-06 12:54:12,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:12,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:12,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:54:12,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:12,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:12,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1973456404, now seen corresponding path program 1 times [2025-02-06 12:54:12,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:12,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113744518] [2025-02-06 12:54:12,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:12,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:54:12,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:54:12,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:12,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:12,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:12,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113744518] [2025-02-06 12:54:12,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113744518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:12,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:12,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:12,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461342965] [2025-02-06 12:54:12,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:12,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:12,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:12,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:12,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:12,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-02-06 12:54:12,723 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-02-06 12:54:12,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:12,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-02-06 12:54:12,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:13,269 INFO L124 PetriNetUnfolderBase]: 1090/2646 cut-off events. [2025-02-06 12:54:13,269 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-02-06 12:54:13,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4843 conditions, 2646 events. 1090/2646 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 20356 event pairs, 771 based on Foata normal form. 0/2062 useless extension candidates. Maximal degree in co-relation 1876. Up to 1523 conditions per place. [2025-02-06 12:54:13,297 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 57 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-02-06 12:54:13,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 115 transitions, 397 flow [2025-02-06 12:54:13,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-02-06 12:54:13,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-02-06 12:54:13,303 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 253 flow. Second operand 3 states and 266 transitions. [2025-02-06 12:54:13,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 115 transitions, 397 flow [2025-02-06 12:54:13,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 115 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:13,311 INFO L231 Difference]: Finished difference. Result has 92 places, 103 transitions, 246 flow [2025-02-06 12:54:13,311 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-02-06 12:54:13,311 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -13 predicate places. [2025-02-06 12:54:13,312 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 103 transitions, 246 flow [2025-02-06 12:54:13,312 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-02-06 12:54:13,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:13,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:13,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:54:13,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:13,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1973456405, now seen corresponding path program 1 times [2025-02-06 12:54:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666808862] [2025-02-06 12:54:13,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:13,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:54:13,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:54:13,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:13,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666808862] [2025-02-06 12:54:13,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666808862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:13,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:13,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:13,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949002952] [2025-02-06 12:54:13,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:13,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:13,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:13,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:13,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:13,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-02-06 12:54:13,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 103 transitions, 246 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-02-06 12:54:13,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:13,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-02-06 12:54:13,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:13,913 INFO L124 PetriNetUnfolderBase]: 1074/2623 cut-off events. [2025-02-06 12:54:13,913 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2025-02-06 12:54:13,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 2623 events. 1074/2623 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 20199 event pairs, 768 based on Foata normal form. 13/2054 useless extension candidates. Maximal degree in co-relation 4461. Up to 1527 conditions per place. [2025-02-06 12:54:13,929 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 53 selfloop transitions, 4 changer transitions 2/115 dead transitions. [2025-02-06 12:54:13,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 392 flow [2025-02-06 12:54:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2025-02-06 12:54:13,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6404761904761904 [2025-02-06 12:54:13,931 INFO L175 Difference]: Start difference. First operand has 92 places, 103 transitions, 246 flow. Second operand 3 states and 269 transitions. [2025-02-06 12:54:13,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 392 flow [2025-02-06 12:54:13,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 115 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:13,936 INFO L231 Difference]: Finished difference. Result has 94 places, 105 transitions, 270 flow [2025-02-06 12:54:13,936 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=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=94, PETRI_TRANSITIONS=105} [2025-02-06 12:54:13,937 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -11 predicate places. [2025-02-06 12:54:13,937 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 105 transitions, 270 flow [2025-02-06 12:54:13,937 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-02-06 12:54:13,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:13,938 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:13,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:54:13,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:13,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:13,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2139586131, now seen corresponding path program 1 times [2025-02-06 12:54:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113287951] [2025-02-06 12:54:13,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:13,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:54:13,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:54:13,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:13,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:14,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:14,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113287951] [2025-02-06 12:54:14,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113287951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:14,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:14,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:14,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110783168] [2025-02-06 12:54:14,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:14,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:14,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:14,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:14,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:14,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-02-06 12:54:14,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 105 transitions, 270 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-02-06 12:54:14,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:14,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-02-06 12:54:14,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:14,318 INFO L124 PetriNetUnfolderBase]: 1729/3882 cut-off events. [2025-02-06 12:54:14,319 INFO L125 PetriNetUnfolderBase]: For 534/555 co-relation queries the response was YES. [2025-02-06 12:54:14,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7020 conditions, 3882 events. 1729/3882 cut-off events. For 534/555 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 31051 event pairs, 868 based on Foata normal form. 20/3149 useless extension candidates. Maximal degree in co-relation 6901. Up to 1523 conditions per place. [2025-02-06 12:54:14,338 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 72 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2025-02-06 12:54:14,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 129 transitions, 478 flow [2025-02-06 12:54:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-02-06 12:54:14,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2025-02-06 12:54:14,339 INFO L175 Difference]: Start difference. First operand has 94 places, 105 transitions, 270 flow. Second operand 3 states and 279 transitions. [2025-02-06 12:54:14,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 129 transitions, 478 flow [2025-02-06 12:54:14,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 129 transitions, 470 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:14,344 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 264 flow [2025-02-06 12:54:14,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2025-02-06 12:54:14,344 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -11 predicate places. [2025-02-06 12:54:14,344 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 264 flow [2025-02-06 12:54:14,344 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-02-06 12:54:14,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:14,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:14,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:54:14,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:14,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:14,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2139586130, now seen corresponding path program 1 times [2025-02-06 12:54:14,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:14,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777812928] [2025-02-06 12:54:14,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:14,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:14,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:54:14,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:54:14,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:14,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:14,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:14,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777812928] [2025-02-06 12:54:14,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777812928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:14,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:14,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362697967] [2025-02-06 12:54:14,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:14,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:14,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:14,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:14,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:14,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-02-06 12:54:14,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 264 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-02-06 12:54:14,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:14,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-02-06 12:54:14,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:14,717 INFO L124 PetriNetUnfolderBase]: 1857/4078 cut-off events. [2025-02-06 12:54:14,718 INFO L125 PetriNetUnfolderBase]: For 832/855 co-relation queries the response was YES. [2025-02-06 12:54:14,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7673 conditions, 4078 events. 1857/4078 cut-off events. For 832/855 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 32414 event pairs, 936 based on Foata normal form. 20/3258 useless extension candidates. Maximal degree in co-relation 6791. Up to 1837 conditions per place. [2025-02-06 12:54:14,735 INFO L140 encePairwiseOnDemand]: 133/140 looper letters, 69 selfloop transitions, 7 changer transitions 0/130 dead transitions. [2025-02-06 12:54:14,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 130 transitions, 480 flow [2025-02-06 12:54:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-02-06 12:54:14,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.669047619047619 [2025-02-06 12:54:14,736 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 264 flow. Second operand 3 states and 281 transitions. [2025-02-06 12:54:14,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 130 transitions, 480 flow [2025-02-06 12:54:14,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 130 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:14,741 INFO L231 Difference]: Finished difference. Result has 97 places, 109 transitions, 324 flow [2025-02-06 12:54:14,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=97, PETRI_TRANSITIONS=109} [2025-02-06 12:54:14,741 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -8 predicate places. [2025-02-06 12:54:14,741 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 109 transitions, 324 flow [2025-02-06 12:54:14,742 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-02-06 12:54:14,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:14,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:14,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:54:14,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting counter_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:14,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:14,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2071925359, now seen corresponding path program 1 times [2025-02-06 12:54:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482944168] [2025-02-06 12:54:14,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:14,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:54:14,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:54:14,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:14,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:14,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:14,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482944168] [2025-02-06 12:54:14,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482944168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:14,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:14,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:54:14,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800636836] [2025-02-06 12:54:14,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:14,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:54:14,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:14,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:54:14,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:54:14,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-02-06 12:54:14,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 109 transitions, 324 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-02-06 12:54:14,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:14,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-02-06 12:54:14,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:15,129 INFO L124 PetriNetUnfolderBase]: 1538/3515 cut-off events. [2025-02-06 12:54:15,129 INFO L125 PetriNetUnfolderBase]: For 2188/2188 co-relation queries the response was YES. [2025-02-06 12:54:15,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7681 conditions, 3515 events. 1538/3515 cut-off events. For 2188/2188 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 27144 event pairs, 588 based on Foata normal form. 0/2879 useless extension candidates. Maximal degree in co-relation 7092. Up to 1118 conditions per place. [2025-02-06 12:54:15,142 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 123 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2025-02-06 12:54:15,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 178 transitions, 826 flow [2025-02-06 12:54:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:54:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:54:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2025-02-06 12:54:15,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6542857142857142 [2025-02-06 12:54:15,144 INFO L175 Difference]: Start difference. First operand has 97 places, 109 transitions, 324 flow. Second operand 5 states and 458 transitions. [2025-02-06 12:54:15,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 178 transitions, 826 flow [2025-02-06 12:54:15,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 178 transitions, 770 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:15,152 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 282 flow [2025-02-06 12:54:15,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2025-02-06 12:54:15,152 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -12 predicate places. [2025-02-06 12:54:15,152 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 282 flow [2025-02-06 12:54:15,153 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-02-06 12:54:15,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:15,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:15,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:54:15,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:15,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:15,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1607068461, now seen corresponding path program 1 times [2025-02-06 12:54:15,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251198187] [2025-02-06 12:54:15,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:15,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:54:15,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:54:15,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:15,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:15,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:15,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251198187] [2025-02-06 12:54:15,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251198187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:15,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:15,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728060504] [2025-02-06 12:54:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:15,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:15,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:15,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:15,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-02-06 12:54:15,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 282 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-02-06 12:54:15,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:15,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-02-06 12:54:15,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:15,682 INFO L124 PetriNetUnfolderBase]: 1687/3915 cut-off events. [2025-02-06 12:54:15,682 INFO L125 PetriNetUnfolderBase]: For 1229/1229 co-relation queries the response was YES. [2025-02-06 12:54:15,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8122 conditions, 3915 events. 1687/3915 cut-off events. For 1229/1229 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 31035 event pairs, 1158 based on Foata normal form. 0/3188 useless extension candidates. Maximal degree in co-relation 7840. Up to 2165 conditions per place. [2025-02-06 12:54:15,695 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 66 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2025-02-06 12:54:15,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 118 transitions, 480 flow [2025-02-06 12:54:15,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2025-02-06 12:54:15,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-02-06 12:54:15,697 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 282 flow. Second operand 3 states and 268 transitions. [2025-02-06 12:54:15,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 118 transitions, 480 flow [2025-02-06 12:54:15,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 118 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:15,700 INFO L231 Difference]: Finished difference. Result has 93 places, 100 transitions, 282 flow [2025-02-06 12:54:15,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=93, PETRI_TRANSITIONS=100} [2025-02-06 12:54:15,701 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -12 predicate places. [2025-02-06 12:54:15,701 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 100 transitions, 282 flow [2025-02-06 12:54:15,701 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-02-06 12:54:15,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:15,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:15,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:54:15,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:15,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1607068462, now seen corresponding path program 1 times [2025-02-06 12:54:15,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:15,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320241095] [2025-02-06 12:54:15,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:15,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:15,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:54:15,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:54:15,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:15,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:15,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320241095] [2025-02-06 12:54:15,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320241095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:15,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:15,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:15,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022639282] [2025-02-06 12:54:15,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:15,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:15,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:15,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:15,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-02-06 12:54:15,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 100 transitions, 282 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-02-06 12:54:15,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:15,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-02-06 12:54:15,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:16,059 INFO L124 PetriNetUnfolderBase]: 1552/3713 cut-off events. [2025-02-06 12:54:16,059 INFO L125 PetriNetUnfolderBase]: For 1229/1229 co-relation queries the response was YES. [2025-02-06 12:54:16,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7614 conditions, 3713 events. 1552/3713 cut-off events. For 1229/1229 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 29801 event pairs, 1167 based on Foata normal form. 73/3075 useless extension candidates. Maximal degree in co-relation 7374. Up to 2258 conditions per place. [2025-02-06 12:54:16,072 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 62 selfloop transitions, 7 changer transitions 0/118 dead transitions. [2025-02-06 12:54:16,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 118 transitions, 478 flow [2025-02-06 12:54:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2025-02-06 12:54:16,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6452380952380953 [2025-02-06 12:54:16,073 INFO L175 Difference]: Start difference. First operand has 93 places, 100 transitions, 282 flow. Second operand 3 states and 271 transitions. [2025-02-06 12:54:16,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 118 transitions, 478 flow [2025-02-06 12:54:16,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 118 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:16,076 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 333 flow [2025-02-06 12:54:16,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=95, PETRI_TRANSITIONS=104} [2025-02-06 12:54:16,077 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -10 predicate places. [2025-02-06 12:54:16,077 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 333 flow [2025-02-06 12:54:16,077 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-02-06 12:54:16,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:16,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:16,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:54:16,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting counter_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:16,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:16,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1811177415, now seen corresponding path program 1 times [2025-02-06 12:54:16,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:16,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620796493] [2025-02-06 12:54:16,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:16,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:54:16,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:54:16,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:16,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620796493] [2025-02-06 12:54:16,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620796493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:16,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:16,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:54:16,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929160272] [2025-02-06 12:54:16,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:16,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:16,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:16,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:16,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:16,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-02-06 12:54:16,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 104 transitions, 333 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-02-06 12:54:16,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:16,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-02-06 12:54:16,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:16,393 INFO L124 PetriNetUnfolderBase]: 1557/3729 cut-off events. [2025-02-06 12:54:16,394 INFO L125 PetriNetUnfolderBase]: For 1677/1677 co-relation queries the response was YES. [2025-02-06 12:54:16,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7928 conditions, 3729 events. 1557/3729 cut-off events. For 1677/1677 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 29451 event pairs, 1225 based on Foata normal form. 0/3002 useless extension candidates. Maximal degree in co-relation 7645. Up to 2333 conditions per place. [2025-02-06 12:54:16,408 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 77 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2025-02-06 12:54:16,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 128 transitions, 581 flow [2025-02-06 12:54:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2025-02-06 12:54:16,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2025-02-06 12:54:16,409 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 333 flow. Second operand 3 states and 276 transitions. [2025-02-06 12:54:16,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 128 transitions, 581 flow [2025-02-06 12:54:16,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 128 transitions, 561 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:16,415 INFO L231 Difference]: Finished difference. Result has 97 places, 105 transitions, 330 flow [2025-02-06 12:54:16,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=97, PETRI_TRANSITIONS=105} [2025-02-06 12:54:16,415 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -8 predicate places. [2025-02-06 12:54:16,416 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 105 transitions, 330 flow [2025-02-06 12:54:16,416 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-02-06 12:54:16,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:16,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:16,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:54:16,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting counter_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:16,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash 937806644, now seen corresponding path program 1 times [2025-02-06 12:54:16,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:16,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876002313] [2025-02-06 12:54:16,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:16,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:16,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:54:16,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:54:16,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:16,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:16,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:16,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876002313] [2025-02-06 12:54:16,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876002313] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:16,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555880995] [2025-02-06 12:54:16,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:16,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:16,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:16,464 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-02-06 12:54:16,469 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-02-06 12:54:16,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:54:16,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:54:16,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:16,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:16,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:54:16,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:16,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:16,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555880995] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:16,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:54:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457658513] [2025-02-06 12:54:16,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:16,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:54:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:16,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:54:16,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:54:16,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-02-06 12:54:16,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 105 transitions, 330 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-02-06 12:54:16,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:16,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-02-06 12:54:16,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:16,923 INFO L124 PetriNetUnfolderBase]: 1747/4021 cut-off events. [2025-02-06 12:54:16,923 INFO L125 PetriNetUnfolderBase]: For 1727/1727 co-relation queries the response was YES. [2025-02-06 12:54:16,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9077 conditions, 4021 events. 1747/4021 cut-off events. For 1727/1727 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 31325 event pairs, 1225 based on Foata normal form. 0/3338 useless extension candidates. Maximal degree in co-relation 8830. Up to 2333 conditions per place. [2025-02-06 12:54:16,938 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 146 selfloop transitions, 5 changer transitions 0/200 dead transitions. [2025-02-06 12:54:16,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 200 transitions, 976 flow [2025-02-06 12:54:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:54:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:54:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2025-02-06 12:54:16,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6595238095238095 [2025-02-06 12:54:16,940 INFO L175 Difference]: Start difference. First operand has 97 places, 105 transitions, 330 flow. Second operand 6 states and 554 transitions. [2025-02-06 12:54:16,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 200 transitions, 976 flow [2025-02-06 12:54:16,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 200 transitions, 972 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:16,948 INFO L231 Difference]: Finished difference. Result has 104 places, 108 transitions, 362 flow [2025-02-06 12:54:16,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=104, PETRI_TRANSITIONS=108} [2025-02-06 12:54:16,950 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -1 predicate places. [2025-02-06 12:54:16,950 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 108 transitions, 362 flow [2025-02-06 12:54:16,950 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-02-06 12:54:16,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:16,950 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-02-06 12:54:16,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:54:17,151 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-02-06 12:54:17,152 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:17,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2097621817, now seen corresponding path program 1 times [2025-02-06 12:54:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:17,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995359456] [2025-02-06 12:54:17,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:17,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:17,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:54:17,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:54:17,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:17,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995359456] [2025-02-06 12:54:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995359456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:17,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:17,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:54:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470260244] [2025-02-06 12:54:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:17,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:17,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:17,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:17,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 140 [2025-02-06 12:54:17,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 108 transitions, 362 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-02-06 12:54:17,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:17,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 140 [2025-02-06 12:54:17,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:17,498 INFO L124 PetriNetUnfolderBase]: 2813/6147 cut-off events. [2025-02-06 12:54:17,498 INFO L125 PetriNetUnfolderBase]: For 2757/2837 co-relation queries the response was YES. [2025-02-06 12:54:17,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13591 conditions, 6147 events. 2813/6147 cut-off events. For 2757/2837 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 48597 event pairs, 1223 based on Foata normal form. 43/5026 useless extension candidates. Maximal degree in co-relation 13335. Up to 2702 conditions per place. [2025-02-06 12:54:17,518 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 89 selfloop transitions, 3 changer transitions 2/128 dead transitions. [2025-02-06 12:54:17,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 128 transitions, 642 flow [2025-02-06 12:54:17,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2025-02-06 12:54:17,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-02-06 12:54:17,519 INFO L175 Difference]: Start difference. First operand has 104 places, 108 transitions, 362 flow. Second operand 3 states and 260 transitions. [2025-02-06 12:54:17,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 128 transitions, 642 flow [2025-02-06 12:54:17,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 128 transitions, 615 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:17,529 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 311 flow [2025-02-06 12:54:17,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2025-02-06 12:54:17,530 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -11 predicate places. [2025-02-06 12:54:17,530 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 311 flow [2025-02-06 12:54:17,530 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-02-06 12:54:17,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:17,530 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-02-06 12:54:17,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:54:17,530 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:17,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash 407305554, now seen corresponding path program 1 times [2025-02-06 12:54:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:17,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823445675] [2025-02-06 12:54:17,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:17,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:54:17,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:54:17,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:17,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:17,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823445675] [2025-02-06 12:54:17,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823445675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:17,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:17,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:54:17,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901996404] [2025-02-06 12:54:17,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:17,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:54:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:17,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:54:17,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:54:17,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-02-06 12:54:17,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 311 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-02-06 12:54:17,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:17,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-02-06 12:54:17,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:18,068 INFO L124 PetriNetUnfolderBase]: 2620/5299 cut-off events. [2025-02-06 12:54:18,068 INFO L125 PetriNetUnfolderBase]: For 2283/2422 co-relation queries the response was YES. [2025-02-06 12:54:18,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12348 conditions, 5299 events. 2620/5299 cut-off events. For 2283/2422 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 39717 event pairs, 1298 based on Foata normal form. 91/4696 useless extension candidates. Maximal degree in co-relation 12100. Up to 2341 conditions per place. [2025-02-06 12:54:18,090 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 83 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-02-06 12:54:18,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 122 transitions, 581 flow [2025-02-06 12:54:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2025-02-06 12:54:18,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6452380952380953 [2025-02-06 12:54:18,092 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 311 flow. Second operand 3 states and 271 transitions. [2025-02-06 12:54:18,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 122 transitions, 581 flow [2025-02-06 12:54:18,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 122 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:18,097 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 307 flow [2025-02-06 12:54:18,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=91, PETRI_TRANSITIONS=91} [2025-02-06 12:54:18,097 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -14 predicate places. [2025-02-06 12:54:18,098 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 307 flow [2025-02-06 12:54:18,099 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-02-06 12:54:18,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:18,099 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-02-06 12:54:18,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:54:18,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:18,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1231886096, now seen corresponding path program 1 times [2025-02-06 12:54:18,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:18,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392395980] [2025-02-06 12:54:18,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:18,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:18,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:54:18,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:54:18,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:18,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:18,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:18,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392395980] [2025-02-06 12:54:18,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392395980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:18,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:18,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:54:18,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122215120] [2025-02-06 12:54:18,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:18,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:54:18,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:18,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:54:18,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:54:18,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-02-06 12:54:18,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 307 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-02-06 12:54:18,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:18,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-02-06 12:54:18,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:18,563 INFO L124 PetriNetUnfolderBase]: 1838/4042 cut-off events. [2025-02-06 12:54:18,563 INFO L125 PetriNetUnfolderBase]: For 2829/2886 co-relation queries the response was YES. [2025-02-06 12:54:18,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9599 conditions, 4042 events. 1838/4042 cut-off events. For 2829/2886 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 30630 event pairs, 1348 based on Foata normal form. 60/3504 useless extension candidates. Maximal degree in co-relation 9364. Up to 2441 conditions per place. [2025-02-06 12:54:18,582 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 68 selfloop transitions, 3 changer transitions 3/110 dead transitions. [2025-02-06 12:54:18,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 110 transitions, 522 flow [2025-02-06 12:54:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2025-02-06 12:54:18,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2025-02-06 12:54:18,583 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 307 flow. Second operand 3 states and 261 transitions. [2025-02-06 12:54:18,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 110 transitions, 522 flow [2025-02-06 12:54:18,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 110 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:18,589 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 306 flow [2025-02-06 12:54:18,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2025-02-06 12:54:18,590 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -14 predicate places. [2025-02-06 12:54:18,590 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 306 flow [2025-02-06 12:54:18,590 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-02-06 12:54:18,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:18,590 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-02-06 12:54:18,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:54:18,591 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:18,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:18,592 INFO L85 PathProgramCache]: Analyzing trace with hash 432913428, now seen corresponding path program 1 times [2025-02-06 12:54:18,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:18,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000346488] [2025-02-06 12:54:18,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:18,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:18,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:54:18,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:54:18,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:18,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:18,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000346488] [2025-02-06 12:54:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000346488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:54:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606554232] [2025-02-06 12:54:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:18,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:54:18,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:18,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:54:18,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:54:18,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-02-06 12:54:18,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 306 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-02-06 12:54:18,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:18,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-02-06 12:54:18,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:19,107 INFO L124 PetriNetUnfolderBase]: 2301/4332 cut-off events. [2025-02-06 12:54:19,108 INFO L125 PetriNetUnfolderBase]: For 2514/2592 co-relation queries the response was YES. [2025-02-06 12:54:19,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11061 conditions, 4332 events. 2301/4332 cut-off events. For 2514/2592 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 29319 event pairs, 1025 based on Foata normal form. 47/3871 useless extension candidates. Maximal degree in co-relation 10875. Up to 1997 conditions per place. [2025-02-06 12:54:19,141 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 88 selfloop transitions, 4 changer transitions 11/130 dead transitions. [2025-02-06 12:54:19,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 130 transitions, 648 flow [2025-02-06 12:54:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:54:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:54:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 351 transitions. [2025-02-06 12:54:19,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6267857142857143 [2025-02-06 12:54:19,144 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 306 flow. Second operand 4 states and 351 transitions. [2025-02-06 12:54:19,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 130 transitions, 648 flow [2025-02-06 12:54:19,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 130 transitions, 645 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:19,157 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 272 flow [2025-02-06 12:54:19,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-02-06 12:54:19,158 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -17 predicate places. [2025-02-06 12:54:19,158 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 272 flow [2025-02-06 12:54:19,158 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-02-06 12:54:19,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:19,158 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:19,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:54:19,158 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting counter_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 12:54:19,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:19,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1834331385, now seen corresponding path program 2 times [2025-02-06 12:54:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504067808] [2025-02-06 12:54:19,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:54:19,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:19,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-06 12:54:19,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-02-06 12:54:19,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:54:19,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 12:54:19,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504067808] [2025-02-06 12:54:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504067808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:19,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:19,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:54:19,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267397378] [2025-02-06 12:54:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:19,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:54:19,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:19,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:54:19,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:54:19,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-02-06 12:54:19,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 272 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-02-06 12:54:19,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:19,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-02-06 12:54:19,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:19,519 INFO L124 PetriNetUnfolderBase]: 1639/2980 cut-off events. [2025-02-06 12:54:19,520 INFO L125 PetriNetUnfolderBase]: For 1875/1875 co-relation queries the response was YES. [2025-02-06 12:54:19,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8303 conditions, 2980 events. 1639/2980 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 17801 event pairs, 466 based on Foata normal form. 57/2883 useless extension candidates. Maximal degree in co-relation 8149. Up to 1557 conditions per place. [2025-02-06 12:54:19,524 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 0 selfloop transitions, 0 changer transitions 105/105 dead transitions. [2025-02-06 12:54:19,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 541 flow [2025-02-06 12:54:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:54:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:54:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2025-02-06 12:54:19,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-02-06 12:54:19,526 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 272 flow. Second operand 4 states and 352 transitions. [2025-02-06 12:54:19,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 541 flow [2025-02-06 12:54:19,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 509 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 12:54:19,531 INFO L231 Difference]: Finished difference. Result has 74 places, 0 transitions, 0 flow [2025-02-06 12:54:19,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=74, PETRI_TRANSITIONS=0} [2025-02-06 12:54:19,532 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -31 predicate places. [2025-02-06 12:54:19,532 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 0 transitions, 0 flow [2025-02-06 12:54:19,532 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-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (18 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-02-06 12:54:19,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 27 remaining) [2025-02-06 12:54:19,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2025-02-06 12:54:19,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2025-02-06 12:54:19,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2025-02-06 12:54:19,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2025-02-06 12:54:19,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2025-02-06 12:54:19,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2025-02-06 12:54:19,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2025-02-06 12:54:19,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 27 remaining) [2025-02-06 12:54:19,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:54:19,535 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:19,538 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:54:19,538 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:54:19,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:54:19 BasicIcfg [2025-02-06 12:54:19,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:54:19,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:54:19,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:54:19,545 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:54:19,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:54:11" (3/4) ... [2025-02-06 12:54:19,546 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 12:54:19,548 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure monitor_thread [2025-02-06 12:54:19,549 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure counter_thread [2025-02-06 12:54:19,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2025-02-06 12:54:19,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-06 12:54:19,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-06 12:54:19,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 12:54:19,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 12:54:19,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 12:54:19,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:54:19,613 INFO L158 Benchmark]: Toolchain (without parser) took 9732.69ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 101.5MB in the beginning and 314.7MB in the end (delta: -213.2MB). Peak memory consumption was 217.6MB. Max. memory is 16.1GB. [2025-02-06 12:54:19,614 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:54:19,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.69ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 42.5MB in the end (delta: 59.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 12:54:19,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.71ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 39.9MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:54:19,615 INFO L158 Benchmark]: Boogie Preprocessor took 53.76ms. Allocated memory is still 142.6MB. Free memory was 39.9MB in the beginning and 36.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:54:19,615 INFO L158 Benchmark]: IcfgBuilder took 765.24ms. Allocated memory is still 142.6MB. Free memory was 35.8MB in the beginning and 63.7MB in the end (delta: -27.9MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2025-02-06 12:54:19,615 INFO L158 Benchmark]: TraceAbstraction took 8052.48ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 63.0MB in the beginning and 323.1MB in the end (delta: -260.2MB). Peak memory consumption was 169.4MB. Max. memory is 16.1GB. [2025-02-06 12:54:19,615 INFO L158 Benchmark]: Witness Printer took 67.20ms. Allocated memory is still 570.4MB. Free memory was 323.1MB in the beginning and 314.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:54:19,616 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.19ms. Allocated memory is still 226.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 735.69ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 42.5MB in the end (delta: 59.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.71ms. Allocated memory is still 142.6MB. Free memory was 42.5MB in the beginning and 39.9MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.76ms. Allocated memory is still 142.6MB. Free memory was 39.9MB in the beginning and 36.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 765.24ms. Allocated memory is still 142.6MB. Free memory was 35.8MB in the beginning and 63.7MB in the end (delta: -27.9MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8052.48ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 63.0MB in the beginning and 323.1MB in the end (delta: -260.2MB). Peak memory consumption was 169.4MB. Max. memory is 16.1GB. * Witness Printer took 67.20ms. Allocated memory is still 570.4MB. Free memory was 323.1MB in the beginning and 314.7MB in the end (delta: 8.4MB). 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.9s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1073 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 715 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2104 IncrementalHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 64 mSDtfsCounter, 2104 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=362occurred 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 245 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 469 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-02-06 12:54:19,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE