./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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_13-arraycollapse_nr-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 e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:13:39,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:13:39,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:13:39,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:13:39,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:13:39,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:13:39,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:13:39,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:13:39,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:13:39,400 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:13:39,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:13:39,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:13:39,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:13:39,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:13:39,401 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:13:39,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:13:39,402 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:13:39,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:13:39,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:13:39,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:13:39,402 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:13:39,402 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:13:39,402 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:13:39,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:13:39,402 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:13:39,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:13:39,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:13:39,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:13:39,403 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:13:39,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:13:39,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:13:39,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:13:39,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:13:39,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:39,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:13:39,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:13:39,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:13:39,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:13:39,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:13:39,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:13:39,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:13:39,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:13:39,404 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 -> e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 [2025-03-09 01:13:39,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:13:39,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:13:39,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:13:39,630 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:13:39,630 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:13:39,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2025-03-09 01:13:40,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bb16981/c3629d2e371445f987bab5bdf8232588/FLAG3a08449ca [2025-03-09 01:13:41,149 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:13:41,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2025-03-09 01:13:41,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bb16981/c3629d2e371445f987bab5bdf8232588/FLAG3a08449ca [2025-03-09 01:13:41,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bb16981/c3629d2e371445f987bab5bdf8232588 [2025-03-09 01:13:41,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:13:41,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:13:41,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:41,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:13:41,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:13:41,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337d037e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41, skipping insertion in model container [2025-03-09 01:13:41,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:13:41,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:41,541 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:13:41,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:41,650 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:13:41,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41 WrapperNode [2025-03-09 01:13:41,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:41,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:41,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:13:41,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:13:41,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,687 INFO L138 Inliner]: procedures = 372, calls = 100, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 257 [2025-03-09 01:13:41,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:41,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:13:41,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:13:41,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:13:41,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,720 INFO L175 MemorySlicer]: Split 99 memory accesses to 3 slices as follows [50, 18, 31]. 51 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 26 writes are split as follows [0, 2, 24]. [2025-03-09 01:13:41,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,744 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:13:41,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:13:41,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:13:41,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:13:41,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (1/1) ... [2025-03-09 01:13:41,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:41,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:41,778 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-09 01:13:41,780 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-09 01:13:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:13:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:13:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:13:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:13:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:13:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:13:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:13:41,799 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:13:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:13:41,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:13:41,800 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:13:41,918 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:13:41,919 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:13:42,446 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:13:42,446 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:13:42,714 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:13:42,714 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:13:42,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:42 BoogieIcfgContainer [2025-03-09 01:13:42,716 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:13:42,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:13:42,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:13:42,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:13:42,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:13:41" (1/3) ... [2025-03-09 01:13:42,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4979aca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:42, skipping insertion in model container [2025-03-09 01:13:42,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:41" (2/3) ... [2025-03-09 01:13:42,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4979aca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:42, skipping insertion in model container [2025-03-09 01:13:42,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:42" (3/3) ... [2025-03-09 01:13:42,722 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr-deref.i [2025-03-09 01:13:42,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:13:42,735 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr-deref.i that has 2 procedures, 134 locations, 1 initial locations, 1 loop locations, and 79 error locations. [2025-03-09 01:13:42,735 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:13:42,792 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:13:42,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 272 flow [2025-03-09 01:13:42,892 INFO L124 PetriNetUnfolderBase]: 1/133 cut-off events. [2025-03-09 01:13:42,895 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:42,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 1/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 269 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2025-03-09 01:13:42,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 134 transitions, 272 flow [2025-03-09 01:13:42,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 269 flow [2025-03-09 01:13:42,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:13:42,917 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;@4473ef30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:13:42,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-03-09 01:13:42,921 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:13:42,922 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:13:42,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:42,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:42,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:13:42,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:42,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash 809813, now seen corresponding path program 1 times [2025-03-09 01:13:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:42,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711591567] [2025-03-09 01:13:42,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:43,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:13:43,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:13:43,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:43,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:43,166 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-09 01:13:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:43,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711591567] [2025-03-09 01:13:43,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711591567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:43,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:43,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623799235] [2025-03-09 01:13:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:43,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:43,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:43,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:43,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-03-09 01:13:43,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-09 01:13:43,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:43,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-03-09 01:13:43,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:43,405 INFO L124 PetriNetUnfolderBase]: 64/330 cut-off events. [2025-03-09 01:13:43,406 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:43,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 330 events. 64/330 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1330 event pairs, 63 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 377. Up to 167 conditions per place. [2025-03-09 01:13:43,408 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-03-09 01:13:43,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 353 flow [2025-03-09 01:13:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-03-09 01:13:43,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8059701492537313 [2025-03-09 01:13:43,419 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 269 flow. Second operand 3 states and 324 transitions. [2025-03-09 01:13:43,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 353 flow [2025-03-09 01:13:43,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:43,425 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 280 flow [2025-03-09 01:13:43,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2025-03-09 01:13:43,430 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2025-03-09 01:13:43,430 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 280 flow [2025-03-09 01:13:43,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-09 01:13:43,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:43,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:13:43,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:13:43,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:43,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash 25101010, now seen corresponding path program 1 times [2025-03-09 01:13:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:43,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806377740] [2025-03-09 01:13:43,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:43,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:43,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:13:43,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:13:43,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:43,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:43,562 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-09 01:13:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:43,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806377740] [2025-03-09 01:13:43,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806377740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:43,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425145259] [2025-03-09 01:13:43,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:43,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:43,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:43,564 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-09 01:13:43,566 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-09 01:13:43,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:13:43,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:13:43,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:43,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:43,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:13:43,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:43,690 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-09 01:13:43,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:43,706 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-09 01:13:43,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425145259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:43,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:43,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:13:43,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557474384] [2025-03-09 01:13:43,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:43,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:43,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:43,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:43,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-03-09 01:13:43,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-09 01:13:43,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:43,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-03-09 01:13:43,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:43,913 INFO L124 PetriNetUnfolderBase]: 64/333 cut-off events. [2025-03-09 01:13:43,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:43,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 333 events. 64/333 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1324 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 506. Up to 167 conditions per place. [2025-03-09 01:13:43,917 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-09 01:13:43,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 380 flow [2025-03-09 01:13:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:13:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:13:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2025-03-09 01:13:43,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599502487562189 [2025-03-09 01:13:43,921 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 280 flow. Second operand 6 states and 611 transitions. [2025-03-09 01:13:43,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 380 flow [2025-03-09 01:13:43,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 137 transitions, 376 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:43,926 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 312 flow [2025-03-09 01:13:43,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2025-03-09 01:13:43,927 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 9 predicate places. [2025-03-09 01:13:43,928 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 312 flow [2025-03-09 01:13:43,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-09 01:13:43,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:43,929 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-03-09 01:13:43,936 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-09 01:13:44,133 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-09 01:13:44,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:44,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:44,134 INFO L85 PathProgramCache]: Analyzing trace with hash 456708757, now seen corresponding path program 2 times [2025-03-09 01:13:44,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:44,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941692206] [2025-03-09 01:13:44,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:44,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:44,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-09 01:13:44,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 7 statements. [2025-03-09 01:13:44,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:13:44,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:44,225 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-09 01:13:44,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:44,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941692206] [2025-03-09 01:13:44,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941692206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:44,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:44,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:44,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425045045] [2025-03-09 01:13:44,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:44,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:44,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:44,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:44,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:44,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2025-03-09 01:13:44,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-09 01:13:44,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:44,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2025-03-09 01:13:44,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:44,450 INFO L124 PetriNetUnfolderBase]: 64/321 cut-off events. [2025-03-09 01:13:44,451 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:13:44,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 321 events. 64/321 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1277 event pairs, 63 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 491. Up to 165 conditions per place. [2025-03-09 01:13:44,455 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2025-03-09 01:13:44,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 388 flow [2025-03-09 01:13:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-03-09 01:13:44,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2025-03-09 01:13:44,458 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 312 flow. Second operand 3 states and 286 transitions. [2025-03-09 01:13:44,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 388 flow [2025-03-09 01:13:44,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 374 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:44,461 INFO L231 Difference]: Finished difference. Result has 134 places, 125 transitions, 298 flow [2025-03-09 01:13:44,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=134, PETRI_TRANSITIONS=125} [2025-03-09 01:13:44,462 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-03-09 01:13:44,462 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 298 flow [2025-03-09 01:13:44,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-09 01:13:44,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:44,462 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-03-09 01:13:44,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:13:44,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:44,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash 456708758, now seen corresponding path program 1 times [2025-03-09 01:13:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867654550] [2025-03-09 01:13:44,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:44,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:13:44,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:13:44,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:44,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:44,602 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-09 01:13:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867654550] [2025-03-09 01:13:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867654550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368349920] [2025-03-09 01:13:44,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:44,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:44,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:44,605 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-09 01:13:44,607 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-09 01:13:44,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:13:44,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:13:44,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:44,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:44,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:13:44,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:44,702 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-09 01:13:44,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:44,753 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-09 01:13:44,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368349920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:44,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:44,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 01:13:44,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756882166] [2025-03-09 01:13:44,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:44,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:13:44,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:44,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:13:44,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:13:44,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-03-09 01:13:44,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 125 transitions, 298 flow. Second operand has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 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-09 01:13:44,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:44,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-03-09 01:13:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:44,884 INFO L124 PetriNetUnfolderBase]: 64/327 cut-off events. [2025-03-09 01:13:44,885 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-09 01:13:44,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 327 events. 64/327 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1281 event pairs, 63 based on Foata normal form. 6/256 useless extension candidates. Maximal degree in co-relation 497. Up to 167 conditions per place. [2025-03-09 01:13:44,888 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 11 changer transitions 0/131 dead transitions. [2025-03-09 01:13:44,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 131 transitions, 434 flow [2025-03-09 01:13:44,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:13:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:13:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1184 transitions. [2025-03-09 01:13:44,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2025-03-09 01:13:44,893 INFO L175 Difference]: Start difference. First operand has 134 places, 125 transitions, 298 flow. Second operand 12 states and 1184 transitions. [2025-03-09 01:13:44,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 131 transitions, 434 flow [2025-03-09 01:13:44,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 131 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:44,898 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 358 flow [2025-03-09 01:13:44,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=358, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2025-03-09 01:13:44,899 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 13 predicate places. [2025-03-09 01:13:44,899 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 358 flow [2025-03-09 01:13:44,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 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-09 01:13:44,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:44,903 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2025-03-09 01:13:44,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:13:45,103 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-09 01:13:45,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:45,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2039675254, now seen corresponding path program 2 times [2025-03-09 01:13:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:45,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357007077] [2025-03-09 01:13:45,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:45,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:45,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:13:45,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 13 statements. [2025-03-09 01:13:45,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:13:45,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:45,191 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-09 01:13:45,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:45,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357007077] [2025-03-09 01:13:45,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357007077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:45,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:45,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:45,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292924865] [2025-03-09 01:13:45,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:45,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:45,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:45,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:45,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:45,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2025-03-09 01:13:45,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 131 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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-09 01:13:45,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:45,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2025-03-09 01:13:45,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:45,394 INFO L124 PetriNetUnfolderBase]: 64/315 cut-off events. [2025-03-09 01:13:45,394 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-09 01:13:45,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 315 events. 64/315 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1237 event pairs, 63 based on Foata normal form. 6/250 useless extension candidates. Maximal degree in co-relation 479. Up to 171 conditions per place. [2025-03-09 01:13:45,396 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2025-03-09 01:13:45,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 119 transitions, 434 flow [2025-03-09 01:13:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-03-09 01:13:45,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2025-03-09 01:13:45,398 INFO L175 Difference]: Start difference. First operand has 149 places, 131 transitions, 358 flow. Second operand 3 states and 298 transitions. [2025-03-09 01:13:45,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 119 transitions, 434 flow [2025-03-09 01:13:45,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 386 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-09 01:13:45,403 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 310 flow [2025-03-09 01:13:45,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2025-03-09 01:13:45,404 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-03-09 01:13:45,404 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 310 flow [2025-03-09 01:13:45,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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-09 01:13:45,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:45,404 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-09 01:13:45,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:13:45,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:45,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1622852575, now seen corresponding path program 1 times [2025-03-09 01:13:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698375729] [2025-03-09 01:13:45,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:45,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:45,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:13:45,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:13:45,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:45,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:45,605 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-09 01:13:45,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698375729] [2025-03-09 01:13:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698375729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:45,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:45,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:45,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304492954] [2025-03-09 01:13:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:45,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:13:45,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:45,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:13:45,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:13:45,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 134 [2025-03-09 01:13:45,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-09 01:13:45,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:45,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 134 [2025-03-09 01:13:45,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:45,983 INFO L124 PetriNetUnfolderBase]: 73/329 cut-off events. [2025-03-09 01:13:45,985 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-09 01:13:45,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 329 events. 73/329 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1333 event pairs, 72 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 530. Up to 201 conditions per place. [2025-03-09 01:13:45,987 INFO L140 encePairwiseOnDemand]: 125/134 looper letters, 56 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2025-03-09 01:13:45,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 111 transitions, 408 flow [2025-03-09 01:13:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-03-09 01:13:45,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2025-03-09 01:13:45,989 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 310 flow. Second operand 3 states and 292 transitions. [2025-03-09 01:13:45,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 111 transitions, 408 flow [2025-03-09 01:13:45,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 111 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:45,994 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 272 flow [2025-03-09 01:13:45,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2025-03-09 01:13:45,995 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -10 predicate places. [2025-03-09 01:13:45,995 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 272 flow [2025-03-09 01:13:45,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-09 01:13:45,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:45,996 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-09 01:13:45,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:13:45,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:45,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:45,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1622852576, now seen corresponding path program 1 times [2025-03-09 01:13:45,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:45,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695695776] [2025-03-09 01:13:45,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:45,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:46,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:13:46,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:13:46,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:46,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:46,268 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-09 01:13:46,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:46,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695695776] [2025-03-09 01:13:46,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695695776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:46,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:46,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:13:46,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713428018] [2025-03-09 01:13:46,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:46,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:46,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:46,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:46,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:46,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 134 [2025-03-09 01:13:46,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 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-09 01:13:46,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:46,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 134 [2025-03-09 01:13:46,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:46,687 INFO L124 PetriNetUnfolderBase]: 73/323 cut-off events. [2025-03-09 01:13:46,687 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-09 01:13:46,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 323 events. 73/323 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1294 event pairs, 63 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 540. Up to 158 conditions per place. [2025-03-09 01:13:46,689 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 43 selfloop transitions, 14 changer transitions 3/116 dead transitions. [2025-03-09 01:13:46,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 402 flow [2025-03-09 01:13:46,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2025-03-09 01:13:46,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6850746268656717 [2025-03-09 01:13:46,693 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 272 flow. Second operand 5 states and 459 transitions. [2025-03-09 01:13:46,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 402 flow [2025-03-09 01:13:46,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 116 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:46,695 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 291 flow [2025-03-09 01:13:46,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2025-03-09 01:13:46,696 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -11 predicate places. [2025-03-09 01:13:46,696 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 291 flow [2025-03-09 01:13:46,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 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-09 01:13:46,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:46,696 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:46,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:13:46,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:46,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1029811867, now seen corresponding path program 1 times [2025-03-09 01:13:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:46,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115637076] [2025-03-09 01:13:46,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:46,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:13:46,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:13:46,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:46,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:46,942 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-09 01:13:46,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:46,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115637076] [2025-03-09 01:13:46,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115637076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:46,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:46,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:13:46,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51803496] [2025-03-09 01:13:46,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:46,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:46,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:46,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:46,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:47,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2025-03-09 01:13:47,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 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-09 01:13:47,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:47,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2025-03-09 01:13:47,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:47,609 INFO L124 PetriNetUnfolderBase]: 64/291 cut-off events. [2025-03-09 01:13:47,610 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-09 01:13:47,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 291 events. 64/291 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1128 event pairs, 63 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 524. Up to 166 conditions per place. [2025-03-09 01:13:47,611 INFO L140 encePairwiseOnDemand]: 112/134 looper letters, 46 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-03-09 01:13:47,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 102 transitions, 407 flow [2025-03-09 01:13:47,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:13:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:13:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 570 transitions. [2025-03-09 01:13:47,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5317164179104478 [2025-03-09 01:13:47,613 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 291 flow. Second operand 8 states and 570 transitions. [2025-03-09 01:13:47,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 102 transitions, 407 flow [2025-03-09 01:13:47,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 102 transitions, 379 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:47,615 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 287 flow [2025-03-09 01:13:47,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2025-03-09 01:13:47,616 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -13 predicate places. [2025-03-09 01:13:47,616 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 287 flow [2025-03-09 01:13:47,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 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-09 01:13:47,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:47,616 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:47,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:13:47,617 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:47,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1029811868, now seen corresponding path program 1 times [2025-03-09 01:13:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:47,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632818867] [2025-03-09 01:13:47,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:47,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:13:47,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:13:47,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:47,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:48,051 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-09 01:13:48,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:48,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632818867] [2025-03-09 01:13:48,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632818867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:48,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:48,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:13:48,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415896903] [2025-03-09 01:13:48,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:48,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:48,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:48,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:48,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:48,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2025-03-09 01:13:48,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 287 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-09 01:13:48,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:48,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2025-03-09 01:13:48,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:48,740 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2025-03-09 01:13:48,740 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-09 01:13:48,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 289 events. 64/289 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1141 event pairs, 63 based on Foata normal form. 1/247 useless extension candidates. Maximal degree in co-relation 516. Up to 172 conditions per place. [2025-03-09 01:13:48,741 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 49 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2025-03-09 01:13:48,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 100 transitions, 407 flow [2025-03-09 01:13:48,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:13:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:13:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 446 transitions. [2025-03-09 01:13:48,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47547974413646055 [2025-03-09 01:13:48,743 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 287 flow. Second operand 7 states and 446 transitions. [2025-03-09 01:13:48,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 100 transitions, 407 flow [2025-03-09 01:13:48,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 373 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-09 01:13:48,745 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 275 flow [2025-03-09 01:13:48,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2025-03-09 01:13:48,746 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -16 predicate places. [2025-03-09 01:13:48,746 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 275 flow [2025-03-09 01:13:48,746 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-09 01:13:48,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:48,746 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:48,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:13:48,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:48,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1806752497, now seen corresponding path program 1 times [2025-03-09 01:13:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:48,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912810997] [2025-03-09 01:13:48,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:48,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:48,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:13:48,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:13:48,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:48,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:48,948 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-09 01:13:48,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:48,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912810997] [2025-03-09 01:13:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912810997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:48,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038491878] [2025-03-09 01:13:48,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:48,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:48,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:48,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:48,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:49,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2025-03-09 01:13:49,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 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-09 01:13:49,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:49,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2025-03-09 01:13:49,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:49,279 INFO L124 PetriNetUnfolderBase]: 64/288 cut-off events. [2025-03-09 01:13:49,279 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-09 01:13:49,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 288 events. 64/288 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1136 event pairs, 63 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 502. Up to 171 conditions per place. [2025-03-09 01:13:49,280 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 40 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2025-03-09 01:13:49,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 99 transitions, 379 flow [2025-03-09 01:13:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2025-03-09 01:13:49,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6477611940298508 [2025-03-09 01:13:49,282 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 275 flow. Second operand 5 states and 434 transitions. [2025-03-09 01:13:49,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 99 transitions, 379 flow [2025-03-09 01:13:49,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 99 transitions, 353 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:13:49,284 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 273 flow [2025-03-09 01:13:49,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2025-03-09 01:13:49,286 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -19 predicate places. [2025-03-09 01:13:49,286 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 273 flow [2025-03-09 01:13:49,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 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-09 01:13:49,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:49,286 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:49,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:13:49,287 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:49,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:49,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1806752496, now seen corresponding path program 1 times [2025-03-09 01:13:49,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:49,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169594959] [2025-03-09 01:13:49,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:49,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:13:49,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:13:49,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:49,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:49,368 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-09 01:13:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:49,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169594959] [2025-03-09 01:13:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169594959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:49,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443209648] [2025-03-09 01:13:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:49,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:49,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:49,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:49,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-03-09 01:13:49,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 99 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-09 01:13:49,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:49,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-03-09 01:13:49,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:49,699 INFO L124 PetriNetUnfolderBase]: 64/287 cut-off events. [2025-03-09 01:13:49,699 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-09 01:13:49,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 287 events. 64/287 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1136 event pairs, 63 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 507. Up to 171 conditions per place. [2025-03-09 01:13:49,701 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 46 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2025-03-09 01:13:49,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 389 flow [2025-03-09 01:13:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2025-03-09 01:13:49,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2025-03-09 01:13:49,703 INFO L175 Difference]: Start difference. First operand has 117 places, 99 transitions, 273 flow. Second operand 5 states and 410 transitions. [2025-03-09 01:13:49,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 98 transitions, 389 flow [2025-03-09 01:13:49,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 98 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:49,705 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 271 flow [2025-03-09 01:13:49,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2025-03-09 01:13:49,706 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2025-03-09 01:13:49,707 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 271 flow [2025-03-09 01:13:49,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-09 01:13:49,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:49,707 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:49,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:13:49,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:49,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash 434299222, now seen corresponding path program 1 times [2025-03-09 01:13:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:49,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785693730] [2025-03-09 01:13:49,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:49,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:13:49,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:13:49,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:49,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:50,089 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-09 01:13:50,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:50,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785693730] [2025-03-09 01:13:50,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785693730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:50,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:50,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631385991] [2025-03-09 01:13:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:50,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:13:50,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:50,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:13:50,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:13:50,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2025-03-09 01:13:50,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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-09 01:13:50,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:50,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2025-03-09 01:13:50,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:50,462 INFO L124 PetriNetUnfolderBase]: 73/311 cut-off events. [2025-03-09 01:13:50,462 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-09 01:13:50,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 311 events. 73/311 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1282 event pairs, 63 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 541. Up to 164 conditions per place. [2025-03-09 01:13:50,464 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 54 selfloop transitions, 3 changer transitions 3/104 dead transitions. [2025-03-09 01:13:50,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 403 flow [2025-03-09 01:13:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:13:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:13:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2025-03-09 01:13:50,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.710820895522388 [2025-03-09 01:13:50,465 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 271 flow. Second operand 4 states and 381 transitions. [2025-03-09 01:13:50,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 403 flow [2025-03-09 01:13:50,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:50,467 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 245 flow [2025-03-09 01:13:50,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2025-03-09 01:13:50,467 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -24 predicate places. [2025-03-09 01:13:50,468 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 245 flow [2025-03-09 01:13:50,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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-09 01:13:50,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:50,468 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-09 01:13:50,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:13:50,468 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:50,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1046515687, now seen corresponding path program 1 times [2025-03-09 01:13:50,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:50,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116972864] [2025-03-09 01:13:50,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:50,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:13:50,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:13:50,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:50,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:50,929 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-09 01:13:50,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:50,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116972864] [2025-03-09 01:13:50,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116972864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:50,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:50,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:13:50,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743111213] [2025-03-09 01:13:50,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:50,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:13:50,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:50,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:13:50,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:13:51,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 134 [2025-03-09 01:13:51,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 95 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-09 01:13:51,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:51,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 134 [2025-03-09 01:13:51,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:51,467 INFO L124 PetriNetUnfolderBase]: 64/280 cut-off events. [2025-03-09 01:13:51,467 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-09 01:13:51,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 280 events. 64/280 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1115 event pairs, 54 based on Foata normal form. 2/239 useless extension candidates. Maximal degree in co-relation 491. Up to 132 conditions per place. [2025-03-09 01:13:51,468 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 42 selfloop transitions, 16 changer transitions 3/100 dead transitions. [2025-03-09 01:13:51,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 377 flow [2025-03-09 01:13:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:13:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:13:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 573 transitions. [2025-03-09 01:13:51,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108742004264393 [2025-03-09 01:13:51,470 INFO L175 Difference]: Start difference. First operand has 112 places, 95 transitions, 245 flow. Second operand 7 states and 573 transitions. [2025-03-09 01:13:51,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 377 flow [2025-03-09 01:13:51,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 371 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:13:51,472 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 263 flow [2025-03-09 01:13:51,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2025-03-09 01:13:51,474 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2025-03-09 01:13:51,474 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 263 flow [2025-03-09 01:13:51,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-09 01:13:51,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:51,474 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-09 01:13:51,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:13:51,474 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:51,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1046515688, now seen corresponding path program 1 times [2025-03-09 01:13:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:51,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104929594] [2025-03-09 01:13:51,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:51,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:51,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:13:51,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:13:51,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:51,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:51,696 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-09 01:13:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:51,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104929594] [2025-03-09 01:13:51,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104929594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:51,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:51,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:13:51,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714582356] [2025-03-09 01:13:51,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:51,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:13:51,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:51,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:13:51,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:13:52,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2025-03-09 01:13:52,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 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-09 01:13:52,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:52,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2025-03-09 01:13:52,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:52,223 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2025-03-09 01:13:52,223 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-09 01:13:52,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 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 1121 event pairs, 54 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 512. Up to 130 conditions per place. [2025-03-09 01:13:52,224 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 49 selfloop transitions, 18 changer transitions 3/98 dead transitions. [2025-03-09 01:13:52,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 417 flow [2025-03-09 01:13:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:13:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:13:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 574 transitions. [2025-03-09 01:13:52,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5354477611940298 [2025-03-09 01:13:52,226 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 263 flow. Second operand 8 states and 574 transitions. [2025-03-09 01:13:52,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 417 flow [2025-03-09 01:13:52,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 385 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:13:52,228 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 263 flow [2025-03-09 01:13:52,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2025-03-09 01:13:52,228 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2025-03-09 01:13:52,228 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 263 flow [2025-03-09 01:13:52,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 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-09 01:13:52,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:52,229 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-09 01:13:52,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:13:52,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:52,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash -679203265, now seen corresponding path program 1 times [2025-03-09 01:13:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:52,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940090495] [2025-03-09 01:13:52,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:52,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:13:52,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:13:52,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:52,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:52,332 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-09 01:13:52,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:52,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940090495] [2025-03-09 01:13:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940090495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:52,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007100185] [2025-03-09 01:13:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:52,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:52,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:52,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:52,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-03-09 01:13:52,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-09 01:13:52,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:52,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-03-09 01:13:52,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:52,653 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-03-09 01:13:52,653 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-09 01:13:52,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 277 events. 64/277 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1108 event pairs, 63 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 510. Up to 170 conditions per place. [2025-03-09 01:13:52,654 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 45 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2025-03-09 01:13:52,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 377 flow [2025-03-09 01:13:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2025-03-09 01:13:52,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104477611940299 [2025-03-09 01:13:52,657 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 263 flow. Second operand 5 states and 409 transitions. [2025-03-09 01:13:52,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 88 transitions, 377 flow [2025-03-09 01:13:52,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 88 transitions, 341 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-09 01:13:52,659 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 251 flow [2025-03-09 01:13:52,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2025-03-09 01:13:52,659 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2025-03-09 01:13:52,660 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 251 flow [2025-03-09 01:13:52,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-09 01:13:52,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:52,660 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-09 01:13:52,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:13:52,660 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:52,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash -679203264, now seen corresponding path program 1 times [2025-03-09 01:13:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846190962] [2025-03-09 01:13:52,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:52,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:13:52,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:13:52,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:52,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:52,844 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-09 01:13:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:52,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846190962] [2025-03-09 01:13:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846190962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:52,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:52,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:13:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081719577] [2025-03-09 01:13:52,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:52,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:52,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:52,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:53,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2025-03-09 01:13:53,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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-09 01:13:53,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:53,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2025-03-09 01:13:53,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:53,122 INFO L124 PetriNetUnfolderBase]: 64/276 cut-off events. [2025-03-09 01:13:53,122 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-09 01:13:53,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 276 events. 64/276 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1103 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 489. Up to 170 conditions per place. [2025-03-09 01:13:53,124 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 39 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2025-03-09 01:13:53,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 87 transitions, 353 flow [2025-03-09 01:13:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:13:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:13:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2025-03-09 01:13:53,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6462686567164179 [2025-03-09 01:13:53,125 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 251 flow. Second operand 5 states and 433 transitions. [2025-03-09 01:13:53,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 87 transitions, 353 flow [2025-03-09 01:13:53,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 87 transitions, 327 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:13:53,128 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 249 flow [2025-03-09 01:13:53,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2025-03-09 01:13:53,129 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2025-03-09 01:13:53,129 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 249 flow [2025-03-09 01:13:53,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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-09 01:13:53,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:53,130 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-09 01:13:53,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:13:53,130 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-09 01:13:53,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:53,131 INFO L85 PathProgramCache]: Analyzing trace with hash 45814675, now seen corresponding path program 1 times [2025-03-09 01:13:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:53,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42195041] [2025-03-09 01:13:53,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:53,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:53,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:13:53,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:13:53,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:53,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:54,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:54,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42195041] [2025-03-09 01:13:54,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42195041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:54,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745891845] [2025-03-09 01:13:54,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:54,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:54,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:54,423 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-09 01:13:54,431 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-09 01:13:54,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:13:54,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:13:54,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:54,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:54,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-09 01:13:54,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:54,710 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-09 01:13:54,765 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-09 01:13:54,771 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-09 01:13:54,786 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-03-09 01:13:54,787 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-09 01:13:54,987 INFO L349 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2025-03-09 01:13:54,988 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 25 treesize of output 37 [2025-03-09 01:13:55,007 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2025-03-09 01:13:55,008 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 25 treesize of output 30 [2025-03-09 01:13:55,187 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-09 01:13:55,188 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 70 treesize of output 38 [2025-03-09 01:13:55,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:55,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:55,206 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2025-03-09 01:13:55,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2025-03-09 01:13:55,235 INFO L349 Elim1Store]: treesize reduction 64, result has 35.4 percent of original size [2025-03-09 01:13:55,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2025-03-09 01:13:55,276 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-09 01:13:55,276 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-09 01:13:55,862 INFO L349 Elim1Store]: treesize reduction 24, result has 83.4 percent of original size [2025-03-09 01:13:55,862 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 185 treesize of output 269 [2025-03-09 01:13:55,896 INFO L349 Elim1Store]: treesize reduction 92, result has 27.6 percent of original size [2025-03-09 01:13:55,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 163 [2025-03-09 01:13:56,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:56,896 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 216 treesize of output 128 [2025-03-09 01:13:56,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:56,904 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 112 treesize of output 104 [2025-03-09 01:13:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:13:57,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:57,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:57,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 130 treesize of output 284 [2025-03-09 01:15:10,284 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 27 treesize of output 25 [2025-03-09 01:15:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:15:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745891845] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:15:10,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:15:10,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 39 [2025-03-09 01:15:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52768187] [2025-03-09 01:15:10,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:15:10,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 01:15:10,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:10,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 01:15:10,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560