./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/pthread/queue.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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:58:09,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:58:09,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 13:58:09,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:58:09,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:58:09,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:58:09,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:58:09,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:58:09,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:58:09,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:58:09,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:58:09,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:58:09,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:58:09,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:58:09,834 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:58:09,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 13:58:09,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:58:09,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:58:09,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:58:09,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:58:09,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:58:09,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:58:09,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:58:09,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:58:09,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:58:09,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:58:09,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:58:09,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:58:09,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:58:09,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:58:09,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:58:09,837 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2025-03-17 13:58:10,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:58:10,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:58:10,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:58:10,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:58:10,087 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:58:10,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-03-17 13:58:11,226 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c5f640f/d57cfe3997c747718170d89845c6b5da/FLAGafcb4643d [2025-03-17 13:58:11,518 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:58:11,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-03-17 13:58:11,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c5f640f/d57cfe3997c747718170d89845c6b5da/FLAGafcb4643d [2025-03-17 13:58:11,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c5f640f/d57cfe3997c747718170d89845c6b5da [2025-03-17 13:58:11,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:58:11,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:58:11,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:58:11,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:58:11,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:58:11,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:58:11" (1/1) ... [2025-03-17 13:58:11,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e8b1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:11, skipping insertion in model container [2025-03-17 13:58:11,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:58:11" (1/1) ... [2025-03-17 13:58:11,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:58:12,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:58:12,167 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:58:12,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:58:12,263 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:58:12,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12 WrapperNode [2025-03-17 13:58:12,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:58:12,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:58:12,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:58:12,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:58:12,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,300 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 289 [2025-03-17 13:58:12,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:58:12,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:58:12,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:58:12,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:58:12,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,335 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14]. [2025-03-17 13:58:12,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:58:12,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:58:12,350 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:58:12,350 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:58:12,351 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (1/1) ... [2025-03-17 13:58:12,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:58:12,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:58:12,377 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-17 13:58:12,379 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-17 13:58:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 13:58:12,394 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 13:58:12,394 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 13:58:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:58:12,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:58:12,395 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 13:58:12,512 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:58:12,513 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:58:12,938 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 13:58:12,938 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:58:13,082 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:58:13,082 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 13:58:13,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:58:13 BoogieIcfgContainer [2025-03-17 13:58:13,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:58:13,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:58:13,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:58:13,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:58:13,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:58:11" (1/3) ... [2025-03-17 13:58:13,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2510ed0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:58:13, skipping insertion in model container [2025-03-17 13:58:13,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:58:12" (2/3) ... [2025-03-17 13:58:13,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2510ed0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:58:13, skipping insertion in model container [2025-03-17 13:58:13,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:58:13" (3/3) ... [2025-03-17 13:58:13,091 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-17 13:58:13,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:58:13,104 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 159 locations, 1 initial locations, 2 loop locations, and 72 error locations. [2025-03-17 13:58:13,104 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 13:58:13,201 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 13:58:13,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 358 flow [2025-03-17 13:58:13,278 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events. [2025-03-17 13:58:13,282 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 13:58:13,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 14/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 521 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place. [2025-03-17 13:58:13,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 358 flow [2025-03-17 13:58:13,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 169 transitions, 350 flow [2025-03-17 13:58:13,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:58:13,307 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;@7bb87a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:58:13,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 134 error locations. [2025-03-17 13:58:13,311 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 13:58:13,312 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-17 13:58:13,312 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 13:58:13,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:13,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 13:58:13,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:13,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:13,316 INFO L85 PathProgramCache]: Analyzing trace with hash 26513, now seen corresponding path program 1 times [2025-03-17 13:58:13,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:13,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603913254] [2025-03-17 13:58:13,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:13,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:13,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:58:13,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:58:13,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:13,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:13,555 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-17 13:58:13,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:13,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603913254] [2025-03-17 13:58:13,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603913254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:13,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:13,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:58:13,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482206451] [2025-03-17 13:58:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:58:13,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:13,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:58:13,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:58:13,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-17 13:58:13,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-17 13:58:13,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:13,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-17 13:58:13,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:14,186 INFO L124 PetriNetUnfolderBase]: 1743/4598 cut-off events. [2025-03-17 13:58:14,186 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-17 13:58:14,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7420 conditions, 4598 events. 1743/4598 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 36322 event pairs, 1390 based on Foata normal form. 184/3554 useless extension candidates. Maximal degree in co-relation 7305. Up to 2741 conditions per place. [2025-03-17 13:58:14,220 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 57 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-03-17 13:58:14,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 436 flow [2025-03-17 13:58:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:58:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 13:58:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-03-17 13:58:14,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473 [2025-03-17 13:58:14,235 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 350 flow. Second operand 3 states and 364 transitions. [2025-03-17 13:58:14,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 436 flow [2025-03-17 13:58:14,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 153 transitions, 428 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 13:58:14,245 INFO L231 Difference]: Finished difference. Result has 150 places, 153 transitions, 314 flow [2025-03-17 13:58:14,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=150, PETRI_TRANSITIONS=153} [2025-03-17 13:58:14,249 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -12 predicate places. [2025-03-17 13:58:14,251 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 153 transitions, 314 flow [2025-03-17 13:58:14,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-17 13:58:14,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:14,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 13:58:14,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:58:14,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:14,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 26514, now seen corresponding path program 1 times [2025-03-17 13:58:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978635948] [2025-03-17 13:58:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:14,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:58:14,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:58:14,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:14,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:14,396 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-17 13:58:14,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:14,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978635948] [2025-03-17 13:58:14,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978635948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:14,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:14,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:58:14,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995014677] [2025-03-17 13:58:14,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:14,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:58:14,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:14,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:58:14,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:58:14,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-17 13:58:14,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 153 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-17 13:58:14,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:14,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-17 13:58:14,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:14,858 INFO L124 PetriNetUnfolderBase]: 1743/4595 cut-off events. [2025-03-17 13:58:14,858 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-17 13:58:14,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7371 conditions, 4595 events. 1743/4595 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 36350 event pairs, 1390 based on Foata normal form. 3/3372 useless extension candidates. Maximal degree in co-relation 7360. Up to 2741 conditions per place. [2025-03-17 13:58:14,881 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 57 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-03-17 13:58:14,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 150 transitions, 426 flow [2025-03-17 13:58:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:58:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 13:58:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-03-17 13:58:14,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957364341085271 [2025-03-17 13:58:14,883 INFO L175 Difference]: Start difference. First operand has 150 places, 153 transitions, 314 flow. Second operand 3 states and 359 transitions. [2025-03-17 13:58:14,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 150 transitions, 426 flow [2025-03-17 13:58:14,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 150 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 13:58:14,885 INFO L231 Difference]: Finished difference. Result has 147 places, 150 transitions, 308 flow [2025-03-17 13:58:14,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=150} [2025-03-17 13:58:14,886 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -15 predicate places. [2025-03-17 13:58:14,886 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 150 transitions, 308 flow [2025-03-17 13:58:14,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-17 13:58:14,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:14,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:58:14,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:58:14,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:14,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash 790528119, now seen corresponding path program 1 times [2025-03-17 13:58:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89308423] [2025-03-17 13:58:14,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:14,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:58:14,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:58:14,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:14,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:15,084 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-17 13:58:15,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:15,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89308423] [2025-03-17 13:58:15,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89308423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:15,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:15,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:58:15,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462956815] [2025-03-17 13:58:15,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:15,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:58:15,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:15,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:58:15,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:58:15,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-17 13:58:15,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 150 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 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-17 13:58:15,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:15,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-17 13:58:15,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:15,649 INFO L124 PetriNetUnfolderBase]: 1743/4593 cut-off events. [2025-03-17 13:58:15,649 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-17 13:58:15,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7370 conditions, 4593 events. 1743/4593 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36295 event pairs, 1390 based on Foata normal form. 1/3370 useless extension candidates. Maximal degree in co-relation 7358. Up to 2740 conditions per place. [2025-03-17 13:58:15,672 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 57 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2025-03-17 13:58:15,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 148 transitions, 424 flow [2025-03-17 13:58:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:58:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 13:58:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2025-03-17 13:58:15,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6656976744186046 [2025-03-17 13:58:15,673 INFO L175 Difference]: Start difference. First operand has 147 places, 150 transitions, 308 flow. Second operand 4 states and 458 transitions. [2025-03-17 13:58:15,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 148 transitions, 424 flow [2025-03-17 13:58:15,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 148 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 13:58:15,675 INFO L231 Difference]: Finished difference. Result has 146 places, 148 transitions, 306 flow [2025-03-17 13:58:15,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=146, PETRI_TRANSITIONS=148} [2025-03-17 13:58:15,679 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -16 predicate places. [2025-03-17 13:58:15,679 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 148 transitions, 306 flow [2025-03-17 13:58:15,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 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-17 13:58:15,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:15,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:58:15,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:58:15,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:15,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:15,680 INFO L85 PathProgramCache]: Analyzing trace with hash 790528118, now seen corresponding path program 1 times [2025-03-17 13:58:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:15,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818526929] [2025-03-17 13:58:15,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:15,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:58:15,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:58:15,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:15,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:15,739 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-17 13:58:15,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:15,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818526929] [2025-03-17 13:58:15,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818526929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:15,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:15,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:58:15,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834202227] [2025-03-17 13:58:15,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:15,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:58:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:15,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:58:15,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:58:15,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-17 13:58:15,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 148 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-17 13:58:15,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:15,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-17 13:58:15,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:16,140 INFO L124 PetriNetUnfolderBase]: 1743/4591 cut-off events. [2025-03-17 13:58:16,141 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-17 13:58:16,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7368 conditions, 4591 events. 1743/4591 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36287 event pairs, 1390 based on Foata normal form. 2/3370 useless extension candidates. Maximal degree in co-relation 7353. Up to 2740 conditions per place. [2025-03-17 13:58:16,158 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 56 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2025-03-17 13:58:16,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 420 flow [2025-03-17 13:58:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:58:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 13:58:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2025-03-17 13:58:16,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6700581395348837 [2025-03-17 13:58:16,161 INFO L175 Difference]: Start difference. First operand has 146 places, 148 transitions, 306 flow. Second operand 4 states and 461 transitions. [2025-03-17 13:58:16,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 420 flow [2025-03-17 13:58:16,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 146 transitions, 414 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 13:58:16,164 INFO L231 Difference]: Finished difference. Result has 144 places, 146 transitions, 302 flow [2025-03-17 13:58:16,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=144, PETRI_TRANSITIONS=146} [2025-03-17 13:58:16,164 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -18 predicate places. [2025-03-17 13:58:16,164 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 146 transitions, 302 flow [2025-03-17 13:58:16,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-17 13:58:16,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:16,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:16,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:58:16,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:16,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1403249674, now seen corresponding path program 1 times [2025-03-17 13:58:16,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:16,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781554681] [2025-03-17 13:58:16,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:16,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:16,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 13:58:16,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 13:58:16,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:16,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:16,256 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-17 13:58:16,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:16,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781554681] [2025-03-17 13:58:16,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781554681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:16,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:16,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:58:16,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408049275] [2025-03-17 13:58:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:16,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:58:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:16,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:58:16,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:58:16,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 172 [2025-03-17 13:58:16,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 146 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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-17 13:58:16,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:16,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 172 [2025-03-17 13:58:16,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:16,726 INFO L124 PetriNetUnfolderBase]: 1703/4145 cut-off events. [2025-03-17 13:58:16,726 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-17 13:58:16,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 4145 events. 1703/4145 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 30805 event pairs, 700 based on Foata normal form. 204/3592 useless extension candidates. Maximal degree in co-relation 6867. Up to 1414 conditions per place. [2025-03-17 13:58:16,741 INFO L140 encePairwiseOnDemand]: 151/172 looper letters, 73 selfloop transitions, 5 changer transitions 0/149 dead transitions. [2025-03-17 13:58:16,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 149 transitions, 465 flow [2025-03-17 13:58:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:58:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 13:58:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2025-03-17 13:58:16,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6366279069767442 [2025-03-17 13:58:16,743 INFO L175 Difference]: Start difference. First operand has 144 places, 146 transitions, 302 flow. Second operand 4 states and 438 transitions. [2025-03-17 13:58:16,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 149 transitions, 465 flow [2025-03-17 13:58:16,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 149 transitions, 459 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 13:58:16,745 INFO L231 Difference]: Finished difference. Result has 128 places, 130 transitions, 274 flow [2025-03-17 13:58:16,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=128, PETRI_TRANSITIONS=130} [2025-03-17 13:58:16,746 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -34 predicate places. [2025-03-17 13:58:16,746 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 130 transitions, 274 flow [2025-03-17 13:58:16,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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-17 13:58:16,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:16,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:16,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 13:58:16,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:16,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1403249675, now seen corresponding path program 1 times [2025-03-17 13:58:16,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:16,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19261569] [2025-03-17 13:58:16,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:16,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:16,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 13:58:16,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 13:58:16,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:16,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:17,013 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-17 13:58:17,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:17,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19261569] [2025-03-17 13:58:17,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19261569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:17,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:17,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:58:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476818575] [2025-03-17 13:58:17,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:17,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:58:17,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:17,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:58:17,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:58:17,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 172 [2025-03-17 13:58:17,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 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-17 13:58:17,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:17,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 172 [2025-03-17 13:58:17,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:17,545 INFO L124 PetriNetUnfolderBase]: 1703/3676 cut-off events. [2025-03-17 13:58:17,545 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-03-17 13:58:17,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6547 conditions, 3676 events. 1703/3676 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 24536 event pairs, 700 based on Foata normal form. 204/3324 useless extension candidates. Maximal degree in co-relation 2444. Up to 1413 conditions per place. [2025-03-17 13:58:17,557 INFO L140 encePairwiseOnDemand]: 152/172 looper letters, 72 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2025-03-17 13:58:17,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 135 transitions, 441 flow [2025-03-17 13:58:17,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:58:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 13:58:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2025-03-17 13:58:17,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6186046511627907 [2025-03-17 13:58:17,559 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 274 flow. Second operand 5 states and 532 transitions. [2025-03-17 13:58:17,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 135 transitions, 441 flow [2025-03-17 13:58:17,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 135 transitions, 431 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 13:58:17,562 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 248 flow [2025-03-17 13:58:17,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2025-03-17 13:58:17,562 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -47 predicate places. [2025-03-17 13:58:17,562 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 248 flow [2025-03-17 13:58:17,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 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-17 13:58:17,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:17,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:17,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:58:17,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:17,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash 551067729, now seen corresponding path program 1 times [2025-03-17 13:58:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:17,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119402827] [2025-03-17 13:58:17,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:17,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 13:58:17,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 13:58:17,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:17,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:17,893 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-17 13:58:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119402827] [2025-03-17 13:58:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119402827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:17,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:58:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784815283] [2025-03-17 13:58:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:17,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:58:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:17,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:58:17,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:58:18,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 172 [2025-03-17 13:58:18,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 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-17 13:58:18,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:18,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 172 [2025-03-17 13:58:18,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:18,743 INFO L124 PetriNetUnfolderBase]: 2502/5391 cut-off events. [2025-03-17 13:58:18,743 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-17 13:58:18,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9548 conditions, 5391 events. 2502/5391 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 38734 event pairs, 536 based on Foata normal form. 0/4393 useless extension candidates. Maximal degree in co-relation 3579. Up to 3436 conditions per place. [2025-03-17 13:58:18,755 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 124 selfloop transitions, 11 changer transitions 0/183 dead transitions. [2025-03-17 13:58:18,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 183 transitions, 657 flow [2025-03-17 13:58:18,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:58:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 13:58:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 669 transitions. [2025-03-17 13:58:18,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5556478405315615 [2025-03-17 13:58:18,757 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 248 flow. Second operand 7 states and 669 transitions. [2025-03-17 13:58:18,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 183 transitions, 657 flow [2025-03-17 13:58:18,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 643 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 13:58:18,762 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 310 flow [2025-03-17 13:58:18,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2025-03-17 13:58:18,763 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -41 predicate places. [2025-03-17 13:58:18,763 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 310 flow [2025-03-17 13:58:18,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 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-17 13:58:18,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:18,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:18,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:58:18,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:18,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 548548663, now seen corresponding path program 1 times [2025-03-17 13:58:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701162661] [2025-03-17 13:58:18,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:18,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:18,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 13:58:18,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 13:58:18,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:18,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:18,838 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-17 13:58:18,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701162661] [2025-03-17 13:58:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701162661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:58:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231750053] [2025-03-17 13:58:18,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:58:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:18,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:58:18,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:58:18,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 172 [2025-03-17 13:58:18,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 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-17 13:58:18,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:18,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 172 [2025-03-17 13:58:18,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:19,255 INFO L124 PetriNetUnfolderBase]: 2076/4609 cut-off events. [2025-03-17 13:58:19,255 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-03-17 13:58:19,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8275 conditions, 4609 events. 2076/4609 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 32979 event pairs, 893 based on Foata normal form. 375/4282 useless extension candidates. Maximal degree in co-relation 8007. Up to 1827 conditions per place. [2025-03-17 13:58:19,270 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 103 selfloop transitions, 3 changer transitions 0/157 dead transitions. [2025-03-17 13:58:19,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 157 transitions, 605 flow [2025-03-17 13:58:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:58:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 13:58:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2025-03-17 13:58:19,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6947674418604651 [2025-03-17 13:58:19,271 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 310 flow. Second operand 4 states and 478 transitions. [2025-03-17 13:58:19,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 157 transitions, 605 flow [2025-03-17 13:58:19,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 157 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 13:58:19,274 INFO L231 Difference]: Finished difference. Result has 115 places, 118 transitions, 298 flow [2025-03-17 13:58:19,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=115, PETRI_TRANSITIONS=118} [2025-03-17 13:58:19,275 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -47 predicate places. [2025-03-17 13:58:19,275 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 298 flow [2025-03-17 13:58:19,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 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-17 13:58:19,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:19,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:19,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 13:58:19,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:19,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:19,276 INFO L85 PathProgramCache]: Analyzing trace with hash 548548664, now seen corresponding path program 1 times [2025-03-17 13:58:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105819912] [2025-03-17 13:58:19,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:19,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 13:58:19,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 13:58:19,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:19,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:19,333 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-17 13:58:19,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:19,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105819912] [2025-03-17 13:58:19,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105819912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:19,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:19,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:58:19,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912873846] [2025-03-17 13:58:19,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:19,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:58:19,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:19,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:58:19,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:58:19,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-03-17 13:58:19,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-17 13:58:19,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:19,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-03-17 13:58:19,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:19,534 INFO L124 PetriNetUnfolderBase]: 1382/3053 cut-off events. [2025-03-17 13:58:19,535 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2025-03-17 13:58:19,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5494 conditions, 3053 events. 1382/3053 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17472 event pairs, 703 based on Foata normal form. 53/2719 useless extension candidates. Maximal degree in co-relation 5486. Up to 1211 conditions per place. [2025-03-17 13:58:19,543 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 80 selfloop transitions, 3 changer transitions 0/131 dead transitions. [2025-03-17 13:58:19,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 131 transitions, 464 flow [2025-03-17 13:58:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:58:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 13:58:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2025-03-17 13:58:19,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-03-17 13:58:19,545 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 298 flow. Second operand 3 states and 390 transitions. [2025-03-17 13:58:19,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 131 transitions, 464 flow [2025-03-17 13:58:19,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 131 transitions, 435 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-03-17 13:58:19,547 INFO L231 Difference]: Finished difference. Result has 106 places, 108 transitions, 233 flow [2025-03-17 13:58:19,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=106, PETRI_TRANSITIONS=108} [2025-03-17 13:58:19,548 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -56 predicate places. [2025-03-17 13:58:19,548 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 108 transitions, 233 flow [2025-03-17 13:58:19,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-17 13:58:19,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:19,548 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-17 13:58:19,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:58:19,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:19,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:19,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1205782464, now seen corresponding path program 1 times [2025-03-17 13:58:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:19,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939306397] [2025-03-17 13:58:19,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:19,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 13:58:19,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 13:58:19,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:19,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:19,604 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-17 13:58:19,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:19,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939306397] [2025-03-17 13:58:19,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939306397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:19,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:19,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:58:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97424309] [2025-03-17 13:58:19,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:19,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:58:19,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:19,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:58:19,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:58:19,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-17 13:58:19,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 108 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-17 13:58:19,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:19,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-17 13:58:19,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:19,829 INFO L124 PetriNetUnfolderBase]: 1392/3062 cut-off events. [2025-03-17 13:58:19,830 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-17 13:58:19,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5444 conditions, 3062 events. 1392/3062 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17488 event pairs, 1089 based on Foata normal form. 77/2801 useless extension candidates. Maximal degree in co-relation 5439. Up to 2215 conditions per place. [2025-03-17 13:58:19,838 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 59 selfloop transitions, 1 changer transitions 0/105 dead transitions. [2025-03-17 13:58:19,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 105 transitions, 347 flow [2025-03-17 13:58:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:58:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 13:58:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-03-17 13:58:19,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957364341085271 [2025-03-17 13:58:19,840 INFO L175 Difference]: Start difference. First operand has 106 places, 108 transitions, 233 flow. Second operand 3 states and 359 transitions. [2025-03-17 13:58:19,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 105 transitions, 347 flow [2025-03-17 13:58:19,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 105 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 13:58:19,842 INFO L231 Difference]: Finished difference. Result has 104 places, 105 transitions, 226 flow [2025-03-17 13:58:19,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=104, PETRI_TRANSITIONS=105} [2025-03-17 13:58:19,842 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -58 predicate places. [2025-03-17 13:58:19,843 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 105 transitions, 226 flow [2025-03-17 13:58:19,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-17 13:58:19,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:19,843 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-17 13:58:19,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:58:19,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:19,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1205782463, now seen corresponding path program 1 times [2025-03-17 13:58:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:19,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603559779] [2025-03-17 13:58:19,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:19,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 13:58:19,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 13:58:19,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:19,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:19,925 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-17 13:58:19,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:19,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603559779] [2025-03-17 13:58:19,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603559779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:19,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:19,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:58:19,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261844582] [2025-03-17 13:58:19,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:19,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:58:19,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:19,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:58:19,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:58:19,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-17 13:58:19,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 105 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-17 13:58:19,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:19,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-17 13:58:19,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:20,207 INFO L124 PetriNetUnfolderBase]: 1392/3050 cut-off events. [2025-03-17 13:58:20,208 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-17 13:58:20,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5419 conditions, 3050 events. 1392/3050 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17310 event pairs, 1089 based on Foata normal form. 0/2712 useless extension candidates. Maximal degree in co-relation 5414. Up to 2215 conditions per place. [2025-03-17 13:58:20,219 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 59 selfloop transitions, 1 changer transitions 0/104 dead transitions. [2025-03-17 13:58:20,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 104 transitions, 344 flow [2025-03-17 13:58:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:58:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 13:58:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-03-17 13:58:20,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7034883720930233 [2025-03-17 13:58:20,220 INFO L175 Difference]: Start difference. First operand has 104 places, 105 transitions, 226 flow. Second operand 3 states and 363 transitions. [2025-03-17 13:58:20,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 104 transitions, 344 flow [2025-03-17 13:58:20,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 104 transitions, 343 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 13:58:20,222 INFO L231 Difference]: Finished difference. Result has 104 places, 104 transitions, 225 flow [2025-03-17 13:58:20,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=104, PETRI_TRANSITIONS=104} [2025-03-17 13:58:20,222 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -58 predicate places. [2025-03-17 13:58:20,222 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 225 flow [2025-03-17 13:58:20,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-17 13:58:20,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:20,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:20,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:58:20,223 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:20,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:20,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1275450201, now seen corresponding path program 1 times [2025-03-17 13:58:20,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:20,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966079063] [2025-03-17 13:58:20,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:20,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:20,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 13:58:20,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 13:58:20,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:20,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:20,447 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-17 13:58:20,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:20,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966079063] [2025-03-17 13:58:20,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966079063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:20,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:20,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:58:20,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908487548] [2025-03-17 13:58:20,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:20,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:58:20,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:20,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:58:20,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:58:20,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-03-17 13:58:20,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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-17 13:58:20,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:20,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-03-17 13:58:20,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:20,972 INFO L124 PetriNetUnfolderBase]: 1392/3026 cut-off events. [2025-03-17 13:58:20,972 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-17 13:58:20,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5397 conditions, 3026 events. 1392/3026 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17029 event pairs, 1074 based on Foata normal form. 12/2724 useless extension candidates. Maximal degree in co-relation 5392. Up to 2185 conditions per place. [2025-03-17 13:58:20,982 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 65 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2025-03-17 13:58:20,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 110 transitions, 376 flow [2025-03-17 13:58:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:58:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 13:58:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2025-03-17 13:58:20,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6569767441860465 [2025-03-17 13:58:20,984 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 225 flow. Second operand 5 states and 565 transitions. [2025-03-17 13:58:20,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 110 transitions, 376 flow [2025-03-17 13:58:20,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 13:58:20,985 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 228 flow [2025-03-17 13:58:20,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2025-03-17 13:58:20,986 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -57 predicate places. [2025-03-17 13:58:20,986 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 228 flow [2025-03-17 13:58:20,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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-17 13:58:20,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:20,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:20,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:58:20,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:20,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1275450200, now seen corresponding path program 1 times [2025-03-17 13:58:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:20,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283453440] [2025-03-17 13:58:20,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:20,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 13:58:20,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 13:58:20,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:20,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:21,070 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-17 13:58:21,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283453440] [2025-03-17 13:58:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283453440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:21,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:21,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:58:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077561207] [2025-03-17 13:58:21,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:21,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:58:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:21,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:58:21,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:58:21,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-17 13:58:21,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-17 13:58:21,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:21,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-17 13:58:21,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:21,377 INFO L124 PetriNetUnfolderBase]: 1392/3002 cut-off events. [2025-03-17 13:58:21,377 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-17 13:58:21,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5398 conditions, 3002 events. 1392/3002 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 16808 event pairs, 1074 based on Foata normal form. 24/2724 useless extension candidates. Maximal degree in co-relation 5393. Up to 2186 conditions per place. [2025-03-17 13:58:21,385 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 65 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2025-03-17 13:58:21,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 377 flow [2025-03-17 13:58:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:58:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 13:58:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2025-03-17 13:58:21,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816860465116279 [2025-03-17 13:58:21,387 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 228 flow. Second operand 4 states and 469 transitions. [2025-03-17 13:58:21,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 377 flow [2025-03-17 13:58:21,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 108 transitions, 369 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 13:58:21,388 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 222 flow [2025-03-17 13:58:21,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=99, 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=4, PETRI_FLOW=222, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2025-03-17 13:58:21,389 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -60 predicate places. [2025-03-17 13:58:21,389 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 222 flow [2025-03-17 13:58:21,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-17 13:58:21,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:21,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:21,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:58:21,389 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:21,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:21,390 INFO L85 PathProgramCache]: Analyzing trace with hash 884218662, now seen corresponding path program 1 times [2025-03-17 13:58:21,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:21,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201876064] [2025-03-17 13:58:21,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:21,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:21,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 13:58:21,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 13:58:21,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:21,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:21,449 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-17 13:58:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:21,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201876064] [2025-03-17 13:58:21,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201876064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:21,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:21,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:58:21,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205835095] [2025-03-17 13:58:21,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:21,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:58:21,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:21,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:58:21,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:58:21,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-03-17 13:58:21,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-17 13:58:21,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:21,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-03-17 13:58:21,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:21,631 INFO L124 PetriNetUnfolderBase]: 1380/2990 cut-off events. [2025-03-17 13:58:21,631 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-17 13:58:21,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5373 conditions, 2990 events. 1380/2990 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 16764 event pairs, 1074 based on Foata normal form. 0/2700 useless extension candidates. Maximal degree in co-relation 5368. Up to 2175 conditions per place. [2025-03-17 13:58:21,640 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 65 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-03-17 13:58:21,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 107 transitions, 371 flow [2025-03-17 13:58:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:58:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 13:58:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-03-17 13:58:21,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7228682170542635 [2025-03-17 13:58:21,641 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 222 flow. Second operand 3 states and 373 transitions. [2025-03-17 13:58:21,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 107 transitions, 371 flow [2025-03-17 13:58:21,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 107 transitions, 365 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 13:58:21,642 INFO L231 Difference]: Finished difference. Result has 101 places, 99 transitions, 218 flow [2025-03-17 13:58:21,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=101, PETRI_TRANSITIONS=99} [2025-03-17 13:58:21,644 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -61 predicate places. [2025-03-17 13:58:21,644 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 218 flow [2025-03-17 13:58:21,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-17 13:58:21,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:21,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:21,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:58:21,644 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:21,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:21,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1129322816, now seen corresponding path program 1 times [2025-03-17 13:58:21,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:21,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636044370] [2025-03-17 13:58:21,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:21,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:21,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 13:58:21,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 13:58:21,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:21,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:58:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636044370] [2025-03-17 13:58:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636044370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 13:58:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304812149] [2025-03-17 13:58:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:21,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 13:58:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:21,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 13:58:21,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:58:22,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-03-17 13:58:22,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 218 flow. Second operand has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 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-17 13:58:22,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:22,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-03-17 13:58:22,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:22,712 INFO L124 PetriNetUnfolderBase]: 1717/3480 cut-off events. [2025-03-17 13:58:22,712 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-17 13:58:22,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6484 conditions, 3480 events. 1717/3480 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 19024 event pairs, 388 based on Foata normal form. 0/3242 useless extension candidates. Maximal degree in co-relation 6479. Up to 2364 conditions per place. [2025-03-17 13:58:22,722 INFO L140 encePairwiseOnDemand]: 159/172 looper letters, 116 selfloop transitions, 12 changer transitions 0/159 dead transitions. [2025-03-17 13:58:22,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 159 transitions, 604 flow [2025-03-17 13:58:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:58:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 13:58:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 965 transitions. [2025-03-17 13:58:22,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233850129198967 [2025-03-17 13:58:22,724 INFO L175 Difference]: Start difference. First operand has 101 places, 99 transitions, 218 flow. Second operand 9 states and 965 transitions. [2025-03-17 13:58:22,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 159 transitions, 604 flow [2025-03-17 13:58:22,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 159 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 13:58:22,727 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 250 flow [2025-03-17 13:58:22,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2025-03-17 13:58:22,727 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -55 predicate places. [2025-03-17 13:58:22,728 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 250 flow [2025-03-17 13:58:22,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 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-17 13:58:22,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:22,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:22,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:58:22,728 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:22,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:22,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1032898862, now seen corresponding path program 1 times [2025-03-17 13:58:22,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:22,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886262728] [2025-03-17 13:58:22,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:22,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:22,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 13:58:22,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 13:58:22,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:22,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:23,479 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-17 13:58:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:23,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886262728] [2025-03-17 13:58:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886262728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:23,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 13:58:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429038033] [2025-03-17 13:58:23,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:23,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:58:23,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:23,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:58:23,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:58:24,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 172 [2025-03-17 13:58:24,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 250 flow. Second operand has 15 states, 15 states have (on average 93.6) internal successors, (1404), 15 states have internal predecessors, (1404), 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-17 13:58:24,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:24,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 172 [2025-03-17 13:58:24,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:24,918 INFO L124 PetriNetUnfolderBase]: 1711/3419 cut-off events. [2025-03-17 13:58:24,919 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-03-17 13:58:24,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6717 conditions, 3419 events. 1711/3419 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 18715 event pairs, 438 based on Foata normal form. 0/3215 useless extension candidates. Maximal degree in co-relation 6711. Up to 2065 conditions per place. [2025-03-17 13:58:24,929 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 128 selfloop transitions, 14 changer transitions 0/169 dead transitions. [2025-03-17 13:58:24,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 169 transitions, 682 flow [2025-03-17 13:58:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:58:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 13:58:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1335 transitions. [2025-03-17 13:58:24,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5970483005366727 [2025-03-17 13:58:24,932 INFO L175 Difference]: Start difference. First operand has 107 places, 100 transitions, 250 flow. Second operand 13 states and 1335 transitions. [2025-03-17 13:58:24,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 169 transitions, 682 flow [2025-03-17 13:58:24,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 169 transitions, 662 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 13:58:24,934 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 258 flow [2025-03-17 13:58:24,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=258, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2025-03-17 13:58:24,935 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -53 predicate places. [2025-03-17 13:58:24,935 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 258 flow [2025-03-17 13:58:24,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 93.6) internal successors, (1404), 15 states have internal predecessors, (1404), 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-17 13:58:24,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:24,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:24,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 13:58:24,936 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:24,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash -21928014, now seen corresponding path program 1 times [2025-03-17 13:58:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:24,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570707762] [2025-03-17 13:58:24,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:24,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:24,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 13:58:24,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 13:58:24,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:24,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:25,515 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-17 13:58:25,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:25,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570707762] [2025-03-17 13:58:25,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570707762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:25,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:25,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 13:58:25,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609589136] [2025-03-17 13:58:25,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:25,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:58:25,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:25,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:58:25,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:58:26,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 172 [2025-03-17 13:58:26,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 258 flow. Second operand has 11 states, 11 states have (on average 77.54545454545455) internal successors, (853), 11 states have internal predecessors, (853), 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-17 13:58:26,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:26,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 172 [2025-03-17 13:58:26,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:26,689 INFO L124 PetriNetUnfolderBase]: 2375/4663 cut-off events. [2025-03-17 13:58:26,689 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2025-03-17 13:58:26,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9284 conditions, 4663 events. 2375/4663 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 27690 event pairs, 226 based on Foata normal form. 56/4466 useless extension candidates. Maximal degree in co-relation 9277. Up to 2173 conditions per place. [2025-03-17 13:58:26,702 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 153 selfloop transitions, 19 changer transitions 0/200 dead transitions. [2025-03-17 13:58:26,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 200 transitions, 847 flow [2025-03-17 13:58:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:58:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 13:58:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 992 transitions. [2025-03-17 13:58:26,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5243128964059197 [2025-03-17 13:58:26,704 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 258 flow. Second operand 11 states and 992 transitions. [2025-03-17 13:58:26,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 200 transitions, 847 flow [2025-03-17 13:58:26,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 200 transitions, 823 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-17 13:58:26,707 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 344 flow [2025-03-17 13:58:26,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=344, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2025-03-17 13:58:26,707 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places. [2025-03-17 13:58:26,707 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 344 flow [2025-03-17 13:58:26,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 77.54545454545455) internal successors, (853), 11 states have internal predecessors, (853), 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-17 13:58:26,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:26,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:26,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 13:58:26,708 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:26,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash 912939374, now seen corresponding path program 1 times [2025-03-17 13:58:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:26,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782194901] [2025-03-17 13:58:26,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:26,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 13:58:26,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 13:58:26,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:26,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 13:58:26,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:26,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782194901] [2025-03-17 13:58:26,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782194901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:26,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:26,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:58:26,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640601062] [2025-03-17 13:58:26,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:26,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:58:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:26,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:58:26,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:58:26,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-03-17 13:58:26,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-17 13:58:26,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:26,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-03-17 13:58:26,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:27,193 INFO L124 PetriNetUnfolderBase]: 3330/7327 cut-off events. [2025-03-17 13:58:27,193 INFO L125 PetriNetUnfolderBase]: For 1692/1758 co-relation queries the response was YES. [2025-03-17 13:58:27,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14786 conditions, 7327 events. 3330/7327 cut-off events. For 1692/1758 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 54376 event pairs, 1490 based on Foata normal form. 183/6950 useless extension candidates. Maximal degree in co-relation 14775. Up to 3219 conditions per place. [2025-03-17 13:58:27,215 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 126 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-17 13:58:27,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 166 transitions, 819 flow [2025-03-17 13:58:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:58:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 13:58:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2025-03-17 13:58:27,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7926356589147286 [2025-03-17 13:58:27,216 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 344 flow. Second operand 3 states and 409 transitions. [2025-03-17 13:58:27,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 166 transitions, 819 flow [2025-03-17 13:58:27,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 166 transitions, 784 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-17 13:58:27,221 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 336 flow [2025-03-17 13:58:27,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2025-03-17 13:58:27,221 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -52 predicate places. [2025-03-17 13:58:27,221 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 336 flow [2025-03-17 13:58:27,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-17 13:58:27,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:27,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:27,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:58:27,222 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:27,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash -288406036, now seen corresponding path program 1 times [2025-03-17 13:58:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:27,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861102547] [2025-03-17 13:58:27,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:27,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:27,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 13:58:27,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 13:58:27,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:27,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 13:58:27,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:27,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861102547] [2025-03-17 13:58:27,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861102547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:27,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:27,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:58:27,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551502634] [2025-03-17 13:58:27,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:27,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:58:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:27,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:58:27,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:58:27,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-03-17 13:58:27,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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-17 13:58:27,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:27,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-03-17 13:58:27,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:27,938 INFO L124 PetriNetUnfolderBase]: 4187/8372 cut-off events. [2025-03-17 13:58:27,938 INFO L125 PetriNetUnfolderBase]: For 2330/2368 co-relation queries the response was YES. [2025-03-17 13:58:27,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18426 conditions, 8372 events. 4187/8372 cut-off events. For 2330/2368 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 59018 event pairs, 2277 based on Foata normal form. 92/7988 useless extension candidates. Maximal degree in co-relation 18413. Up to 5628 conditions per place. [2025-03-17 13:58:27,972 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 103 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-03-17 13:58:27,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 143 transitions, 663 flow [2025-03-17 13:58:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:58:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 13:58:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2025-03-17 13:58:27,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7136627906976745 [2025-03-17 13:58:27,974 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 336 flow. Second operand 4 states and 491 transitions. [2025-03-17 13:58:27,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 143 transitions, 663 flow [2025-03-17 13:58:27,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 143 transitions, 659 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 13:58:27,982 INFO L231 Difference]: Finished difference. Result has 113 places, 109 transitions, 350 flow [2025-03-17 13:58:27,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=113, PETRI_TRANSITIONS=109} [2025-03-17 13:58:27,983 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -49 predicate places. [2025-03-17 13:58:27,983 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 109 transitions, 350 flow [2025-03-17 13:58:27,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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-17 13:58:27,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:27,983 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:27,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:58:27,983 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 305172869, now seen corresponding path program 1 times [2025-03-17 13:58:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:27,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735621989] [2025-03-17 13:58:27,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:27,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 13:58:28,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 13:58:28,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:28,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 13:58:28,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:28,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735621989] [2025-03-17 13:58:28,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735621989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:28,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:28,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:58:28,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12902845] [2025-03-17 13:58:28,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:28,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:58:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:28,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:58:28,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:58:28,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-17 13:58:28,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 109 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-17 13:58:28,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:28,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-17 13:58:28,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:28,318 INFO L124 PetriNetUnfolderBase]: 2481/5239 cut-off events. [2025-03-17 13:58:28,318 INFO L125 PetriNetUnfolderBase]: For 1241/1241 co-relation queries the response was YES. [2025-03-17 13:58:28,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11254 conditions, 5239 events. 2481/5239 cut-off events. For 1241/1241 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 33845 event pairs, 1218 based on Foata normal form. 124/5104 useless extension candidates. Maximal degree in co-relation 11240. Up to 2282 conditions per place. [2025-03-17 13:58:28,333 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 79 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2025-03-17 13:58:28,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 118 transitions, 519 flow [2025-03-17 13:58:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:58:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 13:58:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2025-03-17 13:58:28,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2025-03-17 13:58:28,334 INFO L175 Difference]: Start difference. First operand has 113 places, 109 transitions, 350 flow. Second operand 3 states and 376 transitions. [2025-03-17 13:58:28,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 118 transitions, 519 flow [2025-03-17 13:58:28,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 118 transitions, 497 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 13:58:28,337 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 302 flow [2025-03-17 13:58:28,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2025-03-17 13:58:28,338 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -52 predicate places. [2025-03-17 13:58:28,338 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 302 flow [2025-03-17 13:58:28,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-17 13:58:28,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:28,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:28,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 13:58:28,339 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:28,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1630951746, now seen corresponding path program 1 times [2025-03-17 13:58:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:28,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998894066] [2025-03-17 13:58:28,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:28,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:28,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 13:58:28,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 13:58:28,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:28,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 13:58:28,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:28,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998894066] [2025-03-17 13:58:28,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998894066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:28,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:28,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:58:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813348772] [2025-03-17 13:58:28,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:28,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:58:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:28,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:58:28,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:58:28,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-03-17 13:58:28,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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-17 13:58:28,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:28,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-03-17 13:58:28,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:28,628 INFO L124 PetriNetUnfolderBase]: 1512/3598 cut-off events. [2025-03-17 13:58:28,628 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES. [2025-03-17 13:58:28,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7821 conditions, 3598 events. 1512/3598 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 21578 event pairs, 368 based on Foata normal form. 218/3647 useless extension candidates. Maximal degree in co-relation 7808. Up to 1849 conditions per place. [2025-03-17 13:58:28,640 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 71 selfloop transitions, 6 changer transitions 0/115 dead transitions. [2025-03-17 13:58:28,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 115 transitions, 500 flow [2025-03-17 13:58:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:58:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 13:58:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2025-03-17 13:58:28,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2025-03-17 13:58:28,641 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 302 flow. Second operand 3 states and 376 transitions. [2025-03-17 13:58:28,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 115 transitions, 500 flow [2025-03-17 13:58:28,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 13:58:28,644 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 308 flow [2025-03-17 13:58:28,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2025-03-17 13:58:28,646 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -52 predicate places. [2025-03-17 13:58:28,646 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 308 flow [2025-03-17 13:58:28,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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-17 13:58:28,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:28,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:28,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 13:58:28,647 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:28,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash -404707901, now seen corresponding path program 1 times [2025-03-17 13:58:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:28,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591198859] [2025-03-17 13:58:28,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:28,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:28,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 13:58:28,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 13:58:28,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:28,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 13:58:28,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591198859] [2025-03-17 13:58:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591198859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:58:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:58:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153156959] [2025-03-17 13:58:28,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:28,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:58:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:28,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:58:28,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:58:29,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 172 [2025-03-17 13:58:29,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 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-17 13:58:29,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:29,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 172 [2025-03-17 13:58:29,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:29,404 INFO L124 PetriNetUnfolderBase]: 1512/3343 cut-off events. [2025-03-17 13:58:29,404 INFO L125 PetriNetUnfolderBase]: For 1233/1233 co-relation queries the response was YES. [2025-03-17 13:58:29,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7863 conditions, 3343 events. 1512/3343 cut-off events. For 1233/1233 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18752 event pairs, 1021 based on Foata normal form. 126/3374 useless extension candidates. Maximal degree in co-relation 7850. Up to 2205 conditions per place. [2025-03-17 13:58:29,414 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 65 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-03-17 13:58:29,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 100 transitions, 449 flow [2025-03-17 13:58:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:58:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 13:58:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2025-03-17 13:58:29,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6302325581395349 [2025-03-17 13:58:29,416 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 308 flow. Second operand 5 states and 542 transitions. [2025-03-17 13:58:29,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 100 transitions, 449 flow [2025-03-17 13:58:29,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 13:58:29,419 INFO L231 Difference]: Finished difference. Result has 106 places, 95 transitions, 296 flow [2025-03-17 13:58:29,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=106, PETRI_TRANSITIONS=95} [2025-03-17 13:58:29,419 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -56 predicate places. [2025-03-17 13:58:29,419 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 95 transitions, 296 flow [2025-03-17 13:58:29,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 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-17 13:58:29,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:29,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:29,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 13:58:29,419 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:29,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2088146468, now seen corresponding path program 1 times [2025-03-17 13:58:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:29,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114930111] [2025-03-17 13:58:29,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:29,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:29,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 13:58:29,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 13:58:29,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:29,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 13:58:29,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:29,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114930111] [2025-03-17 13:58:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114930111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:58:29,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094845102] [2025-03-17 13:58:29,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:29,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:58:29,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:58:29,464 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-17 13:58:29,465 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-17 13:58:29,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 13:58:29,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 13:58:29,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:29,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:29,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 13:58:29,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:58:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 13:58:29,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 13:58:29,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094845102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:58:29,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 13:58:29,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-17 13:58:29,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680774600] [2025-03-17 13:58:29,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:58:29,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:58:29,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:29,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:58:29,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:58:29,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-03-17 13:58:29,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 95 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-17 13:58:29,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:29,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-03-17 13:58:29,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:29,878 INFO L124 PetriNetUnfolderBase]: 1512/3346 cut-off events. [2025-03-17 13:58:29,878 INFO L125 PetriNetUnfolderBase]: For 1159/1159 co-relation queries the response was YES. [2025-03-17 13:58:29,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 3346 events. 1512/3346 cut-off events. For 1159/1159 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 18795 event pairs, 1201 based on Foata normal form. 5/3242 useless extension candidates. Maximal degree in co-relation 7737. Up to 2624 conditions per place. [2025-03-17 13:58:29,888 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 62 selfloop transitions, 1 changer transitions 2/94 dead transitions. [2025-03-17 13:58:29,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 94 transitions, 422 flow [2025-03-17 13:58:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:58:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 13:58:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2025-03-17 13:58:29,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-03-17 13:58:29,889 INFO L175 Difference]: Start difference. First operand has 106 places, 95 transitions, 296 flow. Second operand 3 states and 360 transitions. [2025-03-17 13:58:29,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 94 transitions, 422 flow [2025-03-17 13:58:29,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 94 transitions, 414 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 13:58:29,892 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 283 flow [2025-03-17 13:58:29,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=283, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2025-03-17 13:58:29,893 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -59 predicate places. [2025-03-17 13:58:29,893 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 283 flow [2025-03-17 13:58:29,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-17 13:58:29,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:29,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:29,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 13:58:30,098 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,SelfDestructingSolverStorable22 [2025-03-17 13:58:30,098 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:30,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2145023869, now seen corresponding path program 1 times [2025-03-17 13:58:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:30,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715681930] [2025-03-17 13:58:30,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:30,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 13:58:30,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 13:58:30,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:30,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 13:58:30,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:30,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715681930] [2025-03-17 13:58:30,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715681930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:58:30,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243527697] [2025-03-17 13:58:30,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:30,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:58:30,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:58:30,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:58:30,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 13:58:30,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 13:58:30,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 13:58:30,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:30,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:30,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 13:58:30,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:58:30,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 13:58:30,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 13:58:31,059 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 13:58:31,071 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-03-17 13:58:31,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2025-03-17 13:58:31,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:58:31,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 13:58:31,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-03-17 13:58:31,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 13:58:31,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 13:58:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 13:58:31,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:58:32,098 INFO L349 Elim1Store]: treesize reduction 56, result has 43.4 percent of original size [2025-03-17 13:58:32,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 179 [2025-03-17 13:58:32,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:58:32,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 140 [2025-03-17 13:58:32,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-17 13:58:32,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:58:32,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 106 [2025-03-17 13:58:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 13:58:32,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243527697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:58:32,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:58:32,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 36 [2025-03-17 13:58:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272066999] [2025-03-17 13:58:32,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:58:32,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-17 13:58:32,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:58:32,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-17 13:58:32,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 13:58:41,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 13:58:43,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 172 [2025-03-17 13:58:43,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 283 flow. Second operand has 37 states, 37 states have (on average 94.08108108108108) internal successors, (3481), 37 states have internal predecessors, (3481), 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-17 13:58:43,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 13:58:43,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 172 [2025-03-17 13:58:43,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 13:58:45,079 INFO L124 PetriNetUnfolderBase]: 1455/3101 cut-off events. [2025-03-17 13:58:45,080 INFO L125 PetriNetUnfolderBase]: For 1015/1015 co-relation queries the response was YES. [2025-03-17 13:58:45,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7183 conditions, 3101 events. 1455/3101 cut-off events. For 1015/1015 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 15300 event pairs, 212 based on Foata normal form. 0/3029 useless extension candidates. Maximal degree in co-relation 7169. Up to 984 conditions per place. [2025-03-17 13:58:45,090 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 146 selfloop transitions, 22 changer transitions 17/204 dead transitions. [2025-03-17 13:58:45,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 204 transitions, 1012 flow [2025-03-17 13:58:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 13:58:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 13:58:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1716 transitions. [2025-03-17 13:58:45,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5868673050615595 [2025-03-17 13:58:45,095 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 283 flow. Second operand 17 states and 1716 transitions. [2025-03-17 13:58:45,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 204 transitions, 1012 flow [2025-03-17 13:58:45,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 204 transitions, 1005 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 13:58:45,099 INFO L231 Difference]: Finished difference. Result has 120 places, 95 transitions, 347 flow [2025-03-17 13:58:45,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=347, PETRI_PLACES=120, PETRI_TRANSITIONS=95} [2025-03-17 13:58:45,100 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -42 predicate places. [2025-03-17 13:58:45,100 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 95 transitions, 347 flow [2025-03-17 13:58:45,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 94.08108108108108) internal successors, (3481), 37 states have internal predecessors, (3481), 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-17 13:58:45,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 13:58:45,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:58:45,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 13:58:45,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 13:58:45,305 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-03-17 13:58:45,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:58:45,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1502045180, now seen corresponding path program 1 times [2025-03-17 13:58:45,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:58:45,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970324804] [2025-03-17 13:58:45,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:58:45,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 13:58:45,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 13:58:45,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:45,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 13:58:46,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:58:46,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970324804] [2025-03-17 13:58:46,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970324804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:58:46,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477593496] [2025-03-17 13:58:46,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:58:46,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:58:46,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:58:46,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:58:46,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 13:58:46,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 13:58:46,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 13:58:46,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:58:46,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:58:46,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-17 13:58:46,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:58:46,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 13:58:46,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 13:58:46,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-17 13:58:46,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:58:46,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:58:46,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2025-03-17 13:58:46,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-17 13:58:47,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-17 13:58:47,190 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-17 13:58:47,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2025-03-17 13:58:47,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-17 13:58:47,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-17 13:58:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 13:58:47,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:59:01,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (and (forall ((v_ArrVal_564 Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int)) (let ((.cse0 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_564)) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)))) (< .cse5 v_ArrVal_564))) (forall ((v_ArrVal_564 Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int)) (let ((.cse6 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_564)) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 4)))) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)))) (< .cse5 v_ArrVal_564))))) is different from false [2025-03-17 13:59:36,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80)) (.cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (select |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_564 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_559 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_559))) (let ((.cse0 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse5 v_ArrVal_561) .cse4 v_ArrVal_564)) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< 0 (+ |c_~#queue~0.offset| (* (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse2) 4) 1)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_564))))) (forall ((v_ArrVal_564 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_559 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse9 (store .cse6 .cse7 v_ArrVal_559))) (let ((.cse8 (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 .cse5 v_ArrVal_561) .cse4 v_ArrVal_564)) |c_~#queue~0.base|))) (or (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (+ 3 |c_~#queue~0.offset| (* (select (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) |t1Thread1of1ForFork0_enqueue_~x#1|) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|)) (< (+ (select .cse9 .cse4) 1) v_ArrVal_564))))))) is different from false