./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_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-?-8fc3dc6-m [2025-03-17 14:17:00,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:17:00,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:17:00,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:17:00,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:17:00,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:17:00,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:17:00,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:17:00,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:17:00,991 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:17:00,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:17:00,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:17:00,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:17:00,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:17:00,992 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:17:00,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:17:00,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:17:00,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:17:00,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:17:00,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:17:00,992 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:17:00,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:17:00,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:17:00,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:17:00,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:17:00,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:17:00,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:17:00,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:17:00,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:17:00,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:17:00,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:17:00,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:17:00,994 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-17 14:17:01,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:17:01,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:17:01,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:17:01,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:17:01,200 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:17:01,200 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-17 14:17:02,323 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6606c4212/36ac74cd287d4a2a99084031bdd6c9f7/FLAG94dea9de8 [2025-03-17 14:17:02,633 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:17:02,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-17 14:17:02,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6606c4212/36ac74cd287d4a2a99084031bdd6c9f7/FLAG94dea9de8 [2025-03-17 14:17:02,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6606c4212/36ac74cd287d4a2a99084031bdd6c9f7 [2025-03-17 14:17:02,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:17:02,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:17:02,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:17:02,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:17:02,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:17:02,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2992ca7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:02, skipping insertion in model container [2025-03-17 14:17:02,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:17:02" (1/1) ... [2025-03-17 14:17:02,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:17:03,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:17:03,330 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:17:03,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:17:03,443 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:17:03,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03 WrapperNode [2025-03-17 14:17:03,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:17:03,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:17:03,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:17:03,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:17:03,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,480 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 171 [2025-03-17 14:17:03,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:17:03,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:17:03,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:17:03,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:17:03,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,503 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, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-03-17 14:17:03,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:17:03,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:17:03,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:17:03,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:17:03,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (1/1) ... [2025-03-17 14:17:03,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:17:03,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:03,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:17:03,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:17:03,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:17:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 14:17:03,580 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 14:17:03,580 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 14:17:03,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:17:03,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:17:03,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:17:03,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:17:03,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:17:03,581 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:17:03,711 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:17:03,712 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:17:04,072 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:17:04,072 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:17:04,295 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:17:04,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:17:04,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:04 BoogieIcfgContainer [2025-03-17 14:17:04,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:17:04,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:17:04,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:17:04,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:17:04,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:17:02" (1/3) ... [2025-03-17 14:17:04,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5d7034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:17:04, skipping insertion in model container [2025-03-17 14:17:04,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:17:03" (2/3) ... [2025-03-17 14:17:04,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5d7034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:17:04, skipping insertion in model container [2025-03-17 14:17:04,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:17:04" (3/3) ... [2025-03-17 14:17:04,304 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2025-03-17 14:17:04,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:17:04,315 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-17 14:17:04,315 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:17:04,363 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:17:04,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 154 flow [2025-03-17 14:17:04,421 INFO L124 PetriNetUnfolderBase]: 3/74 cut-off events. [2025-03-17 14:17:04,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:04,428 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 244 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-17 14:17:04,429 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 154 flow [2025-03-17 14:17:04,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 74 transitions, 151 flow [2025-03-17 14:17:04,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:17:04,451 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;@151e109c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:17:04,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-17 14:17:04,457 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:17:04,458 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-17 14:17:04,458 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:04,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:04,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:17:04,459 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-17 14:17:04,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:04,463 INFO L85 PathProgramCache]: Analyzing trace with hash 487846, now seen corresponding path program 1 times [2025-03-17 14:17:04,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:04,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977129404] [2025-03-17 14:17:04,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:04,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:04,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:17:04,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:17:04,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:04,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:04,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977129404] [2025-03-17 14:17:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977129404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:04,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:04,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299884407] [2025-03-17 14:17:04,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:04,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:04,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:04,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:04,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 75 [2025-03-17 14:17:04,813 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-17 14:17:04,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:04,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 75 [2025-03-17 14:17:04,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:05,005 INFO L124 PetriNetUnfolderBase]: 142/528 cut-off events. [2025-03-17 14:17:05,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:05,008 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 3274 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-17 14:17:05,013 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 37 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2025-03-17 14:17:05,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 245 flow [2025-03-17 14:17:05,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-17 14:17:05,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-17 14:17:05,024 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 151 flow. Second operand 3 states and 165 transitions. [2025-03-17 14:17:05,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 245 flow [2025-03-17 14:17:05,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:05,029 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 150 flow [2025-03-17 14:17:05,031 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-17 14:17:05,034 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-03-17 14:17:05,034 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 150 flow [2025-03-17 14:17:05,035 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-17 14:17:05,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:05,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:17:05,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:17:05,035 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-17 14:17:05,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash 487847, now seen corresponding path program 1 times [2025-03-17 14:17:05,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:05,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971212422] [2025-03-17 14:17:05,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:05,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:17:05,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:17:05,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:05,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971212422] [2025-03-17 14:17:05,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971212422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:05,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:05,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:05,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286375026] [2025-03-17 14:17:05,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:05,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:05,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:05,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:05,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:05,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 75 [2025-03-17 14:17:05,211 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-17 14:17:05,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:05,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 75 [2025-03-17 14:17:05,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:05,335 INFO L124 PetriNetUnfolderBase]: 132/496 cut-off events. [2025-03-17 14:17:05,336 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 14:17:05,337 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 3032 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-17 14:17:05,338 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 35 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-17 14:17:05,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 240 flow [2025-03-17 14:17:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-17 14:17:05,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511111111111111 [2025-03-17 14:17:05,340 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 150 flow. Second operand 3 states and 169 transitions. [2025-03-17 14:17:05,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 240 flow [2025-03-17 14:17:05,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:05,341 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 142 flow [2025-03-17 14:17:05,341 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-17 14:17:05,342 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-03-17 14:17:05,342 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 142 flow [2025-03-17 14:17:05,342 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-17 14:17:05,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:05,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:17:05,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:17:05,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-17 14:17:05,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash 468834036, now seen corresponding path program 1 times [2025-03-17 14:17:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:05,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755668296] [2025-03-17 14:17:05,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:05,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:05,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:17:05,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:17:05,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:05,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:05,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:05,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755668296] [2025-03-17 14:17:05,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755668296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:05,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:05,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:17:05,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014815193] [2025-03-17 14:17:05,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:05,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:17:05,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:05,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:17:05,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:17:05,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 75 [2025-03-17 14:17:05,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:05,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:05,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 75 [2025-03-17 14:17:05,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:05,723 INFO L124 PetriNetUnfolderBase]: 152/522 cut-off events. [2025-03-17 14:17:05,724 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-17 14:17:05,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 522 events. 152/522 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3091 event pairs, 126 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 834. Up to 307 conditions per place. [2025-03-17 14:17:05,729 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 31 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-03-17 14:17:05,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 198 flow [2025-03-17 14:17:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-17 14:17:05,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-17 14:17:05,731 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 142 flow. Second operand 3 states and 153 transitions. [2025-03-17 14:17:05,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 198 flow [2025-03-17 14:17:05,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:05,733 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 128 flow [2025-03-17 14:17:05,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-03-17 14:17:05,734 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -11 predicate places. [2025-03-17 14:17:05,734 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 128 flow [2025-03-17 14:17:05,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:05,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:05,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:17:05,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:17:05,735 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-17 14:17:05,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash 468834037, now seen corresponding path program 1 times [2025-03-17 14:17:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:05,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646542722] [2025-03-17 14:17:05,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:05,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:17:05,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:17:05,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:05,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:17:05,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:05,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646542722] [2025-03-17 14:17:05,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646542722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:05,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:05,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:17:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36678257] [2025-03-17 14:17:05,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:05,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:17:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:05,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:17:05,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:17:06,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-17 14:17:06,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 128 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-17 14:17:06,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:06,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-17 14:17:06,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:06,223 INFO L124 PetriNetUnfolderBase]: 152/525 cut-off events. [2025-03-17 14:17:06,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:17:06,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 525 events. 152/525 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3111 event pairs, 126 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 835. Up to 308 conditions per place. [2025-03-17 14:17:06,226 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 31 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-03-17 14:17:06,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 204 flow [2025-03-17 14:17:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:17:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:17:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2025-03-17 14:17:06,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-03-17 14:17:06,230 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 128 flow. Second operand 4 states and 177 transitions. [2025-03-17 14:17:06,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 204 flow [2025-03-17 14:17:06,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:06,235 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 157 flow [2025-03-17 14:17:06,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-17 14:17:06,235 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-03-17 14:17:06,235 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 157 flow [2025-03-17 14:17:06,236 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-17 14:17:06,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:06,236 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1] [2025-03-17 14:17:06,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:17:06,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-17 14:17:06,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1854007553, now seen corresponding path program 1 times [2025-03-17 14:17:06,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:06,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046891792] [2025-03-17 14:17:06,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:06,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:06,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:17:06,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:17:06,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:06,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:06,553 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-17 14:17:06,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046891792] [2025-03-17 14:17:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046891792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642881279] [2025-03-17 14:17:06,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:06,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:06,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:06,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:06,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:17:06,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:17:06,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:17:06,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:06,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:06,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:17:06,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:06,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:06,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 14:17:06,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:06,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 14:17:06,816 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-17 14:17:06,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:06,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:06,910 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-17 14:17:06,996 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-17 14:17:06,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642881279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:06,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:06,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-17 14:17:06,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296790866] [2025-03-17 14:17:06,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:06,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 14:17:06,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:06,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 14:17:06,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:17:08,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 75 [2025-03-17 14:17:08,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 157 flow. Second operand has 15 states, 15 states have (on average 39.4) internal successors, (591), 15 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:08,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:08,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 75 [2025-03-17 14:17:08,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:08,467 INFO L124 PetriNetUnfolderBase]: 174/550 cut-off events. [2025-03-17 14:17:08,467 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:17:08,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 550 events. 174/550 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3109 event pairs, 0 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 939. Up to 188 conditions per place. [2025-03-17 14:17:08,470 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 59 selfloop transitions, 11 changer transitions 0/99 dead transitions. [2025-03-17 14:17:08,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 391 flow [2025-03-17 14:17:08,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:17:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:17:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 341 transitions. [2025-03-17 14:17:08,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6495238095238095 [2025-03-17 14:17:08,471 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 157 flow. Second operand 7 states and 341 transitions. [2025-03-17 14:17:08,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 391 flow [2025-03-17 14:17:08,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:08,473 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 213 flow [2025-03-17 14:17:08,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-03-17 14:17:08,473 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2025-03-17 14:17:08,473 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 213 flow [2025-03-17 14:17:08,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 39.4) internal successors, (591), 15 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:08,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:08,474 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:08,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:08,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:08,675 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-17 14:17:08,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash 127824243, now seen corresponding path program 1 times [2025-03-17 14:17:08,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:08,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674755398] [2025-03-17 14:17:08,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:08,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:08,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:17:08,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:17:08,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:08,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:17:08,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:08,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674755398] [2025-03-17 14:17:08,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674755398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:08,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:08,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:17:08,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314888204] [2025-03-17 14:17:08,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:08,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:08,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:08,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:08,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 75 [2025-03-17 14:17:08,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 213 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-17 14:17:08,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:08,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 75 [2025-03-17 14:17:08,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:08,841 INFO L124 PetriNetUnfolderBase]: 254/899 cut-off events. [2025-03-17 14:17:08,841 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-17 14:17:08,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 899 events. 254/899 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5426 event pairs, 108 based on Foata normal form. 10/753 useless extension candidates. Maximal degree in co-relation 1572. Up to 300 conditions per place. [2025-03-17 14:17:08,847 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 51 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-03-17 14:17:08,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 89 transitions, 373 flow [2025-03-17 14:17:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-03-17 14:17:08,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488888888888889 [2025-03-17 14:17:08,848 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 213 flow. Second operand 3 states and 191 transitions. [2025-03-17 14:17:08,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 89 transitions, 373 flow [2025-03-17 14:17:08,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:08,850 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 234 flow [2025-03-17 14:17:08,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2025-03-17 14:17:08,850 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-03-17 14:17:08,850 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 234 flow [2025-03-17 14:17:08,853 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-17 14:17:08,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:08,853 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:08,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:17:08,853 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-17 14:17:08,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:08,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1677993054, now seen corresponding path program 1 times [2025-03-17 14:17:08,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:08,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802374229] [2025-03-17 14:17:08,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:08,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:08,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:17:08,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:17:08,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:08,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:17:08,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:08,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802374229] [2025-03-17 14:17:08,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802374229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:08,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:08,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:08,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198399337] [2025-03-17 14:17:08,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:08,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:08,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:08,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:08,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:08,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 75 [2025-03-17 14:17:08,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 234 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-17 14:17:08,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:08,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 75 [2025-03-17 14:17:08,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:09,081 INFO L124 PetriNetUnfolderBase]: 279/939 cut-off events. [2025-03-17 14:17:09,082 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-17 14:17:09,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 939 events. 279/939 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5576 event pairs, 176 based on Foata normal form. 0/804 useless extension candidates. Maximal degree in co-relation 1750. Up to 473 conditions per place. [2025-03-17 14:17:09,085 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 53 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-03-17 14:17:09,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 84 transitions, 405 flow [2025-03-17 14:17:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-03-17 14:17:09,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2025-03-17 14:17:09,086 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 234 flow. Second operand 3 states and 174 transitions. [2025-03-17 14:17:09,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 84 transitions, 405 flow [2025-03-17 14:17:09,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 84 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:09,090 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 228 flow [2025-03-17 14:17:09,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-03-17 14:17:09,092 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2025-03-17 14:17:09,092 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 228 flow [2025-03-17 14:17:09,092 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-17 14:17:09,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:09,093 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:09,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:17:09,093 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-17 14:17:09,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:09,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1677993053, now seen corresponding path program 1 times [2025-03-17 14:17:09,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:09,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034148505] [2025-03-17 14:17:09,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:09,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:09,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:17:09,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:17:09,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:09,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:09,159 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-17 14:17:09,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:09,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034148505] [2025-03-17 14:17:09,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034148505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:09,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887526056] [2025-03-17 14:17:09,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:09,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:09,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:09,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:09,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:17:09,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:17:09,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:17:09,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:09,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:09,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:17:09,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:09,270 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-17 14:17:09,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:09,296 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-17 14:17:09,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887526056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:09,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:09,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 14:17:09,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027536626] [2025-03-17 14:17:09,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:09,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:17:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:09,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:17:09,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:17:09,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-03-17 14:17:09,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 228 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-17 14:17:09,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:09,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-03-17 14:17:09,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:09,724 INFO L124 PetriNetUnfolderBase]: 702/2303 cut-off events. [2025-03-17 14:17:09,724 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-03-17 14:17:09,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4191 conditions, 2303 events. 702/2303 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 13088 event pairs, 27 based on Foata normal form. 54/1987 useless extension candidates. Maximal degree in co-relation 4176. Up to 234 conditions per place. [2025-03-17 14:17:09,732 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 146 selfloop transitions, 16 changer transitions 0/191 dead transitions. [2025-03-17 14:17:09,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 191 transitions, 869 flow [2025-03-17 14:17:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:17:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:17:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 531 transitions. [2025-03-17 14:17:09,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-03-17 14:17:09,734 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 228 flow. Second operand 8 states and 531 transitions. [2025-03-17 14:17:09,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 191 transitions, 869 flow [2025-03-17 14:17:09,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 191 transitions, 839 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:09,738 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 330 flow [2025-03-17 14:17:09,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=330, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2025-03-17 14:17:09,739 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 11 predicate places. [2025-03-17 14:17:09,740 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 330 flow [2025-03-17 14:17:09,740 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-17 14:17:09,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:09,741 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 1, 1] [2025-03-17 14:17:09,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:09,945 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-17 14:17:09,945 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-17 14:17:09,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1917167331, now seen corresponding path program 2 times [2025-03-17 14:17:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:09,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877254267] [2025-03-17 14:17:09,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:09,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:17:09,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:17:09,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:17:09,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:10,653 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-17 14:17:10,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:10,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877254267] [2025-03-17 14:17:10,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877254267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:10,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960767195] [2025-03-17 14:17:10,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:10,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:10,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:10,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:10,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:17:10,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:17:10,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:17:10,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:17:10,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:10,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 14:17:10,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:10,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:10,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 14:17:10,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:10,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 14:17:10,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:10,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 14:17:11,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:11,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 14:17:11,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:11,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 14:17:11,117 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-17 14:17:11,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:11,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:11,217 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-17 14:17:11,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:11,334 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-17 14:17:11,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:11,477 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-17 14:17:11,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:11,611 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-17 14:17:11,743 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-17 14:17:11,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960767195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:11,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:11,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2025-03-17 14:17:11,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357469438] [2025-03-17 14:17:11,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:11,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 14:17:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:11,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 14:17:11,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 14:17:16,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:17:16,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 330 flow. Second operand has 33 states, 33 states have (on average 35.45454545454545) internal successors, (1170), 33 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:16,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:16,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:17:16,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:17,559 INFO L124 PetriNetUnfolderBase]: 802/2682 cut-off events. [2025-03-17 14:17:17,560 INFO L125 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2025-03-17 14:17:17,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 2682 events. 802/2682 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 16497 event pairs, 224 based on Foata normal form. 6/2174 useless extension candidates. Maximal degree in co-relation 5050. Up to 855 conditions per place. [2025-03-17 14:17:17,574 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 93 selfloop transitions, 26 changer transitions 0/147 dead transitions. [2025-03-17 14:17:17,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 147 transitions, 890 flow [2025-03-17 14:17:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:17:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:17:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 596 transitions. [2025-03-17 14:17:17,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5676190476190476 [2025-03-17 14:17:17,578 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 330 flow. Second operand 14 states and 596 transitions. [2025-03-17 14:17:17,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 147 transitions, 890 flow [2025-03-17 14:17:17,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 147 transitions, 872 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 14:17:17,583 INFO L231 Difference]: Finished difference. Result has 106 places, 84 transitions, 501 flow [2025-03-17 14:17:17,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=501, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2025-03-17 14:17:17,584 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 31 predicate places. [2025-03-17 14:17:17,584 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 501 flow [2025-03-17 14:17:17,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 35.45454545454545) internal successors, (1170), 33 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:17,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:17,584 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:17,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:17:17,785 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-17 14:17:17,785 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-17 14:17:17,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash 653258875, now seen corresponding path program 2 times [2025-03-17 14:17:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:17,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591590543] [2025-03-17 14:17:17,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:17,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:17,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 14:17:17,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 32 statements. [2025-03-17 14:17:17,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:17:17,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:17,845 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-17 14:17:17,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591590543] [2025-03-17 14:17:17,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591590543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:17,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:17:17,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:17:17,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915351095] [2025-03-17 14:17:17,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:17,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:17:17,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:17,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:17:17,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:17:17,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 75 [2025-03-17 14:17:17,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 501 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-17 14:17:17,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:17,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 75 [2025-03-17 14:17:17,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:18,124 INFO L124 PetriNetUnfolderBase]: 685/2352 cut-off events. [2025-03-17 14:17:18,125 INFO L125 PetriNetUnfolderBase]: For 1442/1442 co-relation queries the response was YES. [2025-03-17 14:17:18,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4744 conditions, 2352 events. 685/2352 cut-off events. For 1442/1442 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 13769 event pairs, 504 based on Foata normal form. 68/2061 useless extension candidates. Maximal degree in co-relation 4713. Up to 1260 conditions per place. [2025-03-17 14:17:18,138 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 73 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-03-17 14:17:18,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 104 transitions, 803 flow [2025-03-17 14:17:18,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:17:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:17:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-03-17 14:17:18,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7822222222222223 [2025-03-17 14:17:18,139 INFO L175 Difference]: Start difference. First operand has 106 places, 84 transitions, 501 flow. Second operand 3 states and 176 transitions. [2025-03-17 14:17:18,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 104 transitions, 803 flow [2025-03-17 14:17:18,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 757 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-17 14:17:18,147 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 462 flow [2025-03-17 14:17:18,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2025-03-17 14:17:18,149 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 26 predicate places. [2025-03-17 14:17:18,150 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 462 flow [2025-03-17 14:17:18,150 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-17 14:17:18,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:18,150 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:18,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:17:18,150 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-17 14:17:18,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:18,151 INFO L85 PathProgramCache]: Analyzing trace with hash 716567291, now seen corresponding path program 1 times [2025-03-17 14:17:18,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:18,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528358560] [2025-03-17 14:17:18,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:18,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:18,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:17:18,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:17:18,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:18,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:18,340 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-17 14:17:18,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:18,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528358560] [2025-03-17 14:17:18,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528358560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:18,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25801273] [2025-03-17 14:17:18,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:18,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:18,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:18,344 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:18,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:17:18,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:17:18,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:17:18,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:18,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:18,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:17:18,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:18,536 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-17 14:17:18,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:18,594 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-17 14:17:18,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25801273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:18,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:18,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-17 14:17:18,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840511384] [2025-03-17 14:17:18,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:18,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:17:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:18,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:17:18,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:17:18,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-03-17 14:17:18,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 462 flow. Second operand has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:18,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:18,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-03-17 14:17:18,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:19,328 INFO L124 PetriNetUnfolderBase]: 1142/3774 cut-off events. [2025-03-17 14:17:19,328 INFO L125 PetriNetUnfolderBase]: For 2020/2020 co-relation queries the response was YES. [2025-03-17 14:17:19,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7423 conditions, 3774 events. 1142/3774 cut-off events. For 2020/2020 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 21601 event pairs, 88 based on Foata normal form. 44/3193 useless extension candidates. Maximal degree in co-relation 7392. Up to 235 conditions per place. [2025-03-17 14:17:19,347 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 234 selfloop transitions, 25 changer transitions 0/286 dead transitions. [2025-03-17 14:17:19,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 286 transitions, 1577 flow [2025-03-17 14:17:19,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:17:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:17:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 806 transitions. [2025-03-17 14:17:19,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8955555555555555 [2025-03-17 14:17:19,350 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 462 flow. Second operand 12 states and 806 transitions. [2025-03-17 14:17:19,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 286 transitions, 1577 flow [2025-03-17 14:17:19,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 286 transitions, 1531 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:17:19,358 INFO L231 Difference]: Finished difference. Result has 115 places, 84 transitions, 574 flow [2025-03-17 14:17:19,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=574, PETRI_PLACES=115, PETRI_TRANSITIONS=84} [2025-03-17 14:17:19,358 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 40 predicate places. [2025-03-17 14:17:19,358 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 84 transitions, 574 flow [2025-03-17 14:17:19,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.07692307692308) internal successors, (625), 13 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:19,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:19,359 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 1, 1] [2025-03-17 14:17:19,366 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-17 14:17:19,563 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-17 14:17:19,563 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-17 14:17:19,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash -994204071, now seen corresponding path program 3 times [2025-03-17 14:17:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:19,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489360279] [2025-03-17 14:17:19,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:17:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:19,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-03-17 14:17:19,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:17:19,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:17:19,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:19,990 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-17 14:17:19,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:19,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489360279] [2025-03-17 14:17:19,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489360279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:19,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023360867] [2025-03-17 14:17:19,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:17:19,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:19,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:19,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:19,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:17:20,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-03-17 14:17:52,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:17:52,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:17:52,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:52,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:17:52,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:52,845 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-17 14:17:52,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:17:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023360867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:17:52,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:17:52,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2025-03-17 14:17:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172372899] [2025-03-17 14:17:52,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:17:52,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:17:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:52,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:17:52,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:17:52,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-03-17 14:17:52,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 84 transitions, 574 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-17 14:17:52,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:52,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-03-17 14:17:52,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:53,603 INFO L124 PetriNetUnfolderBase]: 1131/3759 cut-off events. [2025-03-17 14:17:53,603 INFO L125 PetriNetUnfolderBase]: For 2250/2250 co-relation queries the response was YES. [2025-03-17 14:17:53,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 3759 events. 1131/3759 cut-off events. For 2250/2250 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 21571 event pairs, 80 based on Foata normal form. 11/3145 useless extension candidates. Maximal degree in co-relation 7349. Up to 228 conditions per place. [2025-03-17 14:17:53,622 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 242 selfloop transitions, 23 changer transitions 1/292 dead transitions. [2025-03-17 14:17:53,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 292 transitions, 1615 flow [2025-03-17 14:17:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:17:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 14:17:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 853 transitions. [2025-03-17 14:17:53,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748717948717949 [2025-03-17 14:17:53,624 INFO L175 Difference]: Start difference. First operand has 115 places, 84 transitions, 574 flow. Second operand 13 states and 853 transitions. [2025-03-17 14:17:53,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 292 transitions, 1615 flow [2025-03-17 14:17:53,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 292 transitions, 1513 flow, removed 0 selfloop flow, removed 15 redundant places. [2025-03-17 14:17:53,633 INFO L231 Difference]: Finished difference. Result has 111 places, 80 transitions, 487 flow [2025-03-17 14:17:53,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=487, PETRI_PLACES=111, PETRI_TRANSITIONS=80} [2025-03-17 14:17:53,634 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 36 predicate places. [2025-03-17 14:17:53,634 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 80 transitions, 487 flow [2025-03-17 14:17:53,634 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-17 14:17:53,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:53,634 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:53,657 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-17 14:17:53,834 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-17 14:17:53,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-17 14:17:53,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash 940540371, now seen corresponding path program 2 times [2025-03-17 14:17:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:53,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236475353] [2025-03-17 14:17:53,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:53,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 14:17:53,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 14:17:53,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:17:53,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:54,303 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-17 14:17:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:54,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236475353] [2025-03-17 14:17:54,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236475353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:54,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288253967] [2025-03-17 14:17:54,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:17:54,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:54,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:54,306 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:17:54,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:17:54,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 14:17:54,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 14:17:54,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:17:54,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:54,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:17:54,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:17:54,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:17:54,687 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-17 14:17:54,691 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:17:54,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:17:54,716 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-17 14:17:54,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:17:54,843 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-17 14:17:54,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:17:54,855 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-17 14:17:55,127 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-17 14:17:55,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288253967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:17:55,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:17:55,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2025-03-17 14:17:55,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904136777] [2025-03-17 14:17:55,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:17:55,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 14:17:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:17:55,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 14:17:55,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2025-03-17 14:17:56,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 75 [2025-03-17 14:17:56,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 80 transitions, 487 flow. Second operand has 31 states, 31 states have (on average 40.67741935483871) internal successors, (1261), 31 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:56,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:17:56,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 75 [2025-03-17 14:17:56,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:17:59,019 INFO L124 PetriNetUnfolderBase]: 2713/8850 cut-off events. [2025-03-17 14:17:59,019 INFO L125 PetriNetUnfolderBase]: For 4193/4193 co-relation queries the response was YES. [2025-03-17 14:17:59,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16611 conditions, 8850 events. 2713/8850 cut-off events. For 4193/4193 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 65972 event pairs, 138 based on Foata normal form. 114/7400 useless extension candidates. Maximal degree in co-relation 16583. Up to 342 conditions per place. [2025-03-17 14:17:59,049 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 627 selfloop transitions, 120 changer transitions 2/775 dead transitions. [2025-03-17 14:17:59,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 775 transitions, 3907 flow [2025-03-17 14:17:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 14:17:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-17 14:17:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2530 transitions. [2025-03-17 14:17:59,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-17 14:17:59,056 INFO L175 Difference]: Start difference. First operand has 111 places, 80 transitions, 487 flow. Second operand 46 states and 2530 transitions. [2025-03-17 14:17:59,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 775 transitions, 3907 flow [2025-03-17 14:17:59,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 775 transitions, 3789 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-17 14:17:59,071 INFO L231 Difference]: Finished difference. Result has 188 places, 177 transitions, 1471 flow [2025-03-17 14:17:59,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1471, PETRI_PLACES=188, PETRI_TRANSITIONS=177} [2025-03-17 14:17:59,072 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 113 predicate places. [2025-03-17 14:17:59,072 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 177 transitions, 1471 flow [2025-03-17 14:17:59,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 40.67741935483871) internal successors, (1261), 31 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:17:59,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:17:59,073 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:17:59,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:17:59,273 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-17 14:17:59,274 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-17 14:17:59,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:17:59,275 INFO L85 PathProgramCache]: Analyzing trace with hash -236145428, now seen corresponding path program 1 times [2025-03-17 14:17:59,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:17:59,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478637129] [2025-03-17 14:17:59,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:59,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:17:59,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 14:17:59,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 14:17:59,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:17:59,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:17:59,791 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-17 14:17:59,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:17:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478637129] [2025-03-17 14:17:59,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478637129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:17:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807108774] [2025-03-17 14:17:59,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:17:59,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:17:59,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:17:59,793 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-17 14:17:59,795 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-17 14:17:59,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 14:18:00,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 14:18:00,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:00,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:00,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:18:00,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:18:00,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:00,150 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-17 14:18:00,154 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:18:00,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:18:00,168 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-17 14:18:00,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:18:00,302 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-17 14:18:00,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:18:00,313 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-17 14:18:00,507 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-17 14:18:00,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807108774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:18:00,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:18:00,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 27 [2025-03-17 14:18:00,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901726604] [2025-03-17 14:18:00,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:18:00,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 14:18:00,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:18:00,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 14:18:00,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2025-03-17 14:18:01,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-17 14:18:01,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 177 transitions, 1471 flow. Second operand has 29 states, 29 states have (on average 36.758620689655174) internal successors, (1066), 29 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:01,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:18:01,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-17 14:18:01,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:18:03,472 INFO L124 PetriNetUnfolderBase]: 2784/8787 cut-off events. [2025-03-17 14:18:03,473 INFO L125 PetriNetUnfolderBase]: For 72574/72685 co-relation queries the response was YES. [2025-03-17 14:18:03,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29308 conditions, 8787 events. 2784/8787 cut-off events. For 72574/72685 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 64632 event pairs, 290 based on Foata normal form. 46/7384 useless extension candidates. Maximal degree in co-relation 29236. Up to 671 conditions per place. [2025-03-17 14:18:03,537 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 425 selfloop transitions, 83 changer transitions 1/535 dead transitions. [2025-03-17 14:18:03,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 535 transitions, 5349 flow [2025-03-17 14:18:03,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 14:18:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 14:18:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1104 transitions. [2025-03-17 14:18:03,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6690909090909091 [2025-03-17 14:18:03,539 INFO L175 Difference]: Start difference. First operand has 188 places, 177 transitions, 1471 flow. Second operand 22 states and 1104 transitions. [2025-03-17 14:18:03,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 535 transitions, 5349 flow [2025-03-17 14:18:03,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 535 transitions, 5258 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-17 14:18:03,614 INFO L231 Difference]: Finished difference. Result has 201 places, 201 transitions, 1684 flow [2025-03-17 14:18:03,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1684, PETRI_PLACES=201, PETRI_TRANSITIONS=201} [2025-03-17 14:18:03,615 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 126 predicate places. [2025-03-17 14:18:03,616 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 201 transitions, 1684 flow [2025-03-17 14:18:03,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 36.758620689655174) internal successors, (1066), 29 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:18:03,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:18:03,616 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:18:03,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:18:03,817 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-17 14:18:03,817 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-17 14:18:03,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:18:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash -908019050, now seen corresponding path program 1 times [2025-03-17 14:18:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:18:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134626699] [2025-03-17 14:18:03,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:03,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:18:03,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:18:03,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:18:03,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:03,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 102 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:18:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:18:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134626699] [2025-03-17 14:18:06,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134626699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:18:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029930665] [2025-03-17 14:18:06,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:18:06,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:18:06,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:18:06,685 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-17 14:18:06,686 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-17 14:18:06,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:18:06,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:18:06,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:18:06,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:18:06,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-17 14:18:06,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:18:06,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:18:06,959 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-17 14:18:06,970 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-17 14:18:06,971 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-17 14:18:06,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:06,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 14:18:06,997 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-17 14:18:06,998 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-17 14:18:07,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:07,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 14:18:07,035 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-17 14:18:07,035 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-17 14:18:07,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:07,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 14:18:07,063 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-17 14:18:07,063 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-17 14:18:07,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:07,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 14:18:07,096 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-03-17 14:18:07,096 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 21 treesize of output 29 [2025-03-17 14:18:07,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:07,137 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 37 treesize of output 17 [2025-03-17 14:18:07,174 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-03-17 14:18:07,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2025-03-17 14:18:07,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:07,231 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 37 treesize of output 17 [2025-03-17 14:18:07,268 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-03-17 14:18:07,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2025-03-17 14:18:07,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:07,315 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 37 treesize of output 17 [2025-03-17 14:18:07,355 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-03-17 14:18:07,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2025-03-17 14:18:07,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:07,399 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 37 treesize of output 17 [2025-03-17 14:18:07,447 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-03-17 14:18:07,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2025-03-17 14:18:07,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:18:07,497 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 37 treesize of output 17 [2025-03-17 14:18:07,583 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-03-17 14:18:07,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2025-03-17 14:18:07,626 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 25 treesize of output 13 [2025-03-17 14:18:07,644 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-17 14:18:07,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:18:27,244 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (v_ArrVal_2871 Int) (|v_ULTIMATE.start_main_~j~0#1_227| Int) (v_ArrVal_2865 Int) (|v_ULTIMATE.start_main_~j~0#1_228| Int) (v_ArrVal_2868 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_228| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (= (select (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2865) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_228| 4)) v_ArrVal_2868) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_227| 4)) v_ArrVal_2871) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_227| (+ |v_ULTIMATE.start_main_~j~0#1_228| 1)))) is different from false [2025-03-17 14:18:28,726 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_118| Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (v_ArrVal_2871 Int) (|v_ULTIMATE.start_main_~j~0#1_227| Int) (v_ArrVal_2865 Int) (|v_ULTIMATE.start_main_~j~0#1_228| Int) (v_ArrVal_2868 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_228| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (= (select (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_118| 1) |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2865) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_228| 4)) v_ArrVal_2868) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_227| 4)) v_ArrVal_2871) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_227| (+ |v_ULTIMATE.start_main_~j~0#1_228| 1)))) is different from false [2025-03-17 14:18:30,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_118| Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (v_ArrVal_2871 Int) (|v_ULTIMATE.start_main_~j~0#1_227| Int) (v_ArrVal_2862 Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (v_ArrVal_2865 Int) (|v_ULTIMATE.start_main_~j~0#1_228| Int) (v_ArrVal_2868 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_228| (+ |v_ULTIMATE.start_main_~j~0#1_229| 1)) (= (select (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_118| 1) |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2862) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) v_ArrVal_2865) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_228| 4)) v_ArrVal_2868) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_227| 4)) v_ArrVal_2871) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_227| (+ |v_ULTIMATE.start_main_~j~0#1_228| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |c_ULTIMATE.start_main_~j~0#1| 1)))) is different from false [2025-03-17 14:18:32,052 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_119| Int) (|v_ULTIMATE.start_new_~p~0#1.base_118| Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (v_ArrVal_2871 Int) (|v_ULTIMATE.start_main_~j~0#1_227| Int) (v_ArrVal_2862 Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (v_ArrVal_2865 Int) (|v_ULTIMATE.start_main_~j~0#1_228| Int) (v_ArrVal_2868 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_228| (+ |v_ULTIMATE.start_main_~j~0#1_229| 1)) (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_119| 1) |v_ULTIMATE.start_new_~p~0#1.base_118| 1) |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2862) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) v_ArrVal_2865) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_228| 4)) v_ArrVal_2868) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_227| 4)) v_ArrVal_2871) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_227| (+ |v_ULTIMATE.start_main_~j~0#1_228| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |c_ULTIMATE.start_main_~j~0#1| 1)))) is different from false [2025-03-17 14:18:33,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_230| Int) (|v_ULTIMATE.start_new_~p~0#1.base_119| Int) (v_ArrVal_2859 Int) (|v_ULTIMATE.start_new_~p~0#1.base_118| Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (v_ArrVal_2871 Int) (|v_ULTIMATE.start_main_~j~0#1_227| Int) (v_ArrVal_2862 Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (v_ArrVal_2865 Int) (|v_ULTIMATE.start_main_~j~0#1_228| Int) (v_ArrVal_2868 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_228| (+ |v_ULTIMATE.start_main_~j~0#1_229| 1)) (< |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)) (< |v_ULTIMATE.start_main_~j~0#1_227| (+ |v_ULTIMATE.start_main_~j~0#1_228| 1)) (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_119| 1) |v_ULTIMATE.start_new_~p~0#1.base_118| 1) |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2859) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) v_ArrVal_2862) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) v_ArrVal_2865) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_228| 4)) v_ArrVal_2868) (+ |c_~#slot~0.offset| (* |v_ULTIMATE.start_main_~j~0#1_227| 4)) v_ArrVal_2871) |c_~#slot~0.offset|)) 1))) is different from false