./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.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/goblint-regression/09-regions_12-arraycollapse_rc-deref.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 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:16:54,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:16:54,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:16:54,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:16:54,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:16:54,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:16:54,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:16:54,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:16:54,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:16:54,442 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:16:54,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:16:54,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:16:54,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:16:54,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:16:54,444 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:16:54,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:16:54,444 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:16:54,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:16:54,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:16:54,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:16:54,444 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:16:54,444 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:16:54,444 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:16:54,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:16:54,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:16:54,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:16:54,445 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:16:54,445 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:16:54,445 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:16:54,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:16:54,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:16:54,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:16:54,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:16:54,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:54,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:16:54,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:16:54,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:16:54,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:16:54,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:16:54,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:16:54,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:16:54,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:16:54,447 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 -> 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 [2025-03-17 14:16:54,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:16:54,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:16:54,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:16:54,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:16:54,676 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:16:54,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2025-03-17 14:16:55,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0c5b7d7/ae8878865af44c88954e134a8cf8325a/FLAG9076d5ab2 [2025-03-17 14:16:56,053 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:16:56,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2025-03-17 14:16:56,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0c5b7d7/ae8878865af44c88954e134a8cf8325a/FLAG9076d5ab2 [2025-03-17 14:16:56,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0c5b7d7/ae8878865af44c88954e134a8cf8325a [2025-03-17 14:16:56,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:16:56,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:16:56,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:56,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:16:56,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:16:56,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c23a4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56, skipping insertion in model container [2025-03-17 14:16:56,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:16:56,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:16:56,784 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:16:56,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:16:56,876 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:16:56,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56 WrapperNode [2025-03-17 14:16:56,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:16:56,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:16:56,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:16:56,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:16:56,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,914 INFO L138 Inliner]: procedures = 372, calls = 99, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 246 [2025-03-17 14:16:56,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:16:56,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:16:56,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:16:56,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:16:56,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,954 INFO L175 MemorySlicer]: Split 97 memory accesses to 3 slices as follows [50, 18, 29]. 52 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 24 writes are split as follows [0, 2, 22]. [2025-03-17 14:16:56,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:16:56,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:16:56,976 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:16:56,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:16:56,976 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (1/1) ... [2025-03-17 14:16:56,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:16:56,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:57,007 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 14:16:57,012 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 14:16:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:16:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:16:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 14:16:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 14:16:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 14:16:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 14:16:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:16:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:16:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:16:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:16:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:16:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:16:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:16:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:16:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:16:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:16:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:16:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:16:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 14:16:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 14:16:57,029 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 14:16:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:16:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:16:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:16:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:16:57,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:16:57,030 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 14:16:57,159 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:16:57,160 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:16:57,621 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:16:57,621 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:16:57,858 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:16:57,859 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:16:57,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:57 BoogieIcfgContainer [2025-03-17 14:16:57,859 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:16:57,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:16:57,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:16:57,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:16:57,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:16:56" (1/3) ... [2025-03-17 14:16:57,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31aaf628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:16:57, skipping insertion in model container [2025-03-17 14:16:57,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:16:56" (2/3) ... [2025-03-17 14:16:57,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31aaf628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:16:57, skipping insertion in model container [2025-03-17 14:16:57,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:16:57" (3/3) ... [2025-03-17 14:16:57,865 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc-deref.i [2025-03-17 14:16:57,876 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:16:57,877 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc-deref.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 75 error locations. [2025-03-17 14:16:57,877 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:16:57,937 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:16:57,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 128 transitions, 260 flow [2025-03-17 14:16:57,999 INFO L124 PetriNetUnfolderBase]: 1/127 cut-off events. [2025-03-17 14:16:58,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:58,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 1/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 258 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2025-03-17 14:16:58,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 128 transitions, 260 flow [2025-03-17 14:16:58,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 127 transitions, 257 flow [2025-03-17 14:16:58,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:16:58,020 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;@308c90a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:16:58,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2025-03-17 14:16:58,024 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:16:58,024 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:16:58,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:58,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:58,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:16:58,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:16:58,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash 760442, now seen corresponding path program 1 times [2025-03-17 14:16:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:58,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349529882] [2025-03-17 14:16:58,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:58,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:16:58,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:16:58,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:58,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:16:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:58,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349529882] [2025-03-17 14:16:58,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349529882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:58,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:58,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:58,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844487801] [2025-03-17 14:16:58,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:58,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:58,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:58,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:58,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:58,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2025-03-17 14:16:58,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 14:16:58,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:58,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2025-03-17 14:16:58,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:58,476 INFO L124 PetriNetUnfolderBase]: 64/324 cut-off events. [2025-03-17 14:16:58,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:58,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 324 events. 64/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1317 event pairs, 63 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 377. Up to 166 conditions per place. [2025-03-17 14:16:58,481 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2025-03-17 14:16:58,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 339 flow [2025-03-17 14:16:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2025-03-17 14:16:58,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2025-03-17 14:16:58,495 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 257 flow. Second operand 3 states and 308 transitions. [2025-03-17 14:16:58,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 339 flow [2025-03-17 14:16:58,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:58,503 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 268 flow [2025-03-17 14:16:58,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2025-03-17 14:16:58,508 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-17 14:16:58,508 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 268 flow [2025-03-17 14:16:58,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 14:16:58,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:58,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:16:58,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:16:58,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:16:58,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash 23571699, now seen corresponding path program 1 times [2025-03-17 14:16:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:58,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399103838] [2025-03-17 14:16:58,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:58,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:16:58,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:16:58,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:58,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:16:58,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:58,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399103838] [2025-03-17 14:16:58,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399103838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:58,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114000869] [2025-03-17 14:16:58,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:58,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:58,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:58,620 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 14:16:58,622 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 14:16:58,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:16:58,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:16:58,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:58,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:16:58,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:16:58,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:16:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:16:58,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114000869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:16:58,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:16:58,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:16:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929618767] [2025-03-17 14:16:58,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:16:58,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:16:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:58,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:16:58,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:16:58,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2025-03-17 14:16:58,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 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 14:16:58,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:58,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2025-03-17 14:16:58,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:58,950 INFO L124 PetriNetUnfolderBase]: 64/327 cut-off events. [2025-03-17 14:16:58,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:16:58,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 327 events. 64/327 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1310 event pairs, 63 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 499. Up to 166 conditions per place. [2025-03-17 14:16:58,953 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 5 changer transitions 0/131 dead transitions. [2025-03-17 14:16:58,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 366 flow [2025-03-17 14:16:58,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:16:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:16:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2025-03-17 14:16:58,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2025-03-17 14:16:58,955 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 268 flow. Second operand 6 states and 580 transitions. [2025-03-17 14:16:58,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 366 flow [2025-03-17 14:16:58,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 362 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:58,957 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 300 flow [2025-03-17 14:16:58,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=139, PETRI_TRANSITIONS=131} [2025-03-17 14:16:58,958 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 9 predicate places. [2025-03-17 14:16:58,958 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 300 flow [2025-03-17 14:16:58,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 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 14:16:58,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:58,959 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-03-17 14:16:58,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:16:59,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:59,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:16:59,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2142826682, now seen corresponding path program 2 times [2025-03-17 14:16:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:59,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755357989] [2025-03-17 14:16:59,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:16:59,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:59,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-17 14:16:59,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 7 statements. [2025-03-17 14:16:59,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:16:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:16:59,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:59,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755357989] [2025-03-17 14:16:59,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755357989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:16:59,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:16:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:16:59,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025039200] [2025-03-17 14:16:59,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:16:59,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:16:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:59,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:16:59,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:16:59,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 128 [2025-03-17 14:16:59,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 131 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:16:59,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:59,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 128 [2025-03-17 14:16:59,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:59,502 INFO L124 PetriNetUnfolderBase]: 64/317 cut-off events. [2025-03-17 14:16:59,502 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:16:59,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 317 events. 64/317 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1266 event pairs, 63 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 485. Up to 165 conditions per place. [2025-03-17 14:16:59,506 INFO L140 encePairwiseOnDemand]: 108/128 looper letters, 38 selfloop transitions, 10 changer transitions 0/121 dead transitions. [2025-03-17 14:16:59,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 121 transitions, 376 flow [2025-03-17 14:16:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:16:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:16:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2025-03-17 14:16:59,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-17 14:16:59,509 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 300 flow. Second operand 3 states and 276 transitions. [2025-03-17 14:16:59,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 121 transitions, 376 flow [2025-03-17 14:16:59,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 121 transitions, 362 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:16:59,513 INFO L231 Difference]: Finished difference. Result has 130 places, 121 transitions, 286 flow [2025-03-17 14:16:59,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=130, PETRI_TRANSITIONS=121} [2025-03-17 14:16:59,514 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 0 predicate places. [2025-03-17 14:16:59,514 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 121 transitions, 286 flow [2025-03-17 14:16:59,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:16:59,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:59,514 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-03-17 14:16:59,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:16:59,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:16:59,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:16:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2142826683, now seen corresponding path program 1 times [2025-03-17 14:16:59,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:16:59,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951530936] [2025-03-17 14:16:59,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:59,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:16:59,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:16:59,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:16:59,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:59,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:16:59,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:16:59,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951530936] [2025-03-17 14:16:59,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951530936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:16:59,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809297160] [2025-03-17 14:16:59,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:16:59,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:16:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:16:59,616 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 14:16:59,618 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 14:16:59,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:16:59,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:16:59,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:16:59,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:16:59,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:16:59,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:16:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:16:59,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:16:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:16:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809297160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:16:59,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:16:59,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 14:16:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275330039] [2025-03-17 14:16:59,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:16:59,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:16:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:16:59,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:16:59,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:16:59,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2025-03-17 14:16:59,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 121 transitions, 286 flow. Second operand has 13 states, 13 states have (on average 90.07692307692308) internal successors, (1171), 13 states have internal predecessors, (1171), 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 14:16:59,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:16:59,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2025-03-17 14:16:59,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:16:59,868 INFO L124 PetriNetUnfolderBase]: 64/323 cut-off events. [2025-03-17 14:16:59,868 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-17 14:16:59,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 323 events. 64/323 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1265 event pairs, 63 based on Foata normal form. 6/253 useless extension candidates. Maximal degree in co-relation 490. Up to 166 conditions per place. [2025-03-17 14:16:59,871 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2025-03-17 14:16:59,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 127 transitions, 420 flow [2025-03-17 14:16:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:16:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:16:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1123 transitions. [2025-03-17 14:16:59,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7311197916666666 [2025-03-17 14:16:59,875 INFO L175 Difference]: Start difference. First operand has 130 places, 121 transitions, 286 flow. Second operand 12 states and 1123 transitions. [2025-03-17 14:16:59,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 127 transitions, 420 flow [2025-03-17 14:16:59,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 127 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:16:59,878 INFO L231 Difference]: Finished difference. Result has 145 places, 127 transitions, 350 flow [2025-03-17 14:16:59,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=350, PETRI_PLACES=145, PETRI_TRANSITIONS=127} [2025-03-17 14:16:59,879 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 15 predicate places. [2025-03-17 14:16:59,879 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 127 transitions, 350 flow [2025-03-17 14:16:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 90.07692307692308) internal successors, (1171), 13 states have internal predecessors, (1171), 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 14:16:59,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:16:59,879 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2025-03-17 14:16:59,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:00,080 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,SelfDestructingSolverStorable3 [2025-03-17 14:17:00,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:00,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:00,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1352816155, now seen corresponding path program 2 times [2025-03-17 14:17:00,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:00,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777027072] [2025-03-17 14:17:00,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:00,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:00,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 14:17:00,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 13 statements. [2025-03-17 14:17:00,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:17:00,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:00,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:00,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777027072] [2025-03-17 14:17:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777027072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:00,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:00,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310620588] [2025-03-17 14:17:00,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:00,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:00,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:00,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 128 [2025-03-17 14:17:00,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 127 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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 14:17:00,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:00,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 128 [2025-03-17 14:17:00,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:00,347 INFO L124 PetriNetUnfolderBase]: 64/313 cut-off events. [2025-03-17 14:17:00,347 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-17 14:17:00,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 313 events. 64/313 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1244 event pairs, 63 based on Foata normal form. 5/247 useless extension candidates. Maximal degree in co-relation 476. Up to 171 conditions per place. [2025-03-17 14:17:00,349 INFO L140 encePairwiseOnDemand]: 108/128 looper letters, 39 selfloop transitions, 10 changer transitions 0/117 dead transitions. [2025-03-17 14:17:00,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 117 transitions, 428 flow [2025-03-17 14:17:00,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-17 14:17:00,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7447916666666666 [2025-03-17 14:17:00,350 INFO L175 Difference]: Start difference. First operand has 145 places, 127 transitions, 350 flow. Second operand 3 states and 286 transitions. [2025-03-17 14:17:00,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 117 transitions, 428 flow [2025-03-17 14:17:00,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 117 transitions, 380 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-17 14:17:00,354 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 302 flow [2025-03-17 14:17:00,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=132, PETRI_TRANSITIONS=117} [2025-03-17 14:17:00,355 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-17 14:17:00,355 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 302 flow [2025-03-17 14:17:00,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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 14:17:00,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:00,355 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-17 14:17:00,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:17:00,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:00,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:00,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1318744696, now seen corresponding path program 1 times [2025-03-17 14:17:00,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:00,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154620750] [2025-03-17 14:17:00,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:00,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:00,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:17:00,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:17:00,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:00,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:00,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:00,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154620750] [2025-03-17 14:17:00,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154620750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:00,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:00,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991696134] [2025-03-17 14:17:00,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:00,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:17:00,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:00,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:17:00,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:17:00,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2025-03-17 14:17:00,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 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 14:17:00,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:00,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2025-03-17 14:17:00,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:00,955 INFO L124 PetriNetUnfolderBase]: 73/327 cut-off events. [2025-03-17 14:17:00,955 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 14:17:00,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 327 events. 73/327 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1335 event pairs, 72 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 524. Up to 199 conditions per place. [2025-03-17 14:17:00,957 INFO L140 encePairwiseOnDemand]: 119/128 looper letters, 54 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2025-03-17 14:17:00,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 109 transitions, 396 flow [2025-03-17 14:17:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2025-03-17 14:17:00,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7239583333333334 [2025-03-17 14:17:00,958 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 302 flow. Second operand 3 states and 278 transitions. [2025-03-17 14:17:00,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 109 transitions, 396 flow [2025-03-17 14:17:00,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 109 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:00,961 INFO L231 Difference]: Finished difference. Result has 124 places, 109 transitions, 268 flow [2025-03-17 14:17:00,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=124, PETRI_TRANSITIONS=109} [2025-03-17 14:17:00,962 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2025-03-17 14:17:00,962 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 109 transitions, 268 flow [2025-03-17 14:17:00,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 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 14:17:00,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:00,962 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-17 14:17:00,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:17:00,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:00,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1318744695, now seen corresponding path program 1 times [2025-03-17 14:17:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:00,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373164832] [2025-03-17 14:17:00,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:00,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:17:00,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:17:00,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:00,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:01,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:01,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373164832] [2025-03-17 14:17:01,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373164832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:01,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:01,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:17:01,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812464019] [2025-03-17 14:17:01,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:01,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:01,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:01,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:01,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:01,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 128 [2025-03-17 14:17:01,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 109 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 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 14:17:01,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:01,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 128 [2025-03-17 14:17:01,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:01,551 INFO L124 PetriNetUnfolderBase]: 73/321 cut-off events. [2025-03-17 14:17:01,551 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-17 14:17:01,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 321 events. 73/321 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1305 event pairs, 63 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 537. Up to 158 conditions per place. [2025-03-17 14:17:01,553 INFO L140 encePairwiseOnDemand]: 112/128 looper letters, 44 selfloop transitions, 12 changer transitions 3/114 dead transitions. [2025-03-17 14:17:01,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 396 flow [2025-03-17 14:17:01,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2025-03-17 14:17:01,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6765625 [2025-03-17 14:17:01,555 INFO L175 Difference]: Start difference. First operand has 124 places, 109 transitions, 268 flow. Second operand 5 states and 433 transitions. [2025-03-17 14:17:01,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 114 transitions, 396 flow [2025-03-17 14:17:01,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 114 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:01,559 INFO L231 Difference]: Finished difference. Result has 123 places, 105 transitions, 283 flow [2025-03-17 14:17:01,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=123, PETRI_TRANSITIONS=105} [2025-03-17 14:17:01,560 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -7 predicate places. [2025-03-17 14:17:01,560 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 105 transitions, 283 flow [2025-03-17 14:17:01,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 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 14:17:01,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:01,561 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:01,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:17:01,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:01,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1120639175, now seen corresponding path program 1 times [2025-03-17 14:17:01,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:01,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467241337] [2025-03-17 14:17:01,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:01,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:17:01,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:17:01,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:01,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:01,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:01,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467241337] [2025-03-17 14:17:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467241337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:01,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:01,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:17:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100449959] [2025-03-17 14:17:01,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:01,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:01,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:01,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:01,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:02,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 128 [2025-03-17 14:17:02,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 105 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 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 14:17:02,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:02,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 128 [2025-03-17 14:17:02,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:02,378 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2025-03-17 14:17:02,379 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 14:17:02,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 289 events. 64/289 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1121 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 518. Up to 166 conditions per place. [2025-03-17 14:17:02,380 INFO L140 encePairwiseOnDemand]: 107/128 looper letters, 45 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2025-03-17 14:17:02,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 100 transitions, 395 flow [2025-03-17 14:17:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:17:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:17:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 552 transitions. [2025-03-17 14:17:02,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2025-03-17 14:17:02,382 INFO L175 Difference]: Start difference. First operand has 123 places, 105 transitions, 283 flow. Second operand 8 states and 552 transitions. [2025-03-17 14:17:02,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 100 transitions, 395 flow [2025-03-17 14:17:02,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 100 transitions, 371 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:02,384 INFO L231 Difference]: Finished difference. Result has 121 places, 100 transitions, 281 flow [2025-03-17 14:17:02,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=281, PETRI_PLACES=121, PETRI_TRANSITIONS=100} [2025-03-17 14:17:02,385 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -9 predicate places. [2025-03-17 14:17:02,385 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 100 transitions, 281 flow [2025-03-17 14:17:02,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 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 14:17:02,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:02,386 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:02,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:17:02,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:02,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1120639176, now seen corresponding path program 1 times [2025-03-17 14:17:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:02,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749045918] [2025-03-17 14:17:02,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:02,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:17:02,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:17:02,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:02,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:02,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749045918] [2025-03-17 14:17:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749045918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:02,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:02,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:17:02,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937785679] [2025-03-17 14:17:02,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:02,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:02,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:02,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:02,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:03,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 128 [2025-03-17 14:17:03,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 100 transitions, 281 flow. Second operand has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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 14:17:03,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:03,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 128 [2025-03-17 14:17:03,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:03,492 INFO L124 PetriNetUnfolderBase]: 64/287 cut-off events. [2025-03-17 14:17:03,492 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-17 14:17:03,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 287 events. 64/287 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1132 event pairs, 63 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 511. Up to 172 conditions per place. [2025-03-17 14:17:03,493 INFO L140 encePairwiseOnDemand]: 115/128 looper letters, 49 selfloop transitions, 11 changer transitions 0/98 dead transitions. [2025-03-17 14:17:03,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 98 transitions, 397 flow [2025-03-17 14:17:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:17:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:17:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 444 transitions. [2025-03-17 14:17:03,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4955357142857143 [2025-03-17 14:17:03,495 INFO L175 Difference]: Start difference. First operand has 121 places, 100 transitions, 281 flow. Second operand 7 states and 444 transitions. [2025-03-17 14:17:03,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 98 transitions, 397 flow [2025-03-17 14:17:03,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 98 transitions, 365 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 14:17:03,496 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 267 flow [2025-03-17 14:17:03,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2025-03-17 14:17:03,498 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -12 predicate places. [2025-03-17 14:17:03,499 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 267 flow [2025-03-17 14:17:03,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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 14:17:03,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,499 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:03,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:17:03,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:03,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1102519111, now seen corresponding path program 1 times [2025-03-17 14:17:03,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:03,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460007072] [2025-03-17 14:17:03,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:03,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:03,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:17:03,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:17:03,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:03,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460007072] [2025-03-17 14:17:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460007072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:03,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:03,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:03,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098683133] [2025-03-17 14:17:03,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:03,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:03,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:03,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:03,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2025-03-17 14:17:03,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 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 14:17:03,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:03,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2025-03-17 14:17:03,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:03,969 INFO L124 PetriNetUnfolderBase]: 64/286 cut-off events. [2025-03-17 14:17:03,969 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-17 14:17:03,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 286 events. 64/286 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1125 event pairs, 63 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 497. Up to 171 conditions per place. [2025-03-17 14:17:03,971 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2025-03-17 14:17:03,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 97 transitions, 369 flow [2025-03-17 14:17:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 418 transitions. [2025-03-17 14:17:03,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.653125 [2025-03-17 14:17:03,972 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 267 flow. Second operand 5 states and 418 transitions. [2025-03-17 14:17:03,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 97 transitions, 369 flow [2025-03-17 14:17:03,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 97 transitions, 347 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:17:03,974 INFO L231 Difference]: Finished difference. Result has 115 places, 97 transitions, 265 flow [2025-03-17 14:17:03,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=115, PETRI_TRANSITIONS=97} [2025-03-17 14:17:03,975 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -15 predicate places. [2025-03-17 14:17:03,975 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 97 transitions, 265 flow [2025-03-17 14:17:03,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 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 14:17:03,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:03,975 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:03,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:17:03,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:03,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1102519112, now seen corresponding path program 1 times [2025-03-17 14:17:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:03,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430581105] [2025-03-17 14:17:03,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:03,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:17:03,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:17:03,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:03,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 14:17:04,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:04,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430581105] [2025-03-17 14:17:04,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430581105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:04,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:04,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985486721] [2025-03-17 14:17:04,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:04,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:04,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:04,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:04,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:04,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 128 [2025-03-17 14:17:04,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 97 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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 14:17:04,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:04,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 128 [2025-03-17 14:17:04,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:04,382 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2025-03-17 14:17:04,382 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 14:17:04,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 285 events. 64/285 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1123 event pairs, 63 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 501. Up to 171 conditions per place. [2025-03-17 14:17:04,383 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 46 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2025-03-17 14:17:04,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 96 transitions, 377 flow [2025-03-17 14:17:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2025-03-17 14:17:04,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.621875 [2025-03-17 14:17:04,384 INFO L175 Difference]: Start difference. First operand has 115 places, 97 transitions, 265 flow. Second operand 5 states and 398 transitions. [2025-03-17 14:17:04,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 96 transitions, 377 flow [2025-03-17 14:17:04,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 96 transitions, 355 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:04,387 INFO L231 Difference]: Finished difference. Result has 114 places, 96 transitions, 263 flow [2025-03-17 14:17:04,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=114, PETRI_TRANSITIONS=96} [2025-03-17 14:17:04,389 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -16 predicate places. [2025-03-17 14:17:04,389 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 96 transitions, 263 flow [2025-03-17 14:17:04,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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 14:17:04,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:04,390 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:04,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:17:04,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1531239520, now seen corresponding path program 1 times [2025-03-17 14:17:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079598008] [2025-03-17 14:17:04,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:04,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:17:04,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:17:04,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:04,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:04,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079598008] [2025-03-17 14:17:04,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079598008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:04,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:04,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495786672] [2025-03-17 14:17:04,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:04,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:17:04,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:04,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:17:04,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:17:05,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 128 [2025-03-17 14:17:05,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 96 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 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 14:17:05,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:05,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 128 [2025-03-17 14:17:05,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:05,132 INFO L124 PetriNetUnfolderBase]: 73/309 cut-off events. [2025-03-17 14:17:05,132 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-17 14:17:05,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 309 events. 73/309 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1278 event pairs, 63 based on Foata normal form. 1/256 useless extension candidates. Maximal degree in co-relation 536. Up to 163 conditions per place. [2025-03-17 14:17:05,133 INFO L140 encePairwiseOnDemand]: 122/128 looper letters, 53 selfloop transitions, 3 changer transitions 3/102 dead transitions. [2025-03-17 14:17:05,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 102 transitions, 393 flow [2025-03-17 14:17:05,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:17:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:17:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2025-03-17 14:17:05,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.703125 [2025-03-17 14:17:05,134 INFO L175 Difference]: Start difference. First operand has 114 places, 96 transitions, 263 flow. Second operand 4 states and 360 transitions. [2025-03-17 14:17:05,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 102 transitions, 393 flow [2025-03-17 14:17:05,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 102 transitions, 371 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:05,136 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 241 flow [2025-03-17 14:17:05,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2025-03-17 14:17:05,137 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -20 predicate places. [2025-03-17 14:17:05,137 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 241 flow [2025-03-17 14:17:05,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 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 14:17:05,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:05,137 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:05,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:17:05,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:05,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:05,138 INFO L85 PathProgramCache]: Analyzing trace with hash -962330063, now seen corresponding path program 1 times [2025-03-17 14:17:05,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:05,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888780944] [2025-03-17 14:17:05,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:05,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:05,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:17:05,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:17:05,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:05,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 14:17:05,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:05,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888780944] [2025-03-17 14:17:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888780944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:05,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:05,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:17:05,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162287657] [2025-03-17 14:17:05,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:05,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:05,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:05,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:05,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:05,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 128 [2025-03-17 14:17:05,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 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 14:17:05,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:05,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 128 [2025-03-17 14:17:05,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:06,061 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2025-03-17 14:17:06,061 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 14:17:06,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 278 events. 64/278 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1109 event pairs, 54 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 493. Up to 132 conditions per place. [2025-03-17 14:17:06,063 INFO L140 encePairwiseOnDemand]: 110/128 looper letters, 48 selfloop transitions, 14 changer transitions 3/98 dead transitions. [2025-03-17 14:17:06,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 98 transitions, 381 flow [2025-03-17 14:17:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:17:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:17:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2025-03-17 14:17:06,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033482142857143 [2025-03-17 14:17:06,082 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 241 flow. Second operand 7 states and 451 transitions. [2025-03-17 14:17:06,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 98 transitions, 381 flow [2025-03-17 14:17:06,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 98 transitions, 375 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:17:06,086 INFO L231 Difference]: Finished difference. Result has 109 places, 89 transitions, 255 flow [2025-03-17 14:17:06,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=109, PETRI_TRANSITIONS=89} [2025-03-17 14:17:06,087 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -21 predicate places. [2025-03-17 14:17:06,087 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 89 transitions, 255 flow [2025-03-17 14:17:06,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 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 14:17:06,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:06,088 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:06,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:17:06,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:06,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:06,089 INFO L85 PathProgramCache]: Analyzing trace with hash -962330064, now seen corresponding path program 1 times [2025-03-17 14:17:06,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:06,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111800416] [2025-03-17 14:17:06,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:06,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:06,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:17:06,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:17:06,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:06,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 14:17:06,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:06,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111800416] [2025-03-17 14:17:06,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111800416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:06,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:06,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:17:06,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43628292] [2025-03-17 14:17:06,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:06,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:17:06,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:06,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:17:06,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:17:06,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 128 [2025-03-17 14:17:06,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 89 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 64.71428571428571) internal successors, (453), 7 states have internal predecessors, (453), 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 14:17:06,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:06,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 128 [2025-03-17 14:17:06,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:06,826 INFO L124 PetriNetUnfolderBase]: 64/276 cut-off events. [2025-03-17 14:17:06,826 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-17 14:17:06,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 276 events. 64/276 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1111 event pairs, 54 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 506. Up to 130 conditions per place. [2025-03-17 14:17:06,828 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 48 selfloop transitions, 17 changer transitions 3/96 dead transitions. [2025-03-17 14:17:06,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 96 transitions, 405 flow [2025-03-17 14:17:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:17:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:17:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 556 transitions. [2025-03-17 14:17:06,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54296875 [2025-03-17 14:17:06,829 INFO L175 Difference]: Start difference. First operand has 109 places, 89 transitions, 255 flow. Second operand 8 states and 556 transitions. [2025-03-17 14:17:06,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 96 transitions, 405 flow [2025-03-17 14:17:06,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 96 transitions, 377 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:17:06,831 INFO L231 Difference]: Finished difference. Result has 108 places, 87 transitions, 257 flow [2025-03-17 14:17:06,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=257, PETRI_PLACES=108, PETRI_TRANSITIONS=87} [2025-03-17 14:17:06,832 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -22 predicate places. [2025-03-17 14:17:06,832 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 87 transitions, 257 flow [2025-03-17 14:17:06,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 64.71428571428571) internal successors, (453), 7 states have internal predecessors, (453), 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 14:17:06,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:06,832 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:06,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:17:06,833 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:06,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:06,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1381198843, now seen corresponding path program 1 times [2025-03-17 14:17:06,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:06,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95145711] [2025-03-17 14:17:06,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:06,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:17:06,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:17:06,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:06,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 14:17:06,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:06,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95145711] [2025-03-17 14:17:06,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95145711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:06,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:06,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:06,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762576234] [2025-03-17 14:17:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:06,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:06,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:06,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:06,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:07,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 128 [2025-03-17 14:17:07,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 87 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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 14:17:07,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:07,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 128 [2025-03-17 14:17:07,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:07,218 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2025-03-17 14:17:07,218 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-17 14:17:07,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 275 events. 64/275 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1113 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 505. Up to 170 conditions per place. [2025-03-17 14:17:07,219 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 45 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2025-03-17 14:17:07,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 86 transitions, 367 flow [2025-03-17 14:17:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2025-03-17 14:17:07,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6203125 [2025-03-17 14:17:07,223 INFO L175 Difference]: Start difference. First operand has 108 places, 87 transitions, 257 flow. Second operand 5 states and 397 transitions. [2025-03-17 14:17:07,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 86 transitions, 367 flow [2025-03-17 14:17:07,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 86 transitions, 333 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 14:17:07,225 INFO L231 Difference]: Finished difference. Result has 104 places, 86 transitions, 243 flow [2025-03-17 14:17:07,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=104, PETRI_TRANSITIONS=86} [2025-03-17 14:17:07,226 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -26 predicate places. [2025-03-17 14:17:07,226 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 243 flow [2025-03-17 14:17:07,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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 14:17:07,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:07,226 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:07,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:17:07,226 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:07,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:07,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1381198842, now seen corresponding path program 1 times [2025-03-17 14:17:07,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:07,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881368832] [2025-03-17 14:17:07,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:07,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:07,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:17:07,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:17:07,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:07,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 14:17:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881368832] [2025-03-17 14:17:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881368832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:07,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951477442] [2025-03-17 14:17:07,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:07,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:07,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:07,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:07,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:07,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2025-03-17 14:17:07,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 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 14:17:07,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:07,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2025-03-17 14:17:07,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:07,710 INFO L124 PetriNetUnfolderBase]: 64/274 cut-off events. [2025-03-17 14:17:07,710 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-17 14:17:07,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 274 events. 64/274 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1110 event pairs, 63 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 484. Up to 170 conditions per place. [2025-03-17 14:17:07,711 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 40 selfloop transitions, 11 changer transitions 0/85 dead transitions. [2025-03-17 14:17:07,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 85 transitions, 343 flow [2025-03-17 14:17:07,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:17:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:17:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2025-03-17 14:17:07,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515625 [2025-03-17 14:17:07,714 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 243 flow. Second operand 5 states and 417 transitions. [2025-03-17 14:17:07,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 85 transitions, 343 flow [2025-03-17 14:17:07,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 85 transitions, 321 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:17:07,715 INFO L231 Difference]: Finished difference. Result has 103 places, 85 transitions, 241 flow [2025-03-17 14:17:07,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=103, PETRI_TRANSITIONS=85} [2025-03-17 14:17:07,716 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -27 predicate places. [2025-03-17 14:17:07,716 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 241 flow [2025-03-17 14:17:07,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 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 14:17:07,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:07,716 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 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 14:17:07,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:17:07,716 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:17:07,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash 520718842, now seen corresponding path program 1 times [2025-03-17 14:17:07,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:07,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14596742] [2025-03-17 14:17:07,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:07,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:17:07,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:17:07,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:07,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:08,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:08,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14596742] [2025-03-17 14:17:08,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14596742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:08,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069548614] [2025-03-17 14:17:08,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:08,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:08,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:08,661 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 14:17:08,664 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 14:17:08,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:17:08,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:17:08,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:08,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:08,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-17 14:17:08,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:08,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 14:17:08,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 14:17:08,933 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-17 14:17:08,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 19 [2025-03-17 14:17:08,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2025-03-17 14:17:08,943 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 23 treesize of output 1 [2025-03-17 14:17:08,945 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 15 treesize of output 11 [2025-03-17 14:17:09,040 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-03-17 14:17:09,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 14:17:09,054 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-03-17 14:17:09,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 14:17:09,160 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-17 14:17:09,160 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 1 case distinctions, treesize of input 27 treesize of output 26 [2025-03-17 14:17:09,190 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-17 14:17:09,191 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 1 case distinctions, treesize of input 50 treesize of output 26 [2025-03-17 14:17:09,212 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2025-03-17 14:17:09,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2025-03-17 14:17:09,224 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-17 14:17:09,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2025-03-17 14:17:09,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:09,482 INFO L349 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2025-03-17 14:17:09,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 38 [2025-03-17 14:17:09,494 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-17 14:17:09,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 19 [2025-03-17 14:17:13,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:13,367 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 50 treesize of output 26 [2025-03-17 14:17:13,374 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 14:17:13,374 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 23 treesize of output 7 [2025-03-17 14:17:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:13,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:13,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:13,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2025-03-17 14:17:14,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:14,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 115 [2025-03-17 14:17:14,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 101 treesize of output 99 [2025-03-17 14:17:14,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 129 treesize of output 123 [2025-03-17 14:17:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:17:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069548614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:14,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:14,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 39 [2025-03-17 14:17:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552055436] [2025-03-17 14:17:14,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:14,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 14:17:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:14,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 14:17:14,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1336, Unknown=5, NotChecked=0, Total=1560 [2025-03-17 14:17:17,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:17:28,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:17:36,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:17:52,679 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 14:18:01,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 128 [2025-03-17 14:18:01,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 241 flow. Second operand has 40 states, 40 states have (on average 39.4) internal successors, (1576), 40 states have internal predecessors, (1576), 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 14:18:01,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:01,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 128 [2025-03-17 14:18:01,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:02,029 INFO L124 PetriNetUnfolderBase]: 97/332 cut-off events. [2025-03-17 14:18:02,029 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-17 14:18:02,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 332 events. 97/332 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1420 event pairs, 84 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 616. Up to 191 conditions per place. [2025-03-17 14:18:02,031 INFO L140 encePairwiseOnDemand]: 107/128 looper letters, 50 selfloop transitions, 18 changer transitions 3/94 dead transitions. [2025-03-17 14:18:02,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 94 transitions, 401 flow [2025-03-17 14:18:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:18:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-17 14:18:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 672 transitions. [2025-03-17 14:18:02,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.328125 [2025-03-17 14:18:02,033 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 241 flow. Second operand 16 states and 672 transitions. [2025-03-17 14:18:02,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 94 transitions, 401 flow [2025-03-17 14:18:02,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 94 transitions, 379 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:18:02,035 INFO L231 Difference]: Finished difference. Result has 111 places, 82 transitions, 249 flow [2025-03-17 14:18:02,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=249, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2025-03-17 14:18:02,036 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -19 predicate places. [2025-03-17 14:18:02,036 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 249 flow [2025-03-17 14:18:02,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 39.4) internal successors, (1576), 40 states have internal predecessors, (1576), 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 14:18:02,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:02,038 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 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 14:18:02,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:18:02,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:18:02,242 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:18:02,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2100344287, now seen corresponding path program 1 times [2025-03-17 14:18:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:02,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298726868] [2025-03-17 14:18:02,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:02,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 14:18:02,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 14:18:02,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:02,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-17 14:18:02,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:02,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298726868] [2025-03-17 14:18:02,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298726868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:02,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:02,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:18:02,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527337420] [2025-03-17 14:18:02,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:02,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:18:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:02,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:18:02,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:18:02,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 128 [2025-03-17 14:18:02,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 82 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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 14:18:02,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:02,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 128 [2025-03-17 14:18:02,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:02,734 INFO L124 PetriNetUnfolderBase]: 73/276 cut-off events. [2025-03-17 14:18:02,734 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-17 14:18:02,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 276 events. 73/276 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1087 event pairs, 18 based on Foata normal form. 2/243 useless extension candidates. Maximal degree in co-relation 519. Up to 135 conditions per place. [2025-03-17 14:18:02,736 INFO L140 encePairwiseOnDemand]: 111/128 looper letters, 44 selfloop transitions, 15 changer transitions 0/89 dead transitions. [2025-03-17 14:18:02,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 89 transitions, 381 flow [2025-03-17 14:18:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:18:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:18:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2025-03-17 14:18:02,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6578125 [2025-03-17 14:18:02,738 INFO L175 Difference]: Start difference. First operand has 111 places, 82 transitions, 249 flow. Second operand 5 states and 421 transitions. [2025-03-17 14:18:02,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 89 transitions, 381 flow [2025-03-17 14:18:02,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 345 flow, removed 0 selfloop flow, removed 15 redundant places. [2025-03-17 14:18:02,740 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 239 flow [2025-03-17 14:18:02,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2025-03-17 14:18:02,741 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -32 predicate places. [2025-03-17 14:18:02,741 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 239 flow [2025-03-17 14:18:02,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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 14:18:02,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:02,741 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 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 14:18:02,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:18:02,741 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:18:02,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2100344288, now seen corresponding path program 1 times [2025-03-17 14:18:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:02,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479588979] [2025-03-17 14:18:02,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:02,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 14:18:02,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 14:18:02,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:02,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-17 14:18:02,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:02,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479588979] [2025-03-17 14:18:02,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479588979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:02,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:02,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:18:02,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363465235] [2025-03-17 14:18:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:02,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:18:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:02,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:18:02,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:18:03,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 128 [2025-03-17 14:18:03,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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 14:18:03,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:03,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 128 [2025-03-17 14:18:03,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:03,156 INFO L124 PetriNetUnfolderBase]: 73/285 cut-off events. [2025-03-17 14:18:03,156 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-17 14:18:03,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 285 events. 73/285 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1169 event pairs, 45 based on Foata normal form. 2/244 useless extension candidates. Maximal degree in co-relation 530. Up to 108 conditions per place. [2025-03-17 14:18:03,157 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 47 selfloop transitions, 17 changer transitions 0/87 dead transitions. [2025-03-17 14:18:03,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 87 transitions, 381 flow [2025-03-17 14:18:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:18:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:18:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2025-03-17 14:18:03,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6265625 [2025-03-17 14:18:03,158 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 239 flow. Second operand 5 states and 401 transitions. [2025-03-17 14:18:03,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 87 transitions, 381 flow [2025-03-17 14:18:03,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 351 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:18:03,161 INFO L231 Difference]: Finished difference. Result has 96 places, 78 transitions, 239 flow [2025-03-17 14:18:03,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=96, PETRI_TRANSITIONS=78} [2025-03-17 14:18:03,161 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -34 predicate places. [2025-03-17 14:18:03,161 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 78 transitions, 239 flow [2025-03-17 14:18:03,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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 14:18:03,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:03,162 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:03,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:18:03,162 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:18:03,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:03,162 INFO L85 PathProgramCache]: Analyzing trace with hash -419175934, now seen corresponding path program 1 times [2025-03-17 14:18:03,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:03,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203001391] [2025-03-17 14:18:03,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:03,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:03,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 14:18:03,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:18:03,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:03,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 14:18:03,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:03,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203001391] [2025-03-17 14:18:03,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203001391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:03,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:03,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:18:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446417835] [2025-03-17 14:18:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:03,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:18:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:03,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:18:03,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:18:03,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 128 [2025-03-17 14:18:03,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 78 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 14:18:03,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:03,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 128 [2025-03-17 14:18:03,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:03,418 INFO L124 PetriNetUnfolderBase]: 71/277 cut-off events. [2025-03-17 14:18:03,418 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-03-17 14:18:03,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 277 events. 71/277 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1130 event pairs, 56 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 536. Up to 161 conditions per place. [2025-03-17 14:18:03,420 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 55 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-03-17 14:18:03,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 83 transitions, 369 flow [2025-03-17 14:18:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:18:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:18:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-03-17 14:18:03,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7994791666666666 [2025-03-17 14:18:03,421 INFO L175 Difference]: Start difference. First operand has 96 places, 78 transitions, 239 flow. Second operand 3 states and 307 transitions. [2025-03-17 14:18:03,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 83 transitions, 369 flow [2025-03-17 14:18:03,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:18:03,423 INFO L231 Difference]: Finished difference. Result has 92 places, 76 transitions, 205 flow [2025-03-17 14:18:03,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=92, PETRI_TRANSITIONS=76} [2025-03-17 14:18:03,423 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -38 predicate places. [2025-03-17 14:18:03,423 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 76 transitions, 205 flow [2025-03-17 14:18:03,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 14:18:03,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:03,424 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:03,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:18:03,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:18:03,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash -419175933, now seen corresponding path program 1 times [2025-03-17 14:18:03,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:03,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214842449] [2025-03-17 14:18:03,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:03,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:03,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 14:18:03,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:18:03,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:03,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 14:18:03,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:03,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214842449] [2025-03-17 14:18:03,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214842449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:03,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:03,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:18:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114132453] [2025-03-17 14:18:03,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:03,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:18:03,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:03,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:18:03,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:18:03,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 128 [2025-03-17 14:18:03,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 76 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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 14:18:03,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:03,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 128 [2025-03-17 14:18:03,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:03,694 INFO L124 PetriNetUnfolderBase]: 64/254 cut-off events. [2025-03-17 14:18:03,694 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-17 14:18:03,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 254 events. 64/254 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 965 event pairs, 56 based on Foata normal form. 16/244 useless extension candidates. Maximal degree in co-relation 467. Up to 161 conditions per place. [2025-03-17 14:18:03,695 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 54 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2025-03-17 14:18:03,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 81 transitions, 327 flow [2025-03-17 14:18:03,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:18:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:18:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2025-03-17 14:18:03,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046875 [2025-03-17 14:18:03,696 INFO L175 Difference]: Start difference. First operand has 92 places, 76 transitions, 205 flow. Second operand 3 states and 309 transitions. [2025-03-17 14:18:03,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 81 transitions, 327 flow [2025-03-17 14:18:03,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 81 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:18:03,697 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 201 flow [2025-03-17 14:18:03,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2025-03-17 14:18:03,698 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -40 predicate places. [2025-03-17 14:18:03,698 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 201 flow [2025-03-17 14:18:03,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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 14:18:03,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:03,698 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:03,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 14:18:03,698 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:18:03,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:03,698 INFO L85 PathProgramCache]: Analyzing trace with hash -217087031, now seen corresponding path program 1 times [2025-03-17 14:18:03,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:03,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111155794] [2025-03-17 14:18:03,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:03,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:03,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 14:18:03,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 14:18:03,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:03,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-17 14:18:03,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111155794] [2025-03-17 14:18:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111155794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:03,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:03,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:18:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692642420] [2025-03-17 14:18:03,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:03,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:18:03,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:03,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:18:03,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:18:04,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2025-03-17 14:18:04,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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 14:18:04,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:04,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2025-03-17 14:18:04,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:04,317 INFO L124 PetriNetUnfolderBase]: 79/303 cut-off events. [2025-03-17 14:18:04,317 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-17 14:18:04,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 303 events. 79/303 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1281 event pairs, 30 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 555. Up to 163 conditions per place. [2025-03-17 14:18:04,319 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 58 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2025-03-17 14:18:04,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 371 flow [2025-03-17 14:18:04,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:18:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:18:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2025-03-17 14:18:04,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2025-03-17 14:18:04,320 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 201 flow. Second operand 6 states and 510 transitions. [2025-03-17 14:18:04,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 371 flow [2025-03-17 14:18:04,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:18:04,321 INFO L231 Difference]: Finished difference. Result has 95 places, 79 transitions, 247 flow [2025-03-17 14:18:04,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2025-03-17 14:18:04,322 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -35 predicate places. [2025-03-17 14:18:04,322 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 247 flow [2025-03-17 14:18:04,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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 14:18:04,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:04,322 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:04,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 14:18:04,323 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:18:04,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash -217087032, now seen corresponding path program 1 times [2025-03-17 14:18:04,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:04,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448747462] [2025-03-17 14:18:04,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:04,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 14:18:04,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 14:18:04,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:04,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-17 14:18:04,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:04,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448747462] [2025-03-17 14:18:04,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448747462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:18:04,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:18:04,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:18:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689731265] [2025-03-17 14:18:04,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:18:04,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:18:04,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:04,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:18:04,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:18:04,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2025-03-17 14:18:04,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 79 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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 14:18:04,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:04,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2025-03-17 14:18:04,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:04,877 INFO L124 PetriNetUnfolderBase]: 73/268 cut-off events. [2025-03-17 14:18:04,877 INFO L125 PetriNetUnfolderBase]: For 70/72 co-relation queries the response was YES. [2025-03-17 14:18:04,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 268 events. 73/268 cut-off events. For 70/72 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1001 event pairs, 47 based on Foata normal form. 10/255 useless extension candidates. Maximal degree in co-relation 557. Up to 131 conditions per place. [2025-03-17 14:18:04,878 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 59 selfloop transitions, 13 changer transitions 3/94 dead transitions. [2025-03-17 14:18:04,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 427 flow [2025-03-17 14:18:04,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:18:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:18:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2025-03-17 14:18:04,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66796875 [2025-03-17 14:18:04,882 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 247 flow. Second operand 6 states and 513 transitions. [2025-03-17 14:18:04,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 427 flow [2025-03-17 14:18:04,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:18:04,884 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 263 flow [2025-03-17 14:18:04,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2025-03-17 14:18:04,884 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -33 predicate places. [2025-03-17 14:18:04,884 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 263 flow [2025-03-17 14:18:04,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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 14:18:04,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:04,884 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:04,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 14:18:04,885 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:18:04,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash 898876995, now seen corresponding path program 1 times [2025-03-17 14:18:04,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:04,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008620446] [2025-03-17 14:18:04,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:04,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:04,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:18:04,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:18:04,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:04,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 14:18:05,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:05,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008620446] [2025-03-17 14:18:05,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008620446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:18:05,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420250386] [2025-03-17 14:18:05,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:05,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:18:05,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:18:05,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:18:05,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:18:05,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:18:05,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:18:05,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:05,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:05,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 14:18:05,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:18:05,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:05,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:18:05,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:05,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:18:05,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:05,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:18:05,821 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:18:05,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-03-17 14:18:05,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:18:05,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:05,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:18:05,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:05,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-17 14:18:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 14:18:05,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:18:06,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:06,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2025-03-17 14:18:06,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:06,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2025-03-17 14:18:06,237 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:18:06,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2025-03-17 14:18:06,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:06,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2025-03-17 14:18:06,321 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:18:06,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2025-03-17 14:18:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 14:18:06,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420250386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:18:06,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:18:06,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 4] total 18 [2025-03-17 14:18:06,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760169314] [2025-03-17 14:18:06,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:18:06,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:18:06,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:06,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:18:06,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:18:08,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 128 [2025-03-17 14:18:08,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 263 flow. Second operand has 20 states, 20 states have (on average 61.5) internal successors, (1230), 20 states have internal predecessors, (1230), 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 14:18:08,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:08,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 128 [2025-03-17 14:18:08,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:09,034 INFO L124 PetriNetUnfolderBase]: 73/264 cut-off events. [2025-03-17 14:18:09,034 INFO L125 PetriNetUnfolderBase]: For 126/130 co-relation queries the response was YES. [2025-03-17 14:18:09,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 264 events. 73/264 cut-off events. For 126/130 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 995 event pairs, 39 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 581. Up to 153 conditions per place. [2025-03-17 14:18:09,035 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 49 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2025-03-17 14:18:09,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 85 transitions, 428 flow [2025-03-17 14:18:09,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:18:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:18:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 509 transitions. [2025-03-17 14:18:09,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4970703125 [2025-03-17 14:18:09,036 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 263 flow. Second operand 8 states and 509 transitions. [2025-03-17 14:18:09,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 85 transitions, 428 flow [2025-03-17 14:18:09,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 85 transitions, 396 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:18:09,038 INFO L231 Difference]: Finished difference. Result has 98 places, 77 transitions, 271 flow [2025-03-17 14:18:09,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=271, PETRI_PLACES=98, PETRI_TRANSITIONS=77} [2025-03-17 14:18:09,038 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -32 predicate places. [2025-03-17 14:18:09,038 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 77 transitions, 271 flow [2025-03-17 14:18:09,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 61.5) internal successors, (1230), 20 states have internal predecessors, (1230), 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 14:18:09,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:09,039 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:09,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:18:09,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:18:09,243 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:18:09,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1860237418, now seen corresponding path program 1 times [2025-03-17 14:18:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360908670] [2025-03-17 14:18:09,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:09,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:18:09,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:18:09,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:09,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:18:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:11,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360908670] [2025-03-17 14:18:11,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360908670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:18:11,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848731954] [2025-03-17 14:18:11,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:11,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:18:11,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:18:11,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:18:11,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:18:12,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:18:12,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:18:12,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:12,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:12,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-17 14:18:12,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:18:12,253 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 23 treesize of output 1 [2025-03-17 14:18:12,323 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2025-03-17 14:18:12,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2025-03-17 14:18:12,378 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 23 treesize of output 1 [2025-03-17 14:18:12,387 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-17 14:18:12,387 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 1 case distinctions, treesize of input 57 treesize of output 33 [2025-03-17 14:18:12,396 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:18:12,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 14:18:12,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-17 14:18:12,738 INFO L349 Elim1Store]: treesize reduction 65, result has 55.2 percent of original size [2025-03-17 14:18:12,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 161 [2025-03-17 14:18:12,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-03-17 14:18:12,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-03-17 14:18:13,040 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-03-17 14:18:13,040 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 95 [2025-03-17 14:18:13,045 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 78 treesize of output 29 [2025-03-17 14:18:13,241 INFO L349 Elim1Store]: treesize reduction 75, result has 25.0 percent of original size [2025-03-17 14:18:13,241 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 1 case distinctions, treesize of input 201 treesize of output 134 [2025-03-17 14:18:13,260 INFO L349 Elim1Store]: treesize reduction 75, result has 25.0 percent of original size [2025-03-17 14:18:13,260 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 1 case distinctions, treesize of input 39 treesize of output 38 [2025-03-17 14:18:13,343 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-03-17 14:18:13,344 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 1 case distinctions, treesize of input 166 treesize of output 121 [2025-03-17 14:18:13,347 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 78 treesize of output 29 [2025-03-17 14:18:13,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 98 treesize of output 58 [2025-03-17 14:18:13,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 66 treesize of output 34 [2025-03-17 14:18:13,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 13 [2025-03-17 14:18:13,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2025-03-17 14:18:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 14:18:13,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:18:13,606 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#slot~0.base|) .cse2) 4))) (and (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2650) .cse0) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2649) .cse0) .cse1)))) (forall ((v_ArrVal_2650 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2650) .cse0) .cse1)))))) is different from false [2025-03-17 14:18:13,614 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) (.cse3 (+ 4 |c_ULTIMATE.start_list_add_~list#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~list#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~list#1.base|) .cse3 |c_ULTIMATE.start_list_add_~node#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) .cse4)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#slot~0.base|) .cse4) 4))) (and (forall ((v_ArrVal_2650 (Array Int Int))) (<= 0 (select (select (store .cse0 |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2650) .cse1) .cse2))) (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2650) .cse1) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~list#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~list#1.base|) .cse3 |c_ULTIMATE.start_list_add_~node#1.base|)) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2649) .cse1) .cse2))))))) is different from false [2025-03-17 14:18:13,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_~#slot~0.base|)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|)) (.cse10 (+ |c_~#slot~0.offset| (* 4 |c_ULTIMATE.start_main_~k~0#1|)))) (let ((.cse1 (select .cse9 .cse10)) (.cse2 (+ (select .cse7 .cse10) 4)) (.cse3 (select .cse9 .cse8)) (.cse4 (+ (select .cse7 .cse8) 4))) (and (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2646 (Array Int Int)) (v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (<= (+ (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2645))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_main_~p~1#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2650) .cse3) .cse4) 4) (select |c_#length| (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2646))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2649) .cse3) .cse4)))) (forall ((v_ArrVal_2645 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (<= 0 (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2645))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_main_~p~1#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2650) .cse3) .cse4)))))) is different from false [2025-03-17 14:18:13,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:13,750 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2025-03-17 14:18:13,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:13,756 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 148 [2025-03-17 14:18:13,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:13,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3944 treesize of output 3918 [2025-03-17 14:18:13,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:13,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110064 treesize of output 106918 [2025-03-17 14:18:13,860 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 1240 treesize of output 1192 [2025-03-17 14:18:13,870 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 1336 treesize of output 1264 [2025-03-17 14:18:13,880 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 1068 treesize of output 972 [2025-03-17 14:18:13,890 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 972 treesize of output 876 [2025-03-17 14:18:13,949 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 14:18:13,966 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 14:18:14,166 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 14:18:14,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:14,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1114 treesize of output 1062 [2025-03-17 14:18:14,706 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 14:18:14,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:14,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 236 treesize of output 224 [2025-03-17 14:18:14,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:14,825 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 79 [2025-03-17 14:18:14,828 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 14:18:14,850 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-03-17 14:18:14,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 484 treesize of output 482 [2025-03-17 14:18:14,860 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 482 treesize of output 434 [2025-03-17 14:18:14,871 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 14:18:14,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:14,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 143 treesize of output 131 [2025-03-17 14:18:15,655 INFO L349 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2025-03-17 14:18:15,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 171 [2025-03-17 14:18:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 2 not checked. [2025-03-17 14:18:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848731954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:18:15,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:18:15,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 19] total 65 [2025-03-17 14:18:15,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692309513] [2025-03-17 14:18:15,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:18:15,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-17 14:18:15,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:15,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-17 14:18:15,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=3619, Unknown=12, NotChecked=372, Total=4290 [2025-03-17 14:18:16,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 128 [2025-03-17 14:18:16,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 77 transitions, 271 flow. Second operand has 66 states, 66 states have (on average 3.6818181818181817) internal successors, (243), 66 states have internal predecessors, (243), 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 14:18:16,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:16,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 128 [2025-03-17 14:18:16,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:20,934 INFO L124 PetriNetUnfolderBase]: 276/630 cut-off events. [2025-03-17 14:18:20,934 INFO L125 PetriNetUnfolderBase]: For 123/125 co-relation queries the response was YES. [2025-03-17 14:18:20,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 630 events. 276/630 cut-off events. For 123/125 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2810 event pairs, 32 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 1421. Up to 154 conditions per place. [2025-03-17 14:18:20,936 INFO L140 encePairwiseOnDemand]: 100/128 looper letters, 119 selfloop transitions, 37 changer transitions 3/160 dead transitions. [2025-03-17 14:18:20,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 160 transitions, 779 flow [2025-03-17 14:18:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 14:18:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-17 14:18:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 206 transitions. [2025-03-17 14:18:20,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.05549568965517242 [2025-03-17 14:18:20,939 INFO L175 Difference]: Start difference. First operand has 98 places, 77 transitions, 271 flow. Second operand 29 states and 206 transitions. [2025-03-17 14:18:20,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 160 transitions, 779 flow [2025-03-17 14:18:20,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 160 transitions, 740 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:18:20,941 INFO L231 Difference]: Finished difference. Result has 124 places, 88 transitions, 369 flow [2025-03-17 14:18:20,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=369, PETRI_PLACES=124, PETRI_TRANSITIONS=88} [2025-03-17 14:18:20,941 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2025-03-17 14:18:20,941 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 88 transitions, 369 flow [2025-03-17 14:18:20,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.6818181818181817) internal successors, (243), 66 states have internal predecessors, (243), 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 14:18:20,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:20,942 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:18:20,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:18:21,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 14:18:21,143 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2025-03-17 14:18:21,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1860237417, now seen corresponding path program 1 times [2025-03-17 14:18:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:21,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610234727] [2025-03-17 14:18:21,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:21,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:18:21,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:18:21,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:21,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 14:18:22,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:22,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610234727] [2025-03-17 14:18:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610234727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:18:22,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853022554] [2025-03-17 14:18:22,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:22,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:18:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:18:22,859 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:18:22,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:18:23,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:18:23,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:18:23,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:23,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:23,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-17 14:18:23,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:18:23,110 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 23 treesize of output 1 [2025-03-17 14:18:23,158 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-17 14:18:23,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 22 treesize of output 29 [2025-03-17 14:18:23,212 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-17 14:18:23,213 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 1 case distinctions, treesize of input 57 treesize of output 33 [2025-03-17 14:18:23,221 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:18:23,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 26 treesize of output 25 [2025-03-17 14:18:23,350 INFO L349 Elim1Store]: treesize reduction 65, result has 33.0 percent of original size [2025-03-17 14:18:23,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 56 [2025-03-17 14:18:23,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-03-17 14:18:23,485 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-03-17 14:18:23,486 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 63 [2025-03-17 14:18:23,580 INFO L349 Elim1Store]: treesize reduction 91, result has 21.6 percent of original size [2025-03-17 14:18:23,580 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 1 case distinctions, treesize of input 123 treesize of output 70 [2025-03-17 14:18:23,642 INFO L349 Elim1Store]: treesize reduction 112, result has 19.4 percent of original size [2025-03-17 14:18:23,642 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 121 [2025-03-17 14:18:23,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:23,736 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 138 treesize of output 82 [2025-03-17 14:18:23,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 71 treesize of output 39 [2025-03-17 14:18:23,790 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 14:18:23,790 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 56 treesize of output 20 [2025-03-17 14:18:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 14:18:23,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:18:23,833 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-17 14:18:23,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 36 [2025-03-17 14:18:25,660 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2965 (Array Int Int)) (|ULTIMATE.start_list_add_~list#1.offset| Int)) (= (let ((.cse0 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~list#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~list#1.base|) (+ |ULTIMATE.start_list_add_~list#1.offset| 4) |c_ULTIMATE.start_list_add_~node#1.base|)) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2965) (select (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#slot~0.base|) .cse0) 4))) |c_ULTIMATE.start_list_add_~node#1.base|)) is different from false