./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-798a7b3-m [2025-03-04 10:00:17,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:00:18,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:00:18,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:00:18,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:00:18,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:00:18,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:00:18,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:00:18,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:00:18,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:00:18,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:00:18,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:00:18,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:00:18,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:00:18,033 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:00:18,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:00:18,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:00:18,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:00:18,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:18,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:00:18,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:00:18,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:00:18,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:00:18,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:00:18,035 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/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-03-04 10:00:18,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:00:18,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:00:18,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:00:18,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:00:18,288 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:00:18,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i [2025-03-04 10:00:19,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/405a077e8/5447fe5750b549129d1a8a06b7fefffd/FLAG114be1605 [2025-03-04 10:00:19,821 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:00:19,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_36-trylock_nr.i [2025-03-04 10:00:19,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/405a077e8/5447fe5750b549129d1a8a06b7fefffd/FLAG114be1605 [2025-03-04 10:00:20,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/405a077e8/5447fe5750b549129d1a8a06b7fefffd [2025-03-04 10:00:20,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:00:20,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:00:20,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:20,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:00:20,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:00:20,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c1754f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20, skipping insertion in model container [2025-03-04 10:00:20,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:00:20,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:20,628 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:00:20,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:20,763 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:00:20,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20 WrapperNode [2025-03-04 10:00:20,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:20,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:20,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:00:20,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:00:20,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,799 INFO L138 Inliner]: procedures = 525, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 105 [2025-03-04 10:00:20,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:20,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:00:20,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:00:20,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:00:20,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,824 INFO L175 MemorySlicer]: Split 13 memory accesses to 9 slices as follows [1, 5, 1, 1, 1, 1, 1, 1, 1]. 38 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [0, 5, 0, 0, 0, 0, 0, 0, 0]. The 8 writes are split as follows [1, 0, 1, 1, 1, 1, 1, 1, 1]. [2025-03-04 10:00:20,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:00:20,852 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:00:20,852 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:00:20,852 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:00:20,853 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (1/1) ... [2025-03-04 10:00:20,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:20,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:20,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:00:20,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:00:20,910 INFO L130 BoogieDeclarations]: Found specification of procedure counter_thread [2025-03-04 10:00:20,910 INFO L138 BoogieDeclarations]: Found implementation of procedure counter_thread [2025-03-04 10:00:20,910 INFO L130 BoogieDeclarations]: Found specification of procedure monitor_thread [2025-03-04 10:00:20,910 INFO L138 BoogieDeclarations]: Found implementation of procedure monitor_thread [2025-03-04 10:00:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:00:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:00:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:00:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:00:20,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:00:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-03-04 10:00:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:00:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:00:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:00:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:00:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:00:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 10:00:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 10:00:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 10:00:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 10:00:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 10:00:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:00:20,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:00:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:00:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:00:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 10:00:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 10:00:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 10:00:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 10:00:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 10:00:20,914 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:00:21,110 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:00:21,112 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:00:21,354 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:00:21,354 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:00:21,423 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:00:21,425 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:00:21,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:21 BoogieIcfgContainer [2025-03-04 10:00:21,426 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:00:21,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:00:21,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:00:21,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:00:21,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:00:20" (1/3) ... [2025-03-04 10:00:21,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea9b3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:21, skipping insertion in model container [2025-03-04 10:00:21,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:20" (2/3) ... [2025-03-04 10:00:21,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea9b3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:21, skipping insertion in model container [2025-03-04 10:00:21,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:21" (3/3) ... [2025-03-04 10:00:21,433 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_36-trylock_nr.i [2025-03-04 10:00:21,444 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:00:21,445 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-03-04 10:00:21,445 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:00:21,506 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:00:21,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 140 transitions, 294 flow [2025-03-04 10:00:21,571 INFO L124 PetriNetUnfolderBase]: 39/138 cut-off events. [2025-03-04 10:00:21,575 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:00:21,580 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-03-04 10:00:21,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 140 transitions, 294 flow [2025-03-04 10:00:21,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 137 transitions, 286 flow [2025-03-04 10:00:21,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:00:21,599 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;@26a2b076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:00:21,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-04 10:00:21,601 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:00:21,601 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 10:00:21,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:00:21,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:21,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:00:21,602 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-03-04 10:00:21,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash 509813, now seen corresponding path program 1 times [2025-03-04 10:00:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:21,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026931355] [2025-03-04 10:00:21,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:21,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:00:21,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:00:21,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:21,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:21,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026931355] [2025-03-04 10:00:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026931355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:21,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:21,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:00:21,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45429076] [2025-03-04 10:00:21,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:21,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:21,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:21,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:21,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:21,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 140 [2025-03-04 10:00:21,939 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-03-04 10:00:21,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:21,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 140 [2025-03-04 10:00:21,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:22,295 INFO L124 PetriNetUnfolderBase]: 993/2847 cut-off events. [2025-03-04 10:00:22,295 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-04 10:00:22,302 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-03-04 10:00:22,318 INFO L140 encePairwiseOnDemand]: 112/140 looper letters, 62 selfloop transitions, 9 changer transitions 5/135 dead transitions. [2025-03-04 10:00:22,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 135 transitions, 432 flow [2025-03-04 10:00:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2025-03-04 10:00:22,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7785714285714286 [2025-03-04 10:00:22,333 INFO L175 Difference]: Start difference. First operand has 105 places, 137 transitions, 286 flow. Second operand 3 states and 327 transitions. [2025-03-04 10:00:22,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 135 transitions, 432 flow [2025-03-04 10:00:22,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 420 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:00:22,343 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 253 flow [2025-03-04 10:00:22,344 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-03-04 10:00:22,348 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -10 predicate places. [2025-03-04 10:00:22,348 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 253 flow [2025-03-04 10:00:22,348 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-03-04 10:00:22,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:22,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:22,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:00:22,349 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-03-04 10:00:22,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:22,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1973456404, now seen corresponding path program 1 times [2025-03-04 10:00:22,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:22,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911000714] [2025-03-04 10:00:22,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:22,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:00:22,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:00:22,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:22,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:22,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:22,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911000714] [2025-03-04 10:00:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911000714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:22,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162628629] [2025-03-04 10:00:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:22,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:22,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:22,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:22,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-03-04 10:00:22,550 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-03-04 10:00:22,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:22,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-03-04 10:00:22,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:22,857 INFO L124 PetriNetUnfolderBase]: 1090/2646 cut-off events. [2025-03-04 10:00:22,857 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-03-04 10:00:22,863 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-03-04 10:00:22,874 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 57 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-03-04 10:00:22,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 115 transitions, 397 flow [2025-03-04 10:00:22,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-03-04 10:00:22,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-04 10:00:22,877 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 253 flow. Second operand 3 states and 266 transitions. [2025-03-04 10:00:22,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 115 transitions, 397 flow [2025-03-04 10:00:22,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 115 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:22,881 INFO L231 Difference]: Finished difference. Result has 92 places, 103 transitions, 246 flow [2025-03-04 10:00:22,881 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-03-04 10:00:22,882 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -13 predicate places. [2025-03-04 10:00:22,882 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 103 transitions, 246 flow [2025-03-04 10:00:22,882 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-03-04 10:00:22,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:22,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:22,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:00:22,883 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-03-04 10:00:22,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1973456405, now seen corresponding path program 1 times [2025-03-04 10:00:22,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:22,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250116780] [2025-03-04 10:00:22,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:22,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:00:22,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:00:22,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:22,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:22,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250116780] [2025-03-04 10:00:22,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250116780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:22,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:22,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:22,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998273397] [2025-03-04 10:00:22,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:22,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:22,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:22,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:22,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:23,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 10:00:23,030 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-03-04 10:00:23,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:23,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 10:00:23,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:23,267 INFO L124 PetriNetUnfolderBase]: 1074/2623 cut-off events. [2025-03-04 10:00:23,267 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2025-03-04 10:00:23,271 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-03-04 10:00:23,281 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 53 selfloop transitions, 4 changer transitions 2/115 dead transitions. [2025-03-04 10:00:23,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 392 flow [2025-03-04 10:00:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2025-03-04 10:00:23,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6404761904761904 [2025-03-04 10:00:23,286 INFO L175 Difference]: Start difference. First operand has 92 places, 103 transitions, 246 flow. Second operand 3 states and 269 transitions. [2025-03-04 10:00:23,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 392 flow [2025-03-04 10:00:23,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 115 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:23,290 INFO L231 Difference]: Finished difference. Result has 94 places, 105 transitions, 270 flow [2025-03-04 10:00:23,290 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-03-04 10:00:23,291 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -11 predicate places. [2025-03-04 10:00:23,291 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 105 transitions, 270 flow [2025-03-04 10:00:23,292 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-03-04 10:00:23,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:23,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:23,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:00:23,292 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-03-04 10:00:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2139586131, now seen corresponding path program 1 times [2025-03-04 10:00:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89374833] [2025-03-04 10:00:23,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:23,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:00:23,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:00:23,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:23,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89374833] [2025-03-04 10:00:23,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89374833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:23,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:23,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818011375] [2025-03-04 10:00:23,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:23,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:23,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:23,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:23,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-03-04 10:00:23,405 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-03-04 10:00:23,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:23,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-03-04 10:00:23,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:23,665 INFO L124 PetriNetUnfolderBase]: 1729/3882 cut-off events. [2025-03-04 10:00:23,665 INFO L125 PetriNetUnfolderBase]: For 534/555 co-relation queries the response was YES. [2025-03-04 10:00:23,670 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-03-04 10:00:23,684 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 72 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2025-03-04 10:00:23,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 129 transitions, 478 flow [2025-03-04 10:00:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-03-04 10:00:23,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2025-03-04 10:00:23,686 INFO L175 Difference]: Start difference. First operand has 94 places, 105 transitions, 270 flow. Second operand 3 states and 279 transitions. [2025-03-04 10:00:23,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 129 transitions, 478 flow [2025-03-04 10:00:23,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 129 transitions, 470 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:23,693 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 264 flow [2025-03-04 10:00:23,693 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-03-04 10:00:23,694 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -11 predicate places. [2025-03-04 10:00:23,694 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 264 flow [2025-03-04 10:00:23,694 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-03-04 10:00:23,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:23,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:23,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:00:23,694 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-03-04 10:00:23,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2139586130, now seen corresponding path program 1 times [2025-03-04 10:00:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075164893] [2025-03-04 10:00:23,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:23,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:23,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:00:23,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:00:23,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:23,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:23,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:23,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075164893] [2025-03-04 10:00:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075164893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:23,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:23,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647944153] [2025-03-04 10:00:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:23,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:23,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:23,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:23,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:23,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-03-04 10:00:23,830 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-03-04 10:00:23,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:23,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-03-04 10:00:23,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:24,093 INFO L124 PetriNetUnfolderBase]: 1857/4078 cut-off events. [2025-03-04 10:00:24,093 INFO L125 PetriNetUnfolderBase]: For 832/855 co-relation queries the response was YES. [2025-03-04 10:00:24,099 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-03-04 10:00:24,113 INFO L140 encePairwiseOnDemand]: 133/140 looper letters, 69 selfloop transitions, 7 changer transitions 0/130 dead transitions. [2025-03-04 10:00:24,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 130 transitions, 480 flow [2025-03-04 10:00:24,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-03-04 10:00:24,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.669047619047619 [2025-03-04 10:00:24,114 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 264 flow. Second operand 3 states and 281 transitions. [2025-03-04 10:00:24,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 130 transitions, 480 flow [2025-03-04 10:00:24,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 130 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:24,119 INFO L231 Difference]: Finished difference. Result has 97 places, 109 transitions, 324 flow [2025-03-04 10:00:24,119 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-03-04 10:00:24,120 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -8 predicate places. [2025-03-04 10:00:24,120 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 109 transitions, 324 flow [2025-03-04 10:00:24,120 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-03-04 10:00:24,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:24,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:24,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:00:24,120 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-03-04 10:00:24,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2071925359, now seen corresponding path program 1 times [2025-03-04 10:00:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:24,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621752964] [2025-03-04 10:00:24,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:24,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:00:24,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:00:24,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:24,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:24,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:24,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621752964] [2025-03-04 10:00:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621752964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:24,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:24,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512317448] [2025-03-04 10:00:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:24,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:00:24,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:24,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:00:24,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:00:24,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-03-04 10:00:24,184 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-03-04 10:00:24,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:24,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-03-04 10:00:24,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:24,508 INFO L124 PetriNetUnfolderBase]: 1538/3515 cut-off events. [2025-03-04 10:00:24,508 INFO L125 PetriNetUnfolderBase]: For 2188/2188 co-relation queries the response was YES. [2025-03-04 10:00:24,512 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-03-04 10:00:24,527 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 123 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2025-03-04 10:00:24,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 178 transitions, 826 flow [2025-03-04 10:00:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:00:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:00:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2025-03-04 10:00:24,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6542857142857142 [2025-03-04 10:00:24,529 INFO L175 Difference]: Start difference. First operand has 97 places, 109 transitions, 324 flow. Second operand 5 states and 458 transitions. [2025-03-04 10:00:24,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 178 transitions, 826 flow [2025-03-04 10:00:24,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 178 transitions, 770 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:24,537 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 282 flow [2025-03-04 10:00:24,538 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-03-04 10:00:24,538 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -12 predicate places. [2025-03-04 10:00:24,539 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 282 flow [2025-03-04 10:00:24,539 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-03-04 10:00:24,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:24,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:24,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:00:24,540 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-03-04 10:00:24,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1607068461, now seen corresponding path program 1 times [2025-03-04 10:00:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:24,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133088716] [2025-03-04 10:00:24,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:24,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:00:24,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:00:24,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:24,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:24,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:24,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133088716] [2025-03-04 10:00:24,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133088716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:24,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:24,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119813884] [2025-03-04 10:00:24,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:24,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:24,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:24,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:24,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:24,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2025-03-04 10:00:24,628 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-03-04 10:00:24,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:24,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2025-03-04 10:00:24,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:24,959 INFO L124 PetriNetUnfolderBase]: 1687/3915 cut-off events. [2025-03-04 10:00:24,959 INFO L125 PetriNetUnfolderBase]: For 1229/1229 co-relation queries the response was YES. [2025-03-04 10:00:24,965 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-03-04 10:00:24,978 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 66 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2025-03-04 10:00:24,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 118 transitions, 480 flow [2025-03-04 10:00:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2025-03-04 10:00:24,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-03-04 10:00:24,982 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 282 flow. Second operand 3 states and 268 transitions. [2025-03-04 10:00:24,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 118 transitions, 480 flow [2025-03-04 10:00:24,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 118 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:24,987 INFO L231 Difference]: Finished difference. Result has 93 places, 100 transitions, 282 flow [2025-03-04 10:00:24,988 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-03-04 10:00:24,988 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -12 predicate places. [2025-03-04 10:00:24,988 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 100 transitions, 282 flow [2025-03-04 10:00:24,989 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-03-04 10:00:24,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:24,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:24,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:00:24,989 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-03-04 10:00:24,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1607068462, now seen corresponding path program 1 times [2025-03-04 10:00:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:24,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036555200] [2025-03-04 10:00:24,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:25,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:00:25,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:00:25,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:25,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:25,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036555200] [2025-03-04 10:00:25,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036555200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:25,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:25,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:00:25,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721747569] [2025-03-04 10:00:25,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:25,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:25,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:25,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:25,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:25,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 10:00:25,120 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-03-04 10:00:25,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:25,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 10:00:25,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:25,374 INFO L124 PetriNetUnfolderBase]: 1552/3713 cut-off events. [2025-03-04 10:00:25,374 INFO L125 PetriNetUnfolderBase]: For 1229/1229 co-relation queries the response was YES. [2025-03-04 10:00:25,379 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-03-04 10:00:25,388 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 62 selfloop transitions, 7 changer transitions 0/118 dead transitions. [2025-03-04 10:00:25,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 118 transitions, 478 flow [2025-03-04 10:00:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2025-03-04 10:00:25,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6452380952380953 [2025-03-04 10:00:25,390 INFO L175 Difference]: Start difference. First operand has 93 places, 100 transitions, 282 flow. Second operand 3 states and 271 transitions. [2025-03-04 10:00:25,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 118 transitions, 478 flow [2025-03-04 10:00:25,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 118 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:25,393 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 333 flow [2025-03-04 10:00:25,393 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-03-04 10:00:25,393 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -10 predicate places. [2025-03-04 10:00:25,394 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 333 flow [2025-03-04 10:00:25,394 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-03-04 10:00:25,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:25,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:25,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:00:25,394 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-03-04 10:00:25,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1811177415, now seen corresponding path program 1 times [2025-03-04 10:00:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:25,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847434265] [2025-03-04 10:00:25,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:25,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:25,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:00:25,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:00:25,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:25,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:25,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847434265] [2025-03-04 10:00:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847434265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:25,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:25,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:25,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842296404] [2025-03-04 10:00:25,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:25,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:25,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:25,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:25,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:25,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 10:00:25,436 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-03-04 10:00:25,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:25,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 10:00:25,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:25,659 INFO L124 PetriNetUnfolderBase]: 1557/3729 cut-off events. [2025-03-04 10:00:25,660 INFO L125 PetriNetUnfolderBase]: For 1677/1677 co-relation queries the response was YES. [2025-03-04 10:00:25,664 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-03-04 10:00:25,672 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 77 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2025-03-04 10:00:25,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 128 transitions, 581 flow [2025-03-04 10:00:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2025-03-04 10:00:25,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2025-03-04 10:00:25,674 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 333 flow. Second operand 3 states and 276 transitions. [2025-03-04 10:00:25,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 128 transitions, 581 flow [2025-03-04 10:00:25,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 128 transitions, 561 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:25,680 INFO L231 Difference]: Finished difference. Result has 97 places, 105 transitions, 330 flow [2025-03-04 10:00:25,680 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-03-04 10:00:25,681 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -8 predicate places. [2025-03-04 10:00:25,681 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 105 transitions, 330 flow [2025-03-04 10:00:25,681 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-03-04 10:00:25,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:25,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:25,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:00:25,682 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-03-04 10:00:25,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:25,682 INFO L85 PathProgramCache]: Analyzing trace with hash 937806644, now seen corresponding path program 1 times [2025-03-04 10:00:25,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:25,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10574732] [2025-03-04 10:00:25,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:25,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:25,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:00:25,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:00:25,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:25,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10574732] [2025-03-04 10:00:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10574732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40371876] [2025-03-04 10:00:25,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:25,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:25,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:25,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:25,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:00:25,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:00:25,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:00:25,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:25,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:25,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:00:25,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:25,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:25,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40371876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:25,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:25,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 10:00:25,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442591521] [2025-03-04 10:00:25,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:25,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:25,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:25,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:25,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:25,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2025-03-04 10:00:25,878 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-03-04 10:00:25,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:25,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2025-03-04 10:00:25,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:26,180 INFO L124 PetriNetUnfolderBase]: 1747/4021 cut-off events. [2025-03-04 10:00:26,181 INFO L125 PetriNetUnfolderBase]: For 1727/1727 co-relation queries the response was YES. [2025-03-04 10:00:26,187 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-03-04 10:00:26,197 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 146 selfloop transitions, 5 changer transitions 0/200 dead transitions. [2025-03-04 10:00:26,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 200 transitions, 976 flow [2025-03-04 10:00:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:00:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:00:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2025-03-04 10:00:26,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6595238095238095 [2025-03-04 10:00:26,199 INFO L175 Difference]: Start difference. First operand has 97 places, 105 transitions, 330 flow. Second operand 6 states and 554 transitions. [2025-03-04 10:00:26,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 200 transitions, 976 flow [2025-03-04 10:00:26,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 200 transitions, 972 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:26,207 INFO L231 Difference]: Finished difference. Result has 104 places, 108 transitions, 362 flow [2025-03-04 10:00:26,207 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-03-04 10:00:26,208 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -1 predicate places. [2025-03-04 10:00:26,208 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 108 transitions, 362 flow [2025-03-04 10:00:26,209 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-03-04 10:00:26,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:26,209 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-03-04 10:00:26,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:00:26,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:00:26,413 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-03-04 10:00:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2097621817, now seen corresponding path program 1 times [2025-03-04 10:00:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:26,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645800313] [2025-03-04 10:00:26,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:26,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:26,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:00:26,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:00:26,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:26,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:26,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:26,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645800313] [2025-03-04 10:00:26,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645800313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:26,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:26,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:26,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551922805] [2025-03-04 10:00:26,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:26,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:26,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:26,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:26,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:26,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 140 [2025-03-04 10:00:26,465 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-03-04 10:00:26,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:26,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 140 [2025-03-04 10:00:26,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:26,740 INFO L124 PetriNetUnfolderBase]: 2813/6147 cut-off events. [2025-03-04 10:00:26,740 INFO L125 PetriNetUnfolderBase]: For 2757/2837 co-relation queries the response was YES. [2025-03-04 10:00:26,750 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-03-04 10:00:26,766 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 89 selfloop transitions, 3 changer transitions 2/128 dead transitions. [2025-03-04 10:00:26,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 128 transitions, 642 flow [2025-03-04 10:00:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2025-03-04 10:00:26,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 10:00:26,767 INFO L175 Difference]: Start difference. First operand has 104 places, 108 transitions, 362 flow. Second operand 3 states and 260 transitions. [2025-03-04 10:00:26,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 128 transitions, 642 flow [2025-03-04 10:00:26,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 128 transitions, 615 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:26,777 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 311 flow [2025-03-04 10:00:26,777 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-03-04 10:00:26,777 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -11 predicate places. [2025-03-04 10:00:26,777 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 311 flow [2025-03-04 10:00:26,778 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-03-04 10:00:26,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:26,778 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-03-04 10:00:26,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:00:26,778 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-03-04 10:00:26,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:26,778 INFO L85 PathProgramCache]: Analyzing trace with hash 407305554, now seen corresponding path program 1 times [2025-03-04 10:00:26,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:26,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299381067] [2025-03-04 10:00:26,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:26,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:26,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:00:26,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:00:26,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:26,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:26,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:26,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299381067] [2025-03-04 10:00:26,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299381067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:26,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:26,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:26,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253622578] [2025-03-04 10:00:26,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:26,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:00:26,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:26,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:00:26,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:00:27,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-03-04 10:00:27,009 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-03-04 10:00:27,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:27,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-03-04 10:00:27,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:27,292 INFO L124 PetriNetUnfolderBase]: 2620/5299 cut-off events. [2025-03-04 10:00:27,292 INFO L125 PetriNetUnfolderBase]: For 2283/2422 co-relation queries the response was YES. [2025-03-04 10:00:27,301 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-03-04 10:00:27,315 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 83 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-03-04 10:00:27,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 122 transitions, 581 flow [2025-03-04 10:00:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2025-03-04 10:00:27,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6452380952380953 [2025-03-04 10:00:27,317 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 311 flow. Second operand 3 states and 271 transitions. [2025-03-04 10:00:27,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 122 transitions, 581 flow [2025-03-04 10:00:27,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 122 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:27,323 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 307 flow [2025-03-04 10:00:27,323 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-03-04 10:00:27,325 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -14 predicate places. [2025-03-04 10:00:27,325 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 307 flow [2025-03-04 10:00:27,325 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-03-04 10:00:27,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:27,325 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-03-04 10:00:27,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:00:27,326 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-03-04 10:00:27,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1231886096, now seen corresponding path program 1 times [2025-03-04 10:00:27,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:27,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912516757] [2025-03-04 10:00:27,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:27,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:00:27,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:00:27,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:27,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:27,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:27,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912516757] [2025-03-04 10:00:27,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912516757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:27,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:27,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:27,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113203589] [2025-03-04 10:00:27,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:27,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:00:27,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:27,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:00:27,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:00:27,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-03-04 10:00:27,498 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-03-04 10:00:27,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:27,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-03-04 10:00:27,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:27,801 INFO L124 PetriNetUnfolderBase]: 1838/4042 cut-off events. [2025-03-04 10:00:27,802 INFO L125 PetriNetUnfolderBase]: For 2829/2886 co-relation queries the response was YES. [2025-03-04 10:00:27,812 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-03-04 10:00:27,825 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 68 selfloop transitions, 3 changer transitions 3/110 dead transitions. [2025-03-04 10:00:27,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 110 transitions, 522 flow [2025-03-04 10:00:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2025-03-04 10:00:27,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2025-03-04 10:00:27,827 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 307 flow. Second operand 3 states and 261 transitions. [2025-03-04 10:00:27,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 110 transitions, 522 flow [2025-03-04 10:00:27,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 110 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:27,835 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 306 flow [2025-03-04 10:00:27,835 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-03-04 10:00:27,836 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -14 predicate places. [2025-03-04 10:00:27,836 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 306 flow [2025-03-04 10:00:27,837 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-03-04 10:00:27,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:27,837 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-03-04 10:00:27,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:00:27,837 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-03-04 10:00:27,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash 432913428, now seen corresponding path program 1 times [2025-03-04 10:00:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380560996] [2025-03-04 10:00:27,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:27,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:00:27,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:00:27,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:27,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:27,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:27,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380560996] [2025-03-04 10:00:27,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380560996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:27,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:27,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589307501] [2025-03-04 10:00:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:27,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:00:27,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:27,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:00:27,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:00:27,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-03-04 10:00:27,906 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-03-04 10:00:27,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:27,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-03-04 10:00:27,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:28,203 INFO L124 PetriNetUnfolderBase]: 2301/4332 cut-off events. [2025-03-04 10:00:28,204 INFO L125 PetriNetUnfolderBase]: For 2514/2592 co-relation queries the response was YES. [2025-03-04 10:00:28,209 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-03-04 10:00:28,217 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 88 selfloop transitions, 4 changer transitions 11/130 dead transitions. [2025-03-04 10:00:28,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 130 transitions, 648 flow [2025-03-04 10:00:28,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:00:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:00:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 351 transitions. [2025-03-04 10:00:28,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6267857142857143 [2025-03-04 10:00:28,219 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 306 flow. Second operand 4 states and 351 transitions. [2025-03-04 10:00:28,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 130 transitions, 648 flow [2025-03-04 10:00:28,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 130 transitions, 645 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:28,224 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 272 flow [2025-03-04 10:00:28,224 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-03-04 10:00:28,224 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -17 predicate places. [2025-03-04 10:00:28,224 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 272 flow [2025-03-04 10:00:28,224 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-03-04 10:00:28,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:28,224 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:28,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:00:28,225 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-03-04 10:00:28,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:28,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1834331385, now seen corresponding path program 2 times [2025-03-04 10:00:28,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:28,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890547421] [2025-03-04 10:00:28,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:28,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:28,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:00:28,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-03-04 10:00:28,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:00:28,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:00:28,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:28,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890547421] [2025-03-04 10:00:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890547421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:28,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:28,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:28,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569404020] [2025-03-04 10:00:28,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:28,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:00:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:28,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:00:28,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:00:28,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 140 [2025-03-04 10:00:28,281 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-03-04 10:00:28,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:28,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 140 [2025-03-04 10:00:28,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:28,502 INFO L124 PetriNetUnfolderBase]: 1639/2980 cut-off events. [2025-03-04 10:00:28,502 INFO L125 PetriNetUnfolderBase]: For 1875/1875 co-relation queries the response was YES. [2025-03-04 10:00:28,507 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-03-04 10:00:28,509 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 0 selfloop transitions, 0 changer transitions 105/105 dead transitions. [2025-03-04 10:00:28,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 541 flow [2025-03-04 10:00:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:00:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:00:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2025-03-04 10:00:28,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-04 10:00:28,510 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 272 flow. Second operand 4 states and 352 transitions. [2025-03-04 10:00:28,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 541 flow [2025-03-04 10:00:28,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 509 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:00:28,517 INFO L231 Difference]: Finished difference. Result has 74 places, 0 transitions, 0 flow [2025-03-04 10:00:28,517 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-03-04 10:00:28,517 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -31 predicate places. [2025-03-04 10:00:28,517 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 0 transitions, 0 flow [2025-03-04 10:00:28,518 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-03-04 10:00:28,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 27 remaining) [2025-03-04 10:00:28,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (18 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 27 remaining) [2025-03-04 10:00:28,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location monitor_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2025-03-04 10:00:28,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location counter_threadErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 27 remaining) [2025-03-04 10:00:28,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:00:28,522 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:28,525 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:00:28,525 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:00:28,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:00:28 BasicIcfg [2025-03-04 10:00:28,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:00:28,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:00:28,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:00:28,530 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:00:28,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:21" (3/4) ... [2025-03-04 10:00:28,531 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:00:28,533 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure monitor_thread [2025-03-04 10:00:28,533 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure counter_thread [2025-03-04 10:00:28,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2025-03-04 10:00:28,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-04 10:00:28,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 10:00:28,537 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:00:28,599 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:00:28,599 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:00:28,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:00:28,600 INFO L158 Benchmark]: Toolchain (without parser) took 8569.10ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 108.2MB in the beginning and 260.2MB in the end (delta: -152.0MB). Peak memory consumption was 190.7MB. Max. memory is 16.1GB. [2025-03-04 10:00:28,601 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:00:28,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.53ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 50.7MB in the end (delta: 57.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 10:00:28,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.14ms. Allocated memory is still 142.6MB. Free memory was 50.7MB in the beginning and 47.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:00:28,602 INFO L158 Benchmark]: Boogie Preprocessor took 51.22ms. Allocated memory is still 142.6MB. Free memory was 47.8MB in the beginning and 44.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:00:28,602 INFO L158 Benchmark]: IcfgBuilder took 574.04ms. Allocated memory is still 142.6MB. Free memory was 44.2MB in the beginning and 70.7MB in the end (delta: -26.5MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2025-03-04 10:00:28,602 INFO L158 Benchmark]: TraceAbstraction took 7101.79ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 69.9MB in the beginning and 268.6MB in the end (delta: -198.7MB). Peak memory consumption was 141.5MB. Max. memory is 16.1GB. [2025-03-04 10:00:28,602 INFO L158 Benchmark]: Witness Printer took 69.88ms. Allocated memory is still 486.5MB. Free memory was 268.6MB in the beginning and 260.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:00:28,603 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.26ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.53ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 50.7MB in the end (delta: 57.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.14ms. Allocated memory is still 142.6MB. Free memory was 50.7MB in the beginning and 47.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.22ms. Allocated memory is still 142.6MB. Free memory was 47.8MB in the beginning and 44.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 574.04ms. Allocated memory is still 142.6MB. Free memory was 44.2MB in the beginning and 70.7MB in the end (delta: -26.5MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7101.79ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 69.9MB in the beginning and 268.6MB in the end (delta: -198.7MB). Peak memory consumption was 141.5MB. Max. memory is 16.1GB. * Witness Printer took 69.88ms. Allocated memory is still 486.5MB. Free memory was 268.6MB in the beginning and 260.2MB 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.0s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1073 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 715 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 1.3s 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s 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-03-04 10:00:28,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE