./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.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_17-arrayloop_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:13:41,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:13:41,627 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:41,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:13:41,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:13:41,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:13:41,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:13:41,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:13:41,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:13:41,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:13:41,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:13:41,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:13:41,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:13:41,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:13:41,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:13:41,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:13:41,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:13:41,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:13:41,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:13:41,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:41,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:13:41,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:13:41,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:13:41,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:13:41,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:13:41,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:13:41,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:13:41,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:13:41,656 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2025-03-09 01:13:41,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:13:41,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:13:41,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:13:41,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:13:41,907 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:13:41,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-09 01:13:43,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce0bb3a0/db34b9f237404cdbbf7e756e23b24eb7/FLAG39dbb13d2 [2025-03-09 01:13:43,390 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:13:43,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-09 01:13:43,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce0bb3a0/db34b9f237404cdbbf7e756e23b24eb7/FLAG39dbb13d2 [2025-03-09 01:13:43,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce0bb3a0/db34b9f237404cdbbf7e756e23b24eb7 [2025-03-09 01:13:43,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:13:43,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:13:43,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:43,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:13:43,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:13:43,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:43" (1/1) ... [2025-03-09 01:13:43,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c78adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:43, skipping insertion in model container [2025-03-09 01:13:43,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:13:43" (1/1) ... [2025-03-09 01:13:43,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:13:44,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:44,056 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:13:44,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:13:44,157 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:13:44,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44 WrapperNode [2025-03-09 01:13:44,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:13:44,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:44,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:13:44,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:13:44,163 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:44" (1/1) ... [2025-03-09 01:13:44,172 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:44" (1/1) ... [2025-03-09 01:13:44,194 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 171 [2025-03-09 01:13:44,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:13:44,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:13:44,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:13:44,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:13:44,201 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:44" (1/1) ... [2025-03-09 01:13:44,201 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:44" (1/1) ... [2025-03-09 01:13:44,207 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:44" (1/1) ... [2025-03-09 01:13:44,220 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 0, 10]. The 11 writes are split as follows [0, 10, 1]. [2025-03-09 01:13:44,220 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:44" (1/1) ... [2025-03-09 01:13:44,220 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:44" (1/1) ... [2025-03-09 01:13:44,232 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:44" (1/1) ... [2025-03-09 01:13:44,232 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:44" (1/1) ... [2025-03-09 01:13:44,234 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:44" (1/1) ... [2025-03-09 01:13:44,235 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:44" (1/1) ... [2025-03-09 01:13:44,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:13:44,238 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:13:44,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:13:44,238 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:13:44,239 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (1/1) ... [2025-03-09 01:13:44,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:13:44,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:44,262 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:44,264 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:44,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:13:44,279 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:13:44,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:13:44,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:13:44,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:13:44,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:13:44,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:13:44,281 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:44,419 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:13:44,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:13:44,791 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:13:44,791 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:13:45,011 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:13:45,011 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:13:45,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:45 BoogieIcfgContainer [2025-03-09 01:13:45,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:13:45,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:13:45,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:13:45,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:13:45,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:13:43" (1/3) ... [2025-03-09 01:13:45,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1832c658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:45, skipping insertion in model container [2025-03-09 01:13:45,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:13:44" (2/3) ... [2025-03-09 01:13:45,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1832c658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:13:45, skipping insertion in model container [2025-03-09 01:13:45,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:13:45" (3/3) ... [2025-03-09 01:13:45,020 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2025-03-09 01:13:45,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:13:45,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_17-arrayloop_nr.i that has 2 procedures, 73 locations, 1 initial locations, 3 loop locations, and 37 error locations. [2025-03-09 01:13:45,034 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:13:45,091 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:13:45,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 154 flow [2025-03-09 01:13:45,153 INFO L124 PetriNetUnfolderBase]: 3/74 cut-off events. [2025-03-09 01:13:45,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:45,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 74 events. 3/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2025-03-09 01:13:45,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 154 flow [2025-03-09 01:13:45,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 74 transitions, 151 flow [2025-03-09 01:13:45,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:13:45,180 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;@17e1a08c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:13:45,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-09 01:13:45,186 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:13:45,186 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:13:45,186 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:45,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:45,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:13:45,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:45,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash 489896, now seen corresponding path program 1 times [2025-03-09 01:13:45,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466467] [2025-03-09 01:13:45,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:45,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:45,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:13:45,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:13:45,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:45,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:45,448 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:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466467] [2025-03-09 01:13:45,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:45,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:45,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:45,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103194846] [2025-03-09 01:13:45,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:45,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:45,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:45,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:45,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:45,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 75 [2025-03-09 01:13:45,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:45,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 75 [2025-03-09 01:13:45,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:45,757 INFO L124 PetriNetUnfolderBase]: 142/528 cut-off events. [2025-03-09 01:13:45,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:13:45,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 528 events. 142/528 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3284 event pairs, 99 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 797. Up to 246 conditions per place. [2025-03-09 01:13:45,762 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 37 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2025-03-09 01:13:45,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 245 flow [2025-03-09 01:13:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-09 01:13:45,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-09 01:13:45,776 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 151 flow. Second operand 3 states and 165 transitions. [2025-03-09 01:13:45,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 245 flow [2025-03-09 01:13:45,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:45,784 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 150 flow [2025-03-09 01:13:45,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-03-09 01:13:45,789 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-03-09 01:13:45,789 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 150 flow [2025-03-09 01:13:45,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:45,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:13:45,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:13:45,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:45,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash 489897, now seen corresponding path program 1 times [2025-03-09 01:13:45,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:45,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339385801] [2025-03-09 01:13:45,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:45,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:45,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:13:45,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:13:45,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:45,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:45,929 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:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339385801] [2025-03-09 01:13:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339385801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:45,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:45,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994545315] [2025-03-09 01:13:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:45,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:45,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:45,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:45,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 75 [2025-03-09 01:13:45,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:45,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 75 [2025-03-09 01:13:45,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:46,126 INFO L124 PetriNetUnfolderBase]: 132/496 cut-off events. [2025-03-09 01:13:46,126 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 01:13:46,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 496 events. 132/496 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3048 event pairs, 99 based on Foata normal form. 22/393 useless extension candidates. Maximal degree in co-relation 767. Up to 246 conditions per place. [2025-03-09 01:13:46,132 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 35 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-09 01:13:46,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 240 flow [2025-03-09 01:13:46,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-09 01:13:46,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511111111111111 [2025-03-09 01:13:46,137 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 150 flow. Second operand 3 states and 169 transitions. [2025-03-09 01:13:46,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 240 flow [2025-03-09 01:13:46,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:46,139 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 142 flow [2025-03-09 01:13:46,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2025-03-09 01:13:46,141 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-03-09 01:13:46,141 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 142 flow [2025-03-09 01:13:46,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:46,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:13:46,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:13:46,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:46,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 470804215, now seen corresponding path program 1 times [2025-03-09 01:13:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:46,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502371676] [2025-03-09 01:13:46,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:46,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:13:46,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:13:46,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:46,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:46,426 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:46,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:46,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502371676] [2025-03-09 01:13:46,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502371676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:46,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:46,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:13:46,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810595049] [2025-03-09 01:13:46,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:46,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:13:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:46,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:13:46,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:13:46,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-09 01:13:46,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:46,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-09 01:13:46,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:46,761 INFO L124 PetriNetUnfolderBase]: 189/617 cut-off events. [2025-03-09 01:13:46,762 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-09 01:13:46,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 617 events. 189/617 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3775 event pairs, 160 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 1000. Up to 383 conditions per place. [2025-03-09 01:13:46,765 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 35 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-03-09 01:13:46,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 230 flow [2025-03-09 01:13:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:13:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:13:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-03-09 01:13:46,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6066666666666667 [2025-03-09 01:13:46,766 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 142 flow. Second operand 4 states and 182 transitions. [2025-03-09 01:13:46,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 230 flow [2025-03-09 01:13:46,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:46,770 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 166 flow [2025-03-09 01:13:46,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-03-09 01:13:46,771 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -4 predicate places. [2025-03-09 01:13:46,771 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 166 flow [2025-03-09 01:13:46,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:46,771 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1] [2025-03-09 01:13:46,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:13:46,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 875706113, now seen corresponding path program 1 times [2025-03-09 01:13:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:46,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840824730] [2025-03-09 01:13:46,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:46,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:46,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:13:46,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:13:46,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:46,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:47,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840824730] [2025-03-09 01:13:47,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840824730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:47,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875526623] [2025-03-09 01:13:47,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:47,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:47,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:47,079 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:47,081 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:47,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:13:47,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:13:47,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:47,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:47,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:13:47,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:47,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:47,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:13:47,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:47,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:13:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:47,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:47,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:47,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-09 01:13:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:47,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875526623] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:47,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:47,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-09 01:13:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641763001] [2025-03-09 01:13:47,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:47,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:13:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:47,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:13:47,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:13:48,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-09 01:13:48,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 166 flow. Second operand has 15 states, 15 states have (on average 35.4) internal successors, (531), 15 states have internal predecessors, (531), 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,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:48,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-09 01:13:48,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:49,461 INFO L124 PetriNetUnfolderBase]: 213/645 cut-off events. [2025-03-09 01:13:49,461 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:13:49,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 645 events. 213/645 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3791 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1105. Up to 229 conditions per place. [2025-03-09 01:13:49,464 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 67 selfloop transitions, 11 changer transitions 0/107 dead transitions. [2025-03-09 01:13:49,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 428 flow [2025-03-09 01:13:49,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:13:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:13:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 322 transitions. [2025-03-09 01:13:49,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-03-09 01:13:49,467 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 166 flow. Second operand 7 states and 322 transitions. [2025-03-09 01:13:49,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 428 flow [2025-03-09 01:13:49,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 107 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:49,469 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 240 flow [2025-03-09 01:13:49,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-03-09 01:13:49,470 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-03-09 01:13:49,470 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 240 flow [2025-03-09 01:13:49,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 35.4) internal successors, (531), 15 states have internal predecessors, (531), 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,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:49,470 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1] [2025-03-09 01:13:49,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:13:49,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:49,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:49,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash -751209974, now seen corresponding path program 1 times [2025-03-09 01:13:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878301992] [2025-03-09 01:13:49,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:49,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:13:49,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:13:49,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:49,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:13:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878301992] [2025-03-09 01:13:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878301992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:13:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835255826] [2025-03-09 01:13:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:49,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:13:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:49,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:13:49,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:13:49,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 75 [2025-03-09 01:13:49,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:49,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 75 [2025-03-09 01:13:49,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:49,933 INFO L124 PetriNetUnfolderBase]: 174/600 cut-off events. [2025-03-09 01:13:49,934 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-09 01:13:49,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 600 events. 174/600 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3592 event pairs, 126 based on Foata normal form. 13/488 useless extension candidates. Maximal degree in co-relation 873. Up to 367 conditions per place. [2025-03-09 01:13:49,936 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 41 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2025-03-09 01:13:49,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 71 transitions, 312 flow [2025-03-09 01:13:49,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-09 01:13:49,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-09 01:13:49,938 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 240 flow. Second operand 3 states and 153 transitions. [2025-03-09 01:13:49,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 71 transitions, 312 flow [2025-03-09 01:13:49,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 304 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:49,941 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 222 flow [2025-03-09 01:13:49,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2025-03-09 01:13:49,941 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-03-09 01:13:49,941 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 222 flow [2025-03-09 01:13:49,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:49,943 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:49,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:13:49,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:49,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1809694353, now seen corresponding path program 1 times [2025-03-09 01:13:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:49,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718583953] [2025-03-09 01:13:49,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:49,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:49,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:13:49,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:13:49,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:49,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:13:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718583953] [2025-03-09 01:13:49,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718583953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:49,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:49,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:13:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607367774] [2025-03-09 01:13:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:49,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:49,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:49,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:49,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:50,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 75 [2025-03-09 01:13:50,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:50,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 75 [2025-03-09 01:13:50,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:50,151 INFO L124 PetriNetUnfolderBase]: 254/916 cut-off events. [2025-03-09 01:13:50,151 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-09 01:13:50,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1608 conditions, 916 events. 254/916 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5551 event pairs, 153 based on Foata normal form. 10/742 useless extension candidates. Maximal degree in co-relation 1594. Up to 300 conditions per place. [2025-03-09 01:13:50,157 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 53 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2025-03-09 01:13:50,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 91 transitions, 386 flow [2025-03-09 01:13:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-03-09 01:13:50,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488888888888889 [2025-03-09 01:13:50,158 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 222 flow. Second operand 3 states and 191 transitions. [2025-03-09 01:13:50,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 91 transitions, 386 flow [2025-03-09 01:13:50,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:50,160 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 248 flow [2025-03-09 01:13:50,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2025-03-09 01:13:50,161 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-03-09 01:13:50,161 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 248 flow [2025-03-09 01:13:50,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:50,162 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:50,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:13:50,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:50,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash 382510052, now seen corresponding path program 1 times [2025-03-09 01:13:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:50,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638610612] [2025-03-09 01:13:50,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:50,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:50,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:13:50,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:13:50,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:50,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:13:50,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:50,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638610612] [2025-03-09 01:13:50,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638610612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:13:50,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:13:50,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:13:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994356781] [2025-03-09 01:13:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:13:50,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:13:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:50,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:13:50,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:13:50,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 75 [2025-03-09 01:13:50,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:50,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 75 [2025-03-09 01:13:50,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:50,411 INFO L124 PetriNetUnfolderBase]: 279/939 cut-off events. [2025-03-09 01:13:50,411 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2025-03-09 01:13:50,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 939 events. 279/939 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5565 event pairs, 176 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 1757. Up to 473 conditions per place. [2025-03-09 01:13:50,416 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 55 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-03-09 01:13:50,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 86 transitions, 423 flow [2025-03-09 01:13:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:13:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:13:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-03-09 01:13:50,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2025-03-09 01:13:50,418 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 248 flow. Second operand 3 states and 174 transitions. [2025-03-09 01:13:50,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 86 transitions, 423 flow [2025-03-09 01:13:50,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 86 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:13:50,422 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 242 flow [2025-03-09 01:13:50,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2025-03-09 01:13:50,423 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-03-09 01:13:50,423 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 242 flow [2025-03-09 01:13:50,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:50,423 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:13:50,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:13:50,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:50,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash 382510053, now seen corresponding path program 1 times [2025-03-09 01:13:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:50,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994766081] [2025-03-09 01:13:50,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:50,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:13:50,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:13:50,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:50,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:50,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994766081] [2025-03-09 01:13:50,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994766081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345060996] [2025-03-09 01:13:50,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:13:50,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:50,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:50,511 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:50,513 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:50,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:13:50,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:13:50,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:13:50,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:50,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:13:50,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:50,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:50,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345060996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:50,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:50,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-09 01:13:50,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601921998] [2025-03-09 01:13:50,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:50,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:13:50,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:50,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:13:50,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:13:50,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-03-09 01:13:50,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 242 flow. Second operand has 9 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:50,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:50,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-03-09 01:13:50,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:13:51,174 INFO L124 PetriNetUnfolderBase]: 702/2330 cut-off events. [2025-03-09 01:13:51,174 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-03-09 01:13:51,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4229 conditions, 2330 events. 702/2330 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 13325 event pairs, 88 based on Foata normal form. 50/1987 useless extension candidates. Maximal degree in co-relation 4213. Up to 234 conditions per place. [2025-03-09 01:13:51,187 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 146 selfloop transitions, 16 changer transitions 0/191 dead transitions. [2025-03-09 01:13:51,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 191 transitions, 889 flow [2025-03-09 01:13:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:13:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:13:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 531 transitions. [2025-03-09 01:13:51,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-03-09 01:13:51,189 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 242 flow. Second operand 8 states and 531 transitions. [2025-03-09 01:13:51,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 191 transitions, 889 flow [2025-03-09 01:13:51,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 191 transitions, 859 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:13:51,194 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 346 flow [2025-03-09 01:13:51,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2025-03-09 01:13:51,194 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2025-03-09 01:13:51,194 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 346 flow [2025-03-09 01:13:51,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:13:51,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:13:51,195 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 1, 1] [2025-03-09 01:13:51,205 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:51,395 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,SelfDestructingSolverStorable7 [2025-03-09 01:13:51,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:13:51,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:13:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash 251701535, now seen corresponding path program 2 times [2025-03-09 01:13:51,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:13:51,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791006119] [2025-03-09 01:13:51,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:51,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:13:51,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:13:51,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:13:51,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:13:51,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:13:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:52,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:13:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791006119] [2025-03-09 01:13:52,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791006119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:13:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940116573] [2025-03-09 01:13:52,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:13:52,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:13:52,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:13:52,131 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:52,133 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:52,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:13:52,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:13:52,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 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,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 01:13:52,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:13:52,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:52,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:13:52,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:52,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:13:52,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:52,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:13:52,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:52,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:13:52,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:13:52,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:13:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:52,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:13:52,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:52,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-09 01:13:52,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:52,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-09 01:13:53,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:53,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-09 01:13:53,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:13:53,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-09 01:13:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:13:53,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940116573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:13:53,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:13:53,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 32 [2025-03-09 01:13:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448694965] [2025-03-09 01:13:53,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:13:53,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 01:13:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:13:53,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 01:13:53,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 01:13:58,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-09 01:13:58,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 346 flow. Second operand has 34 states, 34 states have (on average 35.411764705882355) internal successors, (1204), 34 states have internal predecessors, (1204), 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:58,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:13:58,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-09 01:13:58,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:00,289 INFO L124 PetriNetUnfolderBase]: 806/2506 cut-off events. [2025-03-09 01:14:00,289 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2025-03-09 01:14:00,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4950 conditions, 2506 events. 806/2506 cut-off events. For 796/796 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14511 event pairs, 0 based on Foata normal form. 6/2127 useless extension candidates. Maximal degree in co-relation 4927. Up to 855 conditions per place. [2025-03-09 01:14:00,302 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 91 selfloop transitions, 28 changer transitions 0/147 dead transitions. [2025-03-09 01:14:00,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 147 transitions, 926 flow [2025-03-09 01:14:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:14:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 01:14:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 630 transitions. [2025-03-09 01:14:00,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-03-09 01:14:00,304 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 346 flow. Second operand 15 states and 630 transitions. [2025-03-09 01:14:00,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 147 transitions, 926 flow [2025-03-09 01:14:00,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 147 transitions, 908 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-09 01:14:00,310 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 547 flow [2025-03-09 01:14:00,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=547, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2025-03-09 01:14:00,312 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 35 predicate places. [2025-03-09 01:14:00,312 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 547 flow [2025-03-09 01:14:00,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 35.411764705882355) internal successors, (1204), 34 states have internal predecessors, (1204), 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:14:00,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:00,313 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:00,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:14:00,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:00,514 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:14:00,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:00,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1057982275, now seen corresponding path program 2 times [2025-03-09 01:14:00,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:00,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948953811] [2025-03-09 01:14:00,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:14:00,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:00,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 01:14:00,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 32 statements. [2025-03-09 01:14:00,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:14:00,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-09 01:14:00,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948953811] [2025-03-09 01:14:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948953811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:14:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:14:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:14:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812685495] [2025-03-09 01:14:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:14:00,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:14:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:00,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:14:00,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:14:00,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 75 [2025-03-09 01:14:00,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:14:00,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:00,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 75 [2025-03-09 01:14:00,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:00,873 INFO L124 PetriNetUnfolderBase]: 685/2347 cut-off events. [2025-03-09 01:14:00,873 INFO L125 PetriNetUnfolderBase]: For 1503/1503 co-relation queries the response was YES. [2025-03-09 01:14:00,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 2347 events. 685/2347 cut-off events. For 1503/1503 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 13852 event pairs, 504 based on Foata normal form. 68/2058 useless extension candidates. Maximal degree in co-relation 4733. Up to 1260 conditions per place. [2025-03-09 01:14:00,884 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 77 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-03-09 01:14:00,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 857 flow [2025-03-09 01:14:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:14:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:14:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-03-09 01:14:00,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7822222222222223 [2025-03-09 01:14:00,886 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 547 flow. Second operand 3 states and 176 transitions. [2025-03-09 01:14:00,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 857 flow [2025-03-09 01:14:00,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 108 transitions, 795 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-09 01:14:00,892 INFO L231 Difference]: Finished difference. Result has 105 places, 86 transitions, 492 flow [2025-03-09 01:14:00,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=105, PETRI_TRANSITIONS=86} [2025-03-09 01:14:00,893 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 30 predicate places. [2025-03-09 01:14:00,895 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 86 transitions, 492 flow [2025-03-09 01:14:00,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:14:00,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:00,895 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:00,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:14:00,895 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:14:00,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash -76366143, now seen corresponding path program 1 times [2025-03-09 01:14:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:00,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455798265] [2025-03-09 01:14:00,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:00,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:14:00,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:14:00,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:00,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455798265] [2025-03-09 01:14:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455798265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:14:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118358200] [2025-03-09 01:14:01,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:01,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:01,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:14:01,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:14:01,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:14:01,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:14:01,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:14:01,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:01,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:01,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:14:01,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:14:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:01,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:14:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:01,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118358200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:14:01,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:14:01,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-09 01:14:01,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662008124] [2025-03-09 01:14:01,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:14:01,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:14:01,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:01,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:14:01,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:14:01,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-03-09 01:14:01,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 86 transitions, 492 flow. Second operand has 13 states, 13 states have (on average 48.15384615384615) internal successors, (626), 13 states have internal predecessors, (626), 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:14:01,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:01,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-03-09 01:14:01,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:02,125 INFO L124 PetriNetUnfolderBase]: 1142/3757 cut-off events. [2025-03-09 01:14:02,125 INFO L125 PetriNetUnfolderBase]: For 2034/2034 co-relation queries the response was YES. [2025-03-09 01:14:02,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7427 conditions, 3757 events. 1142/3757 cut-off events. For 2034/2034 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 21455 event pairs, 27 based on Foata normal form. 44/3193 useless extension candidates. Maximal degree in co-relation 7394. Up to 235 conditions per place. [2025-03-09 01:14:02,148 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 234 selfloop transitions, 25 changer transitions 0/286 dead transitions. [2025-03-09 01:14:02,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 286 transitions, 1611 flow [2025-03-09 01:14:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:14:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:14:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 806 transitions. [2025-03-09 01:14:02,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8955555555555555 [2025-03-09 01:14:02,150 INFO L175 Difference]: Start difference. First operand has 105 places, 86 transitions, 492 flow. Second operand 12 states and 806 transitions. [2025-03-09 01:14:02,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 286 transitions, 1611 flow [2025-03-09 01:14:02,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 286 transitions, 1565 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:14:02,159 INFO L231 Difference]: Finished difference. Result has 119 places, 88 transitions, 606 flow [2025-03-09 01:14:02,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=606, PETRI_PLACES=119, PETRI_TRANSITIONS=88} [2025-03-09 01:14:02,159 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 44 predicate places. [2025-03-09 01:14:02,159 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 88 transitions, 606 flow [2025-03-09 01:14:02,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.15384615384615) internal successors, (626), 13 states have internal predecessors, (626), 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:14:02,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:02,160 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 1, 1] [2025-03-09 01:14:02,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:14:02,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:02,361 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:14:02,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1104172635, now seen corresponding path program 3 times [2025-03-09 01:14:02,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:02,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438785849] [2025-03-09 01:14:02,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:14:02,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:02,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-03-09 01:14:02,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:14:02,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:14:02,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 183 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:02,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:02,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438785849] [2025-03-09 01:14:02,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438785849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:14:02,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119892150] [2025-03-09 01:14:02,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:14:02,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:02,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:14:02,770 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:14:02,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:14:02,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-03-09 01:14:33,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:14:33,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:14:33,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:33,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:14:33,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:14:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:33,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:14:33,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119892150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:14:33,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:14:33,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2025-03-09 01:14:33,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050690943] [2025-03-09 01:14:33,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:14:33,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:14:33,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:33,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:14:33,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:14:33,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-03-09 01:14:33,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 88 transitions, 606 flow. Second operand has 13 states, 13 states have (on average 47.53846153846154) internal successors, (618), 13 states have internal predecessors, (618), 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:14:33,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:33,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-03-09 01:14:33,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:34,537 INFO L124 PetriNetUnfolderBase]: 1131/3760 cut-off events. [2025-03-09 01:14:34,538 INFO L125 PetriNetUnfolderBase]: For 2323/2323 co-relation queries the response was YES. [2025-03-09 01:14:34,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7405 conditions, 3760 events. 1131/3760 cut-off events. For 2323/2323 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 21753 event pairs, 80 based on Foata normal form. 11/3146 useless extension candidates. Maximal degree in co-relation 7366. Up to 228 conditions per place. [2025-03-09 01:14:34,562 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 242 selfloop transitions, 23 changer transitions 1/292 dead transitions. [2025-03-09 01:14:34,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 292 transitions, 1647 flow [2025-03-09 01:14:34,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:14:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:14:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 853 transitions. [2025-03-09 01:14:34,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748717948717949 [2025-03-09 01:14:34,564 INFO L175 Difference]: Start difference. First operand has 119 places, 88 transitions, 606 flow. Second operand 13 states and 853 transitions. [2025-03-09 01:14:34,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 292 transitions, 1647 flow [2025-03-09 01:14:34,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 292 transitions, 1547 flow, removed 0 selfloop flow, removed 14 redundant places. [2025-03-09 01:14:34,573 INFO L231 Difference]: Finished difference. Result has 116 places, 84 transitions, 519 flow [2025-03-09 01:14:34,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=519, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2025-03-09 01:14:34,574 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 41 predicate places. [2025-03-09 01:14:34,575 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 519 flow [2025-03-09 01:14:34,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 47.53846153846154) internal successors, (618), 13 states have internal predecessors, (618), 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:14:34,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:34,576 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:34,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:14:34,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 01:14:34,776 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:14:34,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:34,777 INFO L85 PathProgramCache]: Analyzing trace with hash 596381081, now seen corresponding path program 2 times [2025-03-09 01:14:34,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:34,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012460264] [2025-03-09 01:14:34,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:14:34,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:34,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 01:14:34,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:14:34,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:14:34,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:35,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:35,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012460264] [2025-03-09 01:14:35,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012460264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:14:35,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702990154] [2025-03-09 01:14:35,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:14:35,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:35,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:14:35,259 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:14:35,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:14:35,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 01:14:35,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:14:35,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:14:35,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:35,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:14:35,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:14:35,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:35,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:14:35,645 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:14:35,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:14:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:35,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:14:35,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-09 01:14:35,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:14:35,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2025-03-09 01:14:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:36,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702990154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:14:36,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:14:36,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2025-03-09 01:14:36,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343777983] [2025-03-09 01:14:36,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:14:36,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-09 01:14:36,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:36,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 01:14:36,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2025-03-09 01:14:37,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-09 01:14:37,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 84 transitions, 519 flow. Second operand has 31 states, 31 states have (on average 36.67741935483871) internal successors, (1137), 31 states have internal predecessors, (1137), 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:14:37,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:37,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-09 01:14:37,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:38,678 INFO L124 PetriNetUnfolderBase]: 1211/3867 cut-off events. [2025-03-09 01:14:38,678 INFO L125 PetriNetUnfolderBase]: For 1641/1641 co-relation queries the response was YES. [2025-03-09 01:14:38,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7400 conditions, 3867 events. 1211/3867 cut-off events. For 1641/1641 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 22252 event pairs, 126 based on Foata normal form. 20/3245 useless extension candidates. Maximal degree in co-relation 7369. Up to 294 conditions per place. [2025-03-09 01:14:38,701 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 303 selfloop transitions, 50 changer transitions 1/380 dead transitions. [2025-03-09 01:14:38,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 380 transitions, 1917 flow [2025-03-09 01:14:38,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:14:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 01:14:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1104 transitions. [2025-03-09 01:14:38,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6690909090909091 [2025-03-09 01:14:38,704 INFO L175 Difference]: Start difference. First operand has 116 places, 84 transitions, 519 flow. Second operand 22 states and 1104 transitions. [2025-03-09 01:14:38,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 380 transitions, 1917 flow [2025-03-09 01:14:38,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 380 transitions, 1871 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-09 01:14:38,713 INFO L231 Difference]: Finished difference. Result has 127 places, 106 transitions, 697 flow [2025-03-09 01:14:38,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=697, PETRI_PLACES=127, PETRI_TRANSITIONS=106} [2025-03-09 01:14:38,714 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 52 predicate places. [2025-03-09 01:14:38,714 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 697 flow [2025-03-09 01:14:38,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 36.67741935483871) internal successors, (1137), 31 states have internal predecessors, (1137), 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:14:38,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:38,715 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:38,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:14:38,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:38,915 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:14:38,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1859043861, now seen corresponding path program 1 times [2025-03-09 01:14:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:38,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884052984] [2025-03-09 01:14:38,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:38,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:38,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:14:38,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:14:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:38,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:39,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:39,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884052984] [2025-03-09 01:14:39,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884052984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:14:39,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537395107] [2025-03-09 01:14:39,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:14:39,401 INFO L229 MonitoredProcess]: Starting monitored process 8 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:14:39,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:14:39,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:14:39,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:14:39,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:39,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:39,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:14:39,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:14:39,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:39,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:14:39,766 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:14:39,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:14:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:39,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:14:39,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-09 01:14:39,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:14:39,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2025-03-09 01:14:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:40,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537395107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:14:40,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:14:40,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 27 [2025-03-09 01:14:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157357830] [2025-03-09 01:14:40,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:14:40,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 01:14:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:40,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 01:14:40,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2025-03-09 01:14:41,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 75 [2025-03-09 01:14:41,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 106 transitions, 697 flow. Second operand has 29 states, 29 states have (on average 40.758620689655174) internal successors, (1182), 29 states have internal predecessors, (1182), 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:14:41,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:41,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 75 [2025-03-09 01:14:41,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:44,239 INFO L124 PetriNetUnfolderBase]: 2713/8815 cut-off events. [2025-03-09 01:14:44,240 INFO L125 PetriNetUnfolderBase]: For 4715/4723 co-relation queries the response was YES. [2025-03-09 01:14:44,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17578 conditions, 8815 events. 2713/8815 cut-off events. For 4715/4723 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 65788 event pairs, 181 based on Foata normal form. 114/7375 useless extension candidates. Maximal degree in co-relation 17545. Up to 342 conditions per place. [2025-03-09 01:14:44,276 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 627 selfloop transitions, 120 changer transitions 2/782 dead transitions. [2025-03-09 01:14:44,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 782 transitions, 4261 flow [2025-03-09 01:14:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-09 01:14:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-09 01:14:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2530 transitions. [2025-03-09 01:14:44,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-09 01:14:44,281 INFO L175 Difference]: Start difference. First operand has 127 places, 106 transitions, 697 flow. Second operand 46 states and 2530 transitions. [2025-03-09 01:14:44,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 782 transitions, 4261 flow [2025-03-09 01:14:44,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 782 transitions, 3995 flow, removed 20 selfloop flow, removed 15 redundant places. [2025-03-09 01:14:44,300 INFO L231 Difference]: Finished difference. Result has 201 places, 203 transitions, 1572 flow [2025-03-09 01:14:44,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1572, PETRI_PLACES=201, PETRI_TRANSITIONS=203} [2025-03-09 01:14:44,301 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 126 predicate places. [2025-03-09 01:14:44,301 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 203 transitions, 1572 flow [2025-03-09 01:14:44,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 40.758620689655174) internal successors, (1182), 29 states have internal predecessors, (1182), 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:14:44,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:44,302 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:44,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:14:44,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:44,502 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:14:44,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1307944786, now seen corresponding path program 1 times [2025-03-09 01:14:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:44,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400450980] [2025-03-09 01:14:44,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:44,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:14:44,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:14:44,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:44,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 108 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:47,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:47,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400450980] [2025-03-09 01:14:47,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400450980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:14:47,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636055758] [2025-03-09 01:14:47,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:47,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:14:47,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:14:47,573 INFO L229 MonitoredProcess]: Starting monitored process 9 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:14:47,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:14:47,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:14:47,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:14:47,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:47,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:47,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-09 01:14:47,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:14:47,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:14:47,888 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 1 [2025-03-09 01:14:47,917 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-09 01:14:47,918 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 23 treesize of output 24 [2025-03-09 01:14:47,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:47,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 01:14:47,951 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-09 01:14:47,951 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 23 treesize of output 24 [2025-03-09 01:14:47,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:47,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 01:14:47,989 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-09 01:14:47,990 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 23 treesize of output 24 [2025-03-09 01:14:48,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:48,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 01:14:48,020 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-09 01:14:48,020 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 16 treesize of output 18 [2025-03-09 01:14:48,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:48,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 01:14:48,061 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-09 01:14:48,061 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 16 treesize of output 18 [2025-03-09 01:14:48,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:48,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 01:14:48,114 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-09 01:14:48,114 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 16 treesize of output 18 [2025-03-09 01:14:48,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:48,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 01:14:48,156 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-09 01:14:48,156 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 16 treesize of output 18 [2025-03-09 01:14:48,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:48,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 01:14:48,202 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-09 01:14:48,202 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 16 treesize of output 18 [2025-03-09 01:14:48,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:48,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 01:14:48,263 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-09 01:14:48,264 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 16 treesize of output 18 [2025-03-09 01:14:48,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:14:48,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 01:14:48,326 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-09 01:14:48,326 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 16 treesize of output 18 [2025-03-09 01:14:48,354 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 17 treesize of output 9 [2025-03-09 01:14:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:48,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:15:04,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~ret37#1.base_124| Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int)) (or (= (select |c_#valid| (select (store (store (select |c_#memory_$Pointer$#2.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_124|) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |c_ULTIMATE.start_main_~j~0#1| 1)))) is different from false [2025-03-09 01:15:10,003 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_230| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_124| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_126| Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_230| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |v_ULTIMATE.start_main_~j~0#1_230| 1)) (= (select (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (select |c_#memory_$Pointer$#2.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_126|) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_124|) |c_~#slot~0.offset|)) 1))) is different from false [2025-03-09 01:15:11,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_230| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_124| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_126| Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_230| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |v_ULTIMATE.start_main_~j~0#1_230| 1)) (= (select (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (select |c_#memory_$Pointer$#2.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_126|) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_124|) |c_~#slot~0.offset|)) 1))) is different from false [2025-03-09 01:15:13,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_230| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_128| Int) (|v_ULTIMATE.start_main_~j~0#1_231| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_124| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_126| Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_230| (+ |v_ULTIMATE.start_main_~j~0#1_231| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |v_ULTIMATE.start_main_~j~0#1_230| 1)) (< |v_ULTIMATE.start_main_~j~0#1_231| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (= (select (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (store (select |c_#memory_$Pointer$#2.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_231| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_128|) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_126|) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_124|) |c_~#slot~0.offset|)) 1))) is different from false [2025-03-09 01:15:15,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_230| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_128| Int) (|v_ULTIMATE.start_main_~j~0#1_231| Int) (|v_ULTIMATE.start_new_~p~0#1.base_115| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_124| Int) (|v_ULTIMATE.start_new_~p~0#1.base_114| Int) (|v_ULTIMATE.start_new_~p~0#1.base_113| Int) (|v_ULTIMATE.start_main_#t~ret37#1.base_126| Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (|ULTIMATE.start_main_#t~ret37#1.base| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_230| (+ |v_ULTIMATE.start_main_~j~0#1_231| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |v_ULTIMATE.start_main_~j~0#1_230| 1)) (< |v_ULTIMATE.start_main_~j~0#1_231| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_115| 1) |v_ULTIMATE.start_new_~p~0#1.base_114| 1) |v_ULTIMATE.start_new_~p~0#1.base_113| 1) (select (store (store (store (store (select |c_#memory_$Pointer$#2.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) |ULTIMATE.start_main_#t~ret37#1.base|) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_231| 4)) |v_ULTIMATE.start_main_#t~ret37#1.base_128|) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_126|) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) |v_ULTIMATE.start_main_#t~ret37#1.base_124|) |c_~#slot~0.offset|)) 1))) is different from false