./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-2.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/heap-manipulation/merge_sort-2.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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:10:13,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:10:13,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:10:13,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:10:13,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:10:14,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:10:14,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:10:14,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:10:14,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:10:14,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:10:14,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:10:14,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:10:14,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:10:14,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:10:14,011 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:10:14,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:10:14,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:10:14,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:10:14,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:10:14,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:10:14,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:10:14,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:10:14,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:10:14,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:10:14,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:10:14,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:10:14,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:10:14,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:10:14,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:10:14,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:10:14,014 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2025-03-17 12:10:14,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:10:14,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:10:14,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:10:14,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:10:14,223 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:10:14,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2025-03-17 12:10:15,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b3abb8/56c5287549a94e239e2aaf49f837133a/FLAG51eb7af89 [2025-03-17 12:10:15,595 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:10:15,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2025-03-17 12:10:15,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b3abb8/56c5287549a94e239e2aaf49f837133a/FLAG51eb7af89 [2025-03-17 12:10:15,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b3abb8/56c5287549a94e239e2aaf49f837133a [2025-03-17 12:10:15,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:10:15,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:10:15,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:10:15,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:10:15,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:10:15,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:10:15" (1/1) ... [2025-03-17 12:10:15,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a4544d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:15, skipping insertion in model container [2025-03-17 12:10:15,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:10:15" (1/1) ... [2025-03-17 12:10:15,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:10:16,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:10:16,171 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:10:16,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:10:16,247 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:10:16,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16 WrapperNode [2025-03-17 12:10:16,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:10:16,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:10:16,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:10:16,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:10:16,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,279 INFO L138 Inliner]: procedures = 125, calls = 84, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 278 [2025-03-17 12:10:16,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:10:16,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:10:16,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:10:16,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:10:16,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,313 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 10, 34, 3]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 3, 8, 2]. [2025-03-17 12:10:16,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,327 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:10:16,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:10:16,336 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:10:16,336 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:10:16,337 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (1/1) ... [2025-03-17 12:10:16,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:10:16,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:16,367 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 12:10:16,371 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 12:10:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:10:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:10:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 12:10:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 12:10:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2025-03-17 12:10:16,388 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2025-03-17 12:10:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-17 12:10:16,388 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-17 12:10:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:10:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 12:10:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 12:10:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:10:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:10:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:10:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 12:10:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 12:10:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:10:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:10:16,491 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:10:16,493 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:10:16,936 INFO L? ?]: Removed 239 outVars from TransFormulas that were not future-live. [2025-03-17 12:10:16,936 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:10:16,950 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:10:16,952 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:10:16,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:10:16 BoogieIcfgContainer [2025-03-17 12:10:16,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:10:16,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:10:16,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:10:16,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:10:16,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:10:15" (1/3) ... [2025-03-17 12:10:16,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa992cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:10:16, skipping insertion in model container [2025-03-17 12:10:16,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:16" (2/3) ... [2025-03-17 12:10:16,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa992cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:10:16, skipping insertion in model container [2025-03-17 12:10:16,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:10:16" (3/3) ... [2025-03-17 12:10:16,960 INFO L128 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2025-03-17 12:10:16,975 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:10:16,979 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG merge_sort-2.i that has 3 procedures, 261 locations, 1 initial locations, 20 loop locations, and 105 error locations. [2025-03-17 12:10:17,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:10:17,021 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;@342c7d3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:10:17,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-03-17 12:10:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 138 states have (on average 2.1956521739130435) internal successors, (303), 258 states have internal predecessors, (303), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 12:10:17,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:10:17,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:17,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:10:17,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:17,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash 10895418, now seen corresponding path program 1 times [2025-03-17 12:10:17,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:17,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761309383] [2025-03-17 12:10:17,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:17,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:10:17,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:10:17,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:17,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:17,120 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 12:10:17,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761309383] [2025-03-17 12:10:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761309383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:17,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:10:17,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863702791] [2025-03-17 12:10:17,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:17,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 12:10:17,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:17,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 12:10:17,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:10:17,146 INFO L87 Difference]: Start difference. First operand has 261 states, 138 states have (on average 2.1956521739130435) internal successors, (303), 258 states have internal predecessors, (303), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 12:10:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:17,170 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2025-03-17 12:10:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 12:10:17,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2025-03-17 12:10:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:17,180 INFO L225 Difference]: With dead ends: 258 [2025-03-17 12:10:17,180 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 12:10:17,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:10:17,185 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:17,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:10:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 12:10:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-17 12:10:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 135 states have (on average 1.9555555555555555) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 281 transitions. [2025-03-17 12:10:17,230 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 281 transitions. Word has length 4 [2025-03-17 12:10:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:17,231 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 281 transitions. [2025-03-17 12:10:17,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 12:10:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2025-03-17 12:10:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:10:17,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:17,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:10:17,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:10:17,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:17,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash 337759387, now seen corresponding path program 1 times [2025-03-17 12:10:17,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:17,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121701438] [2025-03-17 12:10:17,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:17,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:10:17,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:10:17,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:17,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:17,296 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 12:10:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:17,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121701438] [2025-03-17 12:10:17,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121701438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:17,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:17,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:10:17,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769105766] [2025-03-17 12:10:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:17,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:10:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:17,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:10:17,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:17,299 INFO L87 Difference]: Start difference. First operand 256 states and 281 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 12:10:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:17,522 INFO L93 Difference]: Finished difference Result 388 states and 432 transitions. [2025-03-17 12:10:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:10:17,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2025-03-17 12:10:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:17,524 INFO L225 Difference]: With dead ends: 388 [2025-03-17 12:10:17,524 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 12:10:17,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:17,524 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 132 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:17,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 393 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 12:10:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 259. [2025-03-17 12:10:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 138 states have (on average 1.9420289855072463) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 285 transitions. [2025-03-17 12:10:17,541 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 285 transitions. Word has length 5 [2025-03-17 12:10:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:17,541 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 285 transitions. [2025-03-17 12:10:17,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 12:10:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 285 transitions. [2025-03-17 12:10:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:10:17,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:17,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:10:17,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:10:17,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:17,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash 337761279, now seen corresponding path program 1 times [2025-03-17 12:10:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721376303] [2025-03-17 12:10:17,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:17,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:10:17,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:10:17,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:17,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:17,590 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 12:10:17,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721376303] [2025-03-17 12:10:17,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721376303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:17,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:17,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:10:17,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046564485] [2025-03-17 12:10:17,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:17,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:10:17,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:17,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:10:17,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:17,591 INFO L87 Difference]: Start difference. First operand 259 states and 285 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 12:10:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:17,710 INFO L93 Difference]: Finished difference Result 257 states and 283 transitions. [2025-03-17 12:10:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:10:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-03-17 12:10:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:17,712 INFO L225 Difference]: With dead ends: 257 [2025-03-17 12:10:17,712 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 12:10:17,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:17,712 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:17,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 437 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 12:10:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-03-17 12:10:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 138 states have (on average 1.9275362318840579) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 283 transitions. [2025-03-17 12:10:17,728 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 283 transitions. Word has length 5 [2025-03-17 12:10:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:17,728 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 283 transitions. [2025-03-17 12:10:17,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 12:10:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 283 transitions. [2025-03-17 12:10:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:10:17,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:17,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:10:17,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:10:17,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:17,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash 337761280, now seen corresponding path program 1 times [2025-03-17 12:10:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724700223] [2025-03-17 12:10:17,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:17,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:17,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:10:17,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:10:17,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:17,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:17,809 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 12:10:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:17,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724700223] [2025-03-17 12:10:17,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724700223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:17,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:17,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:10:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473376739] [2025-03-17 12:10:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:17,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:10:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:17,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:10:17,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:17,812 INFO L87 Difference]: Start difference. First operand 257 states and 283 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 12:10:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:17,927 INFO L93 Difference]: Finished difference Result 255 states and 281 transitions. [2025-03-17 12:10:17,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:10:17,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-03-17 12:10:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:17,930 INFO L225 Difference]: With dead ends: 255 [2025-03-17 12:10:17,930 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 12:10:17,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:17,930 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 6 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:17,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 445 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 12:10:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-03-17 12:10:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 138 states have (on average 1.9130434782608696) internal successors, (264), 252 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 281 transitions. [2025-03-17 12:10:17,938 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 281 transitions. Word has length 5 [2025-03-17 12:10:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:17,938 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 281 transitions. [2025-03-17 12:10:17,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 12:10:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 281 transitions. [2025-03-17 12:10:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 12:10:17,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:17,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:17,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:10:17,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:17,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1830426825, now seen corresponding path program 1 times [2025-03-17 12:10:17,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:17,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029416346] [2025-03-17 12:10:17,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:17,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:17,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 12:10:17,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 12:10:17,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:17,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:17,975 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 12:10:17,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:17,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029416346] [2025-03-17 12:10:17,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029416346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:17,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:17,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:10:17,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031860544] [2025-03-17 12:10:17,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:17,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:10:17,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:17,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:10:17,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:17,977 INFO L87 Difference]: Start difference. First operand 255 states and 281 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:10:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:18,002 INFO L93 Difference]: Finished difference Result 267 states and 292 transitions. [2025-03-17 12:10:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:10:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2025-03-17 12:10:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:18,004 INFO L225 Difference]: With dead ends: 267 [2025-03-17 12:10:18,004 INFO L226 Difference]: Without dead ends: 266 [2025-03-17 12:10:18,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:18,005 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 12 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:18,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 533 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:10:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-17 12:10:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2025-03-17 12:10:18,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 137 states have (on average 1.9124087591240877) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2025-03-17 12:10:18,011 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 7 [2025-03-17 12:10:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:18,011 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2025-03-17 12:10:18,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:10:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2025-03-17 12:10:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 12:10:18,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:18,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:18,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:10:18,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:18,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 708231478, now seen corresponding path program 1 times [2025-03-17 12:10:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539449806] [2025-03-17 12:10:18,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:18,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 12:10:18,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 12:10:18,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:18,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:18,071 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 12:10:18,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:18,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539449806] [2025-03-17 12:10:18,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539449806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:18,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:18,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:10:18,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610397098] [2025-03-17 12:10:18,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:18,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:10:18,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:18,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:10:18,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:18,072 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12:10:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:18,215 INFO L93 Difference]: Finished difference Result 252 states and 277 transitions. [2025-03-17 12:10:18,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:10:18,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2025-03-17 12:10:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:18,216 INFO L225 Difference]: With dead ends: 252 [2025-03-17 12:10:18,216 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 12:10:18,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:18,217 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:18,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 436 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 12:10:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-17 12:10:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 137 states have (on average 1.897810218978102) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 277 transitions. [2025-03-17 12:10:18,221 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 277 transitions. Word has length 10 [2025-03-17 12:10:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:18,221 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 277 transitions. [2025-03-17 12:10:18,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12:10:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 277 transitions. [2025-03-17 12:10:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 12:10:18,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:18,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:18,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:10:18,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:18,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash 708231479, now seen corresponding path program 1 times [2025-03-17 12:10:18,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:18,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982575680] [2025-03-17 12:10:18,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:18,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 12:10:18,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 12:10:18,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:18,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:18,297 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 12:10:18,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:18,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982575680] [2025-03-17 12:10:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982575680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:10:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403770788] [2025-03-17 12:10:18,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:18,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:10:18,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:18,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:10:18,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:18,299 INFO L87 Difference]: Start difference. First operand 252 states and 277 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12:10:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:18,397 INFO L93 Difference]: Finished difference Result 250 states and 275 transitions. [2025-03-17 12:10:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:10:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2025-03-17 12:10:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:18,398 INFO L225 Difference]: With dead ends: 250 [2025-03-17 12:10:18,398 INFO L226 Difference]: Without dead ends: 250 [2025-03-17 12:10:18,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:18,398 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:18,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 444 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:18,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-17 12:10:18,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2025-03-17 12:10:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 137 states have (on average 1.8832116788321167) internal successors, (258), 247 states have internal predecessors, (258), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 275 transitions. [2025-03-17 12:10:18,403 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 275 transitions. Word has length 10 [2025-03-17 12:10:18,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:18,404 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 275 transitions. [2025-03-17 12:10:18,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12:10:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 275 transitions. [2025-03-17 12:10:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:10:18,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:18,404 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:18,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:10:18,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:18,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1056520148, now seen corresponding path program 1 times [2025-03-17 12:10:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457852731] [2025-03-17 12:10:18,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:18,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:10:18,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:10:18,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:18,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:18,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:18,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457852731] [2025-03-17 12:10:18,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457852731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:18,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:18,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:10:18,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608661655] [2025-03-17 12:10:18,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:18,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:10:18,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:18,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:10:18,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:10:18,476 INFO L87 Difference]: Start difference. First operand 250 states and 275 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 12:10:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:18,528 INFO L93 Difference]: Finished difference Result 302 states and 338 transitions. [2025-03-17 12:10:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:10:18,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2025-03-17 12:10:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:18,531 INFO L225 Difference]: With dead ends: 302 [2025-03-17 12:10:18,531 INFO L226 Difference]: Without dead ends: 302 [2025-03-17 12:10:18,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:18,531 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 114 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:18,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 712 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:10:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-17 12:10:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 250. [2025-03-17 12:10:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 137 states have (on average 1.8759124087591241) internal successors, (257), 247 states have internal predecessors, (257), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 274 transitions. [2025-03-17 12:10:18,538 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 274 transitions. Word has length 16 [2025-03-17 12:10:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:18,538 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 274 transitions. [2025-03-17 12:10:18,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 12:10:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 274 transitions. [2025-03-17 12:10:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 12:10:18,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:18,538 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:18,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:10:18,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:18,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1703263608, now seen corresponding path program 1 times [2025-03-17 12:10:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:18,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917843251] [2025-03-17 12:10:18,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:18,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:18,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:10:18,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:10:18,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:18,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:18,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:18,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917843251] [2025-03-17 12:10:18,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917843251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:18,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:18,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:10:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541594901] [2025-03-17 12:10:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:18,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:18,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:18,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:18,620 INFO L87 Difference]: Start difference. First operand 250 states and 274 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 12:10:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:18,845 INFO L93 Difference]: Finished difference Result 251 states and 277 transitions. [2025-03-17 12:10:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:18,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) Word has length 18 [2025-03-17 12:10:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:18,847 INFO L225 Difference]: With dead ends: 251 [2025-03-17 12:10:18,847 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 12:10:18,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:18,847 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 148 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:18,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 531 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 12:10:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 243. [2025-03-17 12:10:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 139 states have (on average 1.8129496402877698) internal successors, (252), 240 states have internal predecessors, (252), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 269 transitions. [2025-03-17 12:10:18,857 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 269 transitions. Word has length 18 [2025-03-17 12:10:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:18,857 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 269 transitions. [2025-03-17 12:10:18,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 12:10:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 269 transitions. [2025-03-17 12:10:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 12:10:18,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:18,857 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:18,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:10:18,858 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:18,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:18,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1703263607, now seen corresponding path program 1 times [2025-03-17 12:10:18,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:18,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922109630] [2025-03-17 12:10:18,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:18,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:10:18,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:10:18,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:18,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:18,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:18,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922109630] [2025-03-17 12:10:18,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922109630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:18,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:18,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:10:18,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398994180] [2025-03-17 12:10:18,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:18,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:18,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:18,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:18,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:18,973 INFO L87 Difference]: Start difference. First operand 243 states and 269 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 12:10:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:19,235 INFO L93 Difference]: Finished difference Result 330 states and 369 transitions. [2025-03-17 12:10:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:19,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) Word has length 18 [2025-03-17 12:10:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:19,237 INFO L225 Difference]: With dead ends: 330 [2025-03-17 12:10:19,237 INFO L226 Difference]: Without dead ends: 330 [2025-03-17 12:10:19,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:19,237 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 183 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:19,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 611 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-17 12:10:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 290. [2025-03-17 12:10:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 186 states have (on average 1.7473118279569892) internal successors, (325), 287 states have internal predecessors, (325), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 342 transitions. [2025-03-17 12:10:19,242 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 342 transitions. Word has length 18 [2025-03-17 12:10:19,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:19,242 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 342 transitions. [2025-03-17 12:10:19,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 12:10:19,243 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 342 transitions. [2025-03-17 12:10:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:10:19,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:19,243 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:19,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:10:19,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:19,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash -453017754, now seen corresponding path program 1 times [2025-03-17 12:10:19,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:19,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597207314] [2025-03-17 12:10:19,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:19,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:19,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:10:19,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:10:19,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:19,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:19,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:19,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597207314] [2025-03-17 12:10:19,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597207314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:19,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:19,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:19,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055025066] [2025-03-17 12:10:19,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:19,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:19,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:19,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:19,290 INFO L87 Difference]: Start difference. First operand 290 states and 342 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:19,358 INFO L93 Difference]: Finished difference Result 319 states and 355 transitions. [2025-03-17 12:10:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:19,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 12:10:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:19,360 INFO L225 Difference]: With dead ends: 319 [2025-03-17 12:10:19,360 INFO L226 Difference]: Without dead ends: 319 [2025-03-17 12:10:19,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:19,361 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 181 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:19,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 889 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-17 12:10:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2025-03-17 12:10:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 186 states have (on average 1.7311827956989247) internal successors, (322), 286 states have internal predecessors, (322), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 338 transitions. [2025-03-17 12:10:19,365 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 338 transitions. Word has length 20 [2025-03-17 12:10:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:19,365 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 338 transitions. [2025-03-17 12:10:19,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 338 transitions. [2025-03-17 12:10:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:10:19,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:19,366 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:19,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:10:19,366 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:19,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1595318957, now seen corresponding path program 1 times [2025-03-17 12:10:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:19,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614950246] [2025-03-17 12:10:19,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:19,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:10:19,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:10:19,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:19,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:10:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614950246] [2025-03-17 12:10:19,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614950246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:19,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:19,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:19,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629289451] [2025-03-17 12:10:19,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:19,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:19,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:19,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:19,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:19,442 INFO L87 Difference]: Start difference. First operand 289 states and 338 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:19,538 INFO L93 Difference]: Finished difference Result 288 states and 335 transitions. [2025-03-17 12:10:19,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:10:19,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-17 12:10:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:19,540 INFO L225 Difference]: With dead ends: 288 [2025-03-17 12:10:19,540 INFO L226 Difference]: Without dead ends: 288 [2025-03-17 12:10:19,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:19,540 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 15 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:19,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 886 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-17 12:10:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-03-17 12:10:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 186 states have (on average 1.7204301075268817) internal successors, (320), 285 states have internal predecessors, (320), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 335 transitions. [2025-03-17 12:10:19,545 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 335 transitions. Word has length 27 [2025-03-17 12:10:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:19,545 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 335 transitions. [2025-03-17 12:10:19,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 335 transitions. [2025-03-17 12:10:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:10:19,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:19,546 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:19,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:10:19,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:19,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash 767141046, now seen corresponding path program 1 times [2025-03-17 12:10:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:19,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523571090] [2025-03-17 12:10:19,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:19,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:10:19,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:10:19,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:19,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:10:19,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:19,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523571090] [2025-03-17 12:10:19,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523571090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:19,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:19,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557849723] [2025-03-17 12:10:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:19,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:19,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:19,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:19,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:19,617 INFO L87 Difference]: Start difference. First operand 288 states and 335 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:19,706 INFO L93 Difference]: Finished difference Result 287 states and 332 transitions. [2025-03-17 12:10:19,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:10:19,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-17 12:10:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:19,707 INFO L225 Difference]: With dead ends: 287 [2025-03-17 12:10:19,707 INFO L226 Difference]: Without dead ends: 287 [2025-03-17 12:10:19,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:19,708 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 15 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:19,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 882 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-17 12:10:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-03-17 12:10:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 186 states have (on average 1.7096774193548387) internal successors, (318), 284 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 332 transitions. [2025-03-17 12:10:19,712 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 332 transitions. Word has length 27 [2025-03-17 12:10:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:19,712 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 332 transitions. [2025-03-17 12:10:19,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 332 transitions. [2025-03-17 12:10:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:10:19,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:19,713 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:19,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:10:19,713 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:19,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:19,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1704171364, now seen corresponding path program 1 times [2025-03-17 12:10:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:19,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836008819] [2025-03-17 12:10:19,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:19,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:10:19,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:10:19,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:19,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836008819] [2025-03-17 12:10:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836008819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:19,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:19,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:10:19,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805046904] [2025-03-17 12:10:19,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:19,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:10:19,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:19,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:10:19,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:19,871 INFO L87 Difference]: Start difference. First operand 287 states and 332 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:20,047 INFO L93 Difference]: Finished difference Result 316 states and 347 transitions. [2025-03-17 12:10:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:20,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 12:10:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:20,049 INFO L225 Difference]: With dead ends: 316 [2025-03-17 12:10:20,049 INFO L226 Difference]: Without dead ends: 316 [2025-03-17 12:10:20,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:10:20,049 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 158 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:20,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1229 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-17 12:10:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 287. [2025-03-17 12:10:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 186 states have (on average 1.7043010752688172) internal successors, (317), 284 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 331 transitions. [2025-03-17 12:10:20,054 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 331 transitions. Word has length 30 [2025-03-17 12:10:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:20,054 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 331 transitions. [2025-03-17 12:10:20,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 331 transitions. [2025-03-17 12:10:20,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:10:20,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:20,054 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:20,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:10:20,055 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:20,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:20,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1440495195, now seen corresponding path program 1 times [2025-03-17 12:10:20,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:20,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191271087] [2025-03-17 12:10:20,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:20,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:20,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:10:20,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:10:20,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:20,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:20,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191271087] [2025-03-17 12:10:20,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191271087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:20,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:20,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:10:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217100424] [2025-03-17 12:10:20,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:20,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:10:20,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:20,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:10:20,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:20,231 INFO L87 Difference]: Start difference. First operand 287 states and 331 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 12:10:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:20,559 INFO L93 Difference]: Finished difference Result 315 states and 346 transitions. [2025-03-17 12:10:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:20,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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) Word has length 29 [2025-03-17 12:10:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:20,560 INFO L225 Difference]: With dead ends: 315 [2025-03-17 12:10:20,560 INFO L226 Difference]: Without dead ends: 315 [2025-03-17 12:10:20,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:10:20,561 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 155 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:20,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 871 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-17 12:10:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 287. [2025-03-17 12:10:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 186 states have (on average 1.6989247311827957) internal successors, (316), 284 states have internal predecessors, (316), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 330 transitions. [2025-03-17 12:10:20,565 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 330 transitions. Word has length 29 [2025-03-17 12:10:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:20,565 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 330 transitions. [2025-03-17 12:10:20,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 12:10:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 330 transitions. [2025-03-17 12:10:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:10:20,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:20,566 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:20,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:10:20,566 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:20,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1440495194, now seen corresponding path program 1 times [2025-03-17 12:10:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:20,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546911668] [2025-03-17 12:10:20,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:20,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:10:20,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:10:20,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:20,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:20,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:20,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546911668] [2025-03-17 12:10:20,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546911668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:20,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:20,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:10:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111238153] [2025-03-17 12:10:20,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:20,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:10:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:20,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:10:20,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:20,828 INFO L87 Difference]: Start difference. First operand 287 states and 330 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 12:10:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:21,189 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2025-03-17 12:10:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:21,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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) Word has length 29 [2025-03-17 12:10:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:21,191 INFO L225 Difference]: With dead ends: 314 [2025-03-17 12:10:21,191 INFO L226 Difference]: Without dead ends: 314 [2025-03-17 12:10:21,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:10:21,191 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 150 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:21,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 876 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-17 12:10:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 287. [2025-03-17 12:10:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 186 states have (on average 1.6935483870967742) internal successors, (315), 284 states have internal predecessors, (315), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 329 transitions. [2025-03-17 12:10:21,196 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 329 transitions. Word has length 29 [2025-03-17 12:10:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:21,196 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 329 transitions. [2025-03-17 12:10:21,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 12:10:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 329 transitions. [2025-03-17 12:10:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:10:21,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:21,197 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:21,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:10:21,197 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:21,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:21,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1117105627, now seen corresponding path program 1 times [2025-03-17 12:10:21,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:21,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921236543] [2025-03-17 12:10:21,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:21,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:21,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:10:21,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:10:21,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:21,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:21,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921236543] [2025-03-17 12:10:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921236543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:21,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:10:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088498450] [2025-03-17 12:10:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:21,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:10:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:21,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:10:21,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:21,298 INFO L87 Difference]: Start difference. First operand 287 states and 329 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:21,468 INFO L93 Difference]: Finished difference Result 313 states and 343 transitions. [2025-03-17 12:10:21,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:21,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 12:10:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:21,469 INFO L225 Difference]: With dead ends: 313 [2025-03-17 12:10:21,469 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 12:10:21,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:10:21,470 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 152 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:21,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1229 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 12:10:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 287. [2025-03-17 12:10:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 186 states have (on average 1.6881720430107527) internal successors, (314), 284 states have internal predecessors, (314), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2025-03-17 12:10:21,475 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 30 [2025-03-17 12:10:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:21,475 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2025-03-17 12:10:21,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2025-03-17 12:10:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:10:21,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:21,476 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:21,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:10:21,476 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:21,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash 590144358, now seen corresponding path program 1 times [2025-03-17 12:10:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:21,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412795765] [2025-03-17 12:10:21,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:21,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:10:21,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:10:21,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:21,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:21,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412795765] [2025-03-17 12:10:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412795765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:10:21,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799816381] [2025-03-17 12:10:21,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:21,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:10:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:21,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:10:21,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:21,618 INFO L87 Difference]: Start difference. First operand 287 states and 328 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 12:10:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:21,943 INFO L93 Difference]: Finished difference Result 312 states and 342 transitions. [2025-03-17 12:10:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:21,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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) Word has length 29 [2025-03-17 12:10:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:21,945 INFO L225 Difference]: With dead ends: 312 [2025-03-17 12:10:21,945 INFO L226 Difference]: Without dead ends: 312 [2025-03-17 12:10:21,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:10:21,945 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 147 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:21,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 871 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-17 12:10:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 288. [2025-03-17 12:10:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 187 states have (on average 1.6898395721925135) internal successors, (316), 285 states have internal predecessors, (316), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 330 transitions. [2025-03-17 12:10:21,950 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 330 transitions. Word has length 29 [2025-03-17 12:10:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:21,950 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 330 transitions. [2025-03-17 12:10:21,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 12:10:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 330 transitions. [2025-03-17 12:10:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:10:21,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:21,950 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:21,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:10:21,951 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:21,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash 590144359, now seen corresponding path program 1 times [2025-03-17 12:10:21,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:21,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591685636] [2025-03-17 12:10:21,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:21,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:21,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:10:21,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:10:21,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:21,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:22,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591685636] [2025-03-17 12:10:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591685636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:22,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:22,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:10:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496924754] [2025-03-17 12:10:22,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:22,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 12:10:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:22,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 12:10:22,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:10:22,177 INFO L87 Difference]: Start difference. First operand 288 states and 330 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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 12:10:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:22,649 INFO L93 Difference]: Finished difference Result 311 states and 341 transitions. [2025-03-17 12:10:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:10:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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) Word has length 29 [2025-03-17 12:10:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:22,650 INFO L225 Difference]: With dead ends: 311 [2025-03-17 12:10:22,650 INFO L226 Difference]: Without dead ends: 311 [2025-03-17 12:10:22,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:10:22,651 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 146 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:22,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1014 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:10:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-17 12:10:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 288. [2025-03-17 12:10:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 187 states have (on average 1.6844919786096257) internal successors, (315), 285 states have internal predecessors, (315), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 329 transitions. [2025-03-17 12:10:22,655 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 329 transitions. Word has length 29 [2025-03-17 12:10:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:22,656 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 329 transitions. [2025-03-17 12:10:22,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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 12:10:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 329 transitions. [2025-03-17 12:10:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:10:22,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:22,656 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:22,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:10:22,657 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1476344280, now seen corresponding path program 1 times [2025-03-17 12:10:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63283295] [2025-03-17 12:10:22,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:22,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:22,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:10:22,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:10:22,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:22,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:22,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:22,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:22,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63283295] [2025-03-17 12:10:22,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63283295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:22,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:22,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 12:10:22,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216247288] [2025-03-17 12:10:22,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:22,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:10:22,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:22,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:10:22,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:10:22,955 INFO L87 Difference]: Start difference. First operand 288 states and 329 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:23,302 INFO L93 Difference]: Finished difference Result 310 states and 339 transitions. [2025-03-17 12:10:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:10:23,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 12:10:23,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:23,304 INFO L225 Difference]: With dead ends: 310 [2025-03-17 12:10:23,304 INFO L226 Difference]: Without dead ends: 310 [2025-03-17 12:10:23,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-17 12:10:23,305 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 144 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:23,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1763 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-17 12:10:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2025-03-17 12:10:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 187 states have (on average 1.679144385026738) internal successors, (314), 285 states have internal predecessors, (314), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 328 transitions. [2025-03-17 12:10:23,310 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 328 transitions. Word has length 34 [2025-03-17 12:10:23,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:23,311 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 328 transitions. [2025-03-17 12:10:23,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 328 transitions. [2025-03-17 12:10:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:10:23,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:23,311 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:23,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 12:10:23,312 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:23,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash 215859607, now seen corresponding path program 1 times [2025-03-17 12:10:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:23,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317934612] [2025-03-17 12:10:23,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:23,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:10:23,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:10:23,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:23,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:23,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:23,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317934612] [2025-03-17 12:10:23,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317934612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:23,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:23,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 12:10:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808869403] [2025-03-17 12:10:23,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:23,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:10:23,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:23,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:10:23,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:10:23,598 INFO L87 Difference]: Start difference. First operand 288 states and 328 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:23,946 INFO L93 Difference]: Finished difference Result 309 states and 337 transitions. [2025-03-17 12:10:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:10:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 12:10:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:23,947 INFO L225 Difference]: With dead ends: 309 [2025-03-17 12:10:23,947 INFO L226 Difference]: Without dead ends: 309 [2025-03-17 12:10:23,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-17 12:10:23,948 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 142 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:23,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1763 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-17 12:10:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 289. [2025-03-17 12:10:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.675531914893617) internal successors, (315), 286 states have internal predecessors, (315), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 329 transitions. [2025-03-17 12:10:23,952 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 329 transitions. Word has length 34 [2025-03-17 12:10:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:23,952 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 329 transitions. [2025-03-17 12:10:23,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 329 transitions. [2025-03-17 12:10:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:10:23,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:23,953 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:23,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:10:23,953 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:23,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:23,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1474529053, now seen corresponding path program 1 times [2025-03-17 12:10:23,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:23,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599658226] [2025-03-17 12:10:23,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:23,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:23,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:10:23,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:10:23,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:23,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599658226] [2025-03-17 12:10:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599658226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458389212] [2025-03-17 12:10:24,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:24,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:24,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:24,211 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 12:10:24,213 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 12:10:24,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:10:24,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:10:24,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:24,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:24,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 12:10:24,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:24,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:24,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:24,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:24,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458389212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:24,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:24,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2025-03-17 12:10:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931408727] [2025-03-17 12:10:24,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:24,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:10:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:24,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:10:24,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:10:24,547 INFO L87 Difference]: Start difference. First operand 289 states and 329 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 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 12:10:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:24,804 INFO L93 Difference]: Finished difference Result 363 states and 410 transitions. [2025-03-17 12:10:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:10:24,804 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 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) Word has length 34 [2025-03-17 12:10:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:24,805 INFO L225 Difference]: With dead ends: 363 [2025-03-17 12:10:24,805 INFO L226 Difference]: Without dead ends: 363 [2025-03-17 12:10:24,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:10:24,807 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 137 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:24,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 2174 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:24,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-17 12:10:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 305. [2025-03-17 12:10:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 204 states have (on average 1.6274509803921569) internal successors, (332), 302 states have internal predecessors, (332), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 346 transitions. [2025-03-17 12:10:24,814 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 346 transitions. Word has length 34 [2025-03-17 12:10:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:24,814 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 346 transitions. [2025-03-17 12:10:24,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 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 12:10:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 346 transitions. [2025-03-17 12:10:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:10:24,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:24,815 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:24,822 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 12:10:25,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 12:10:25,019 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:25,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1414304536, now seen corresponding path program 1 times [2025-03-17 12:10:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:25,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023897968] [2025-03-17 12:10:25,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:25,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:25,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:10:25,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:10:25,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:25,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:10:25,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:25,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023897968] [2025-03-17 12:10:25,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023897968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:25,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:25,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:10:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204573912] [2025-03-17 12:10:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:25,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:10:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:25,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:10:25,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:10:25,069 INFO L87 Difference]: Start difference. First operand 305 states and 346 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 12:10:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:25,221 INFO L93 Difference]: Finished difference Result 305 states and 348 transitions. [2025-03-17 12:10:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:10:25,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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) Word has length 36 [2025-03-17 12:10:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:25,222 INFO L225 Difference]: With dead ends: 305 [2025-03-17 12:10:25,222 INFO L226 Difference]: Without dead ends: 305 [2025-03-17 12:10:25,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:10:25,223 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 101 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:25,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 416 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-17 12:10:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-17 12:10:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 206 states have (on average 1.6213592233009708) internal successors, (334), 302 states have internal predecessors, (334), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 348 transitions. [2025-03-17 12:10:25,227 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 348 transitions. Word has length 36 [2025-03-17 12:10:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:25,227 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 348 transitions. [2025-03-17 12:10:25,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 12:10:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 348 transitions. [2025-03-17 12:10:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:10:25,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:25,228 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:25,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 12:10:25,228 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1414304535, now seen corresponding path program 1 times [2025-03-17 12:10:25,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:25,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191383406] [2025-03-17 12:10:25,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:25,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:25,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:10:25,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:10:25,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:25,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:25,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:25,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191383406] [2025-03-17 12:10:25,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191383406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:25,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:25,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:10:25,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399670197] [2025-03-17 12:10:25,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:25,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:25,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:25,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:25,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:25,352 INFO L87 Difference]: Start difference. First operand 305 states and 348 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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 12:10:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:25,595 INFO L93 Difference]: Finished difference Result 332 states and 365 transitions. [2025-03-17 12:10:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:25,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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) Word has length 36 [2025-03-17 12:10:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:25,596 INFO L225 Difference]: With dead ends: 332 [2025-03-17 12:10:25,596 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 12:10:25,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:25,597 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 89 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:25,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 590 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 12:10:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 311. [2025-03-17 12:10:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 212 states have (on average 1.6132075471698113) internal successors, (342), 308 states have internal predecessors, (342), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 356 transitions. [2025-03-17 12:10:25,601 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 356 transitions. Word has length 36 [2025-03-17 12:10:25,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:25,601 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 356 transitions. [2025-03-17 12:10:25,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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 12:10:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 356 transitions. [2025-03-17 12:10:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 12:10:25,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:25,602 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:25,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 12:10:25,602 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:25,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash -893769128, now seen corresponding path program 1 times [2025-03-17 12:10:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999345225] [2025-03-17 12:10:25,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:25,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:25,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:10:25,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:10:25,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:25,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:25,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:25,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999345225] [2025-03-17 12:10:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999345225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:25,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:25,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:10:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813516165] [2025-03-17 12:10:25,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:25,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:10:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:25,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:10:25,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:25,652 INFO L87 Difference]: Start difference. First operand 311 states and 356 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 12:10:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:25,728 INFO L93 Difference]: Finished difference Result 385 states and 427 transitions. [2025-03-17 12:10:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:25,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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) Word has length 37 [2025-03-17 12:10:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:25,730 INFO L225 Difference]: With dead ends: 385 [2025-03-17 12:10:25,730 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 12:10:25,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:25,730 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 241 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:25,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1032 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 12:10:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 311. [2025-03-17 12:10:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 212 states have (on average 1.6084905660377358) internal successors, (341), 308 states have internal predecessors, (341), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 355 transitions. [2025-03-17 12:10:25,736 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 355 transitions. Word has length 37 [2025-03-17 12:10:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:25,736 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 355 transitions. [2025-03-17 12:10:25,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 12:10:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 355 transitions. [2025-03-17 12:10:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:10:25,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:25,737 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:25,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 12:10:25,737 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1940619997, now seen corresponding path program 1 times [2025-03-17 12:10:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:25,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657959367] [2025-03-17 12:10:25,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:25,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:10:25,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:10:25,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:25,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:10:25,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:25,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657959367] [2025-03-17 12:10:25,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657959367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:25,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:25,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581840618] [2025-03-17 12:10:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:25,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:10:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:25,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:10:25,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:25,798 INFO L87 Difference]: Start difference. First operand 311 states and 355 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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 12:10:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:26,020 INFO L93 Difference]: Finished difference Result 310 states and 351 transitions. [2025-03-17 12:10:26,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:26,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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) Word has length 38 [2025-03-17 12:10:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:26,022 INFO L225 Difference]: With dead ends: 310 [2025-03-17 12:10:26,022 INFO L226 Difference]: Without dead ends: 310 [2025-03-17 12:10:26,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:26,023 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 112 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:26,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 739 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-17 12:10:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2025-03-17 12:10:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 212 states have (on average 1.580188679245283) internal successors, (335), 305 states have internal predecessors, (335), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 349 transitions. [2025-03-17 12:10:26,032 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 349 transitions. Word has length 38 [2025-03-17 12:10:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:26,033 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 349 transitions. [2025-03-17 12:10:26,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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 12:10:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 349 transitions. [2025-03-17 12:10:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:10:26,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:26,034 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:26,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 12:10:26,034 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:26,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:26,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1940619996, now seen corresponding path program 1 times [2025-03-17 12:10:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:26,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996107194] [2025-03-17 12:10:26,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:26,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:26,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:10:26,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:10:26,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:26,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:26,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:26,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996107194] [2025-03-17 12:10:26,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996107194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:26,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:26,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:10:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337229496] [2025-03-17 12:10:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:26,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:26,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:26,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:26,120 INFO L87 Difference]: Start difference. First operand 308 states and 349 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 12:10:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:26,348 INFO L93 Difference]: Finished difference Result 318 states and 350 transitions. [2025-03-17 12:10:26,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:26,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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) Word has length 38 [2025-03-17 12:10:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:26,350 INFO L225 Difference]: With dead ends: 318 [2025-03-17 12:10:26,350 INFO L226 Difference]: Without dead ends: 318 [2025-03-17 12:10:26,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:26,350 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 83 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:26,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 597 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-17 12:10:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 308. [2025-03-17 12:10:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 212 states have (on average 1.5660377358490567) internal successors, (332), 305 states have internal predecessors, (332), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 346 transitions. [2025-03-17 12:10:26,355 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 346 transitions. Word has length 38 [2025-03-17 12:10:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:26,355 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 346 transitions. [2025-03-17 12:10:26,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 12:10:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 346 transitions. [2025-03-17 12:10:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:10:26,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:26,355 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:26,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 12:10:26,356 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:26,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:26,356 INFO L85 PathProgramCache]: Analyzing trace with hash -914145673, now seen corresponding path program 1 times [2025-03-17 12:10:26,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:26,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071349221] [2025-03-17 12:10:26,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:26,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:26,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:10:26,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:10:26,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:26,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:26,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071349221] [2025-03-17 12:10:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071349221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:26,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:10:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65335456] [2025-03-17 12:10:26,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:26,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:10:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:26,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:10:26,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:26,412 INFO L87 Difference]: Start difference. First operand 308 states and 346 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:26,476 INFO L93 Difference]: Finished difference Result 319 states and 351 transitions. [2025-03-17 12:10:26,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:26,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-17 12:10:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:26,478 INFO L225 Difference]: With dead ends: 319 [2025-03-17 12:10:26,478 INFO L226 Difference]: Without dead ends: 319 [2025-03-17 12:10:26,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:10:26,479 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 173 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:26,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1057 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:10:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-17 12:10:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 308. [2025-03-17 12:10:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 212 states have (on average 1.5613207547169812) internal successors, (331), 305 states have internal predecessors, (331), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 345 transitions. [2025-03-17 12:10:26,484 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 345 transitions. Word has length 40 [2025-03-17 12:10:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:26,485 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 345 transitions. [2025-03-17 12:10:26,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 345 transitions. [2025-03-17 12:10:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:10:26,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:26,485 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:26,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 12:10:26,487 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:26,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1725017020, now seen corresponding path program 1 times [2025-03-17 12:10:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967057189] [2025-03-17 12:10:26,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:26,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:10:26,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:10:26,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:26,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967057189] [2025-03-17 12:10:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967057189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480749571] [2025-03-17 12:10:26,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:26,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:26,711 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 12:10:26,713 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 12:10:26,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:10:26,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:10:26,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:26,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:26,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:10:26,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:26,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:26,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:26,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480749571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:27,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2025-03-17 12:10:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525978344] [2025-03-17 12:10:27,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:10:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:27,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:10:27,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:10:27,109 INFO L87 Difference]: Start difference. First operand 308 states and 345 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 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 12:10:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:27,418 INFO L93 Difference]: Finished difference Result 359 states and 400 transitions. [2025-03-17 12:10:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:10:27,418 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 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) Word has length 40 [2025-03-17 12:10:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:27,420 INFO L225 Difference]: With dead ends: 359 [2025-03-17 12:10:27,420 INFO L226 Difference]: Without dead ends: 359 [2025-03-17 12:10:27,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-17 12:10:27,420 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 36 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:27,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2788 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-17 12:10:27,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 323. [2025-03-17 12:10:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 227 states have (on average 1.524229074889868) internal successors, (346), 320 states have internal predecessors, (346), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 360 transitions. [2025-03-17 12:10:27,429 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 360 transitions. Word has length 40 [2025-03-17 12:10:27,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:27,429 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 360 transitions. [2025-03-17 12:10:27,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 14 states have internal predecessors, (83), 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 12:10:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 360 transitions. [2025-03-17 12:10:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 12:10:27,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:27,430 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:27,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 12:10:27,636 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,SelfDestructingSolverStorable28 [2025-03-17 12:10:27,636 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:27,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:27,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1782080624, now seen corresponding path program 1 times [2025-03-17 12:10:27,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:27,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496456526] [2025-03-17 12:10:27,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:27,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 12:10:27,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 12:10:27,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:27,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:27,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496456526] [2025-03-17 12:10:27,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496456526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632551621] [2025-03-17 12:10:27,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:27,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:27,930 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 12:10:27,933 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 12:10:28,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 12:10:28,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 12:10:28,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:28,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:28,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:10:28,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:28,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:28,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:28,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:28,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632551621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:28,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:28,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 12 [2025-03-17 12:10:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162679539] [2025-03-17 12:10:28,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:28,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 12:10:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:28,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 12:10:28,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:10:28,348 INFO L87 Difference]: Start difference. First operand 323 states and 360 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:28,584 INFO L93 Difference]: Finished difference Result 358 states and 398 transitions. [2025-03-17 12:10:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:10:28,585 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 12:10:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:28,585 INFO L225 Difference]: With dead ends: 358 [2025-03-17 12:10:28,585 INFO L226 Difference]: Without dead ends: 358 [2025-03-17 12:10:28,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:10:28,586 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 50 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:28,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1724 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-17 12:10:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 328. [2025-03-17 12:10:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 232 states have (on average 1.5129310344827587) internal successors, (351), 325 states have internal predecessors, (351), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 365 transitions. [2025-03-17 12:10:28,593 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 365 transitions. Word has length 43 [2025-03-17 12:10:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:28,593 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 365 transitions. [2025-03-17 12:10:28,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 365 transitions. [2025-03-17 12:10:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 12:10:28,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:28,594 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:28,601 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 12:10:28,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:28,799 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:28,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:28,799 INFO L85 PathProgramCache]: Analyzing trace with hash -617708750, now seen corresponding path program 1 times [2025-03-17 12:10:28,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:28,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770792362] [2025-03-17 12:10:28,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:28,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:28,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 12:10:28,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 12:10:28,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:28,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770792362] [2025-03-17 12:10:28,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770792362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:28,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:28,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 12:10:28,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851977253] [2025-03-17 12:10:28,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:28,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:10:28,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:28,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:10:28,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:10:28,976 INFO L87 Difference]: Start difference. First operand 328 states and 365 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:29,246 INFO L93 Difference]: Finished difference Result 372 states and 407 transitions. [2025-03-17 12:10:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:10:29,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-17 12:10:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:29,248 INFO L225 Difference]: With dead ends: 372 [2025-03-17 12:10:29,248 INFO L226 Difference]: Without dead ends: 372 [2025-03-17 12:10:29,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:10:29,248 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 201 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:29,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1719 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-17 12:10:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 340. [2025-03-17 12:10:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 244 states have (on average 1.4959016393442623) internal successors, (365), 337 states have internal predecessors, (365), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 379 transitions. [2025-03-17 12:10:29,253 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 379 transitions. Word has length 46 [2025-03-17 12:10:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:29,253 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 379 transitions. [2025-03-17 12:10:29,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 379 transitions. [2025-03-17 12:10:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 12:10:29,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:29,254 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:29,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 12:10:29,255 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:29,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1282301652, now seen corresponding path program 2 times [2025-03-17 12:10:29,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:29,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255145541] [2025-03-17 12:10:29,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:10:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:29,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-17 12:10:29,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 12:10:29,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:10:29,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:29,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:29,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255145541] [2025-03-17 12:10:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255145541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:29,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601785786] [2025-03-17 12:10:29,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:10:29,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:29,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:29,638 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 12:10:29,639 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 12:10:29,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-17 12:10:29,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 12:10:29,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:10:29,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:29,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 12:10:29,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:29,767 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 12:10:29,795 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:10:29,795 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 19 treesize of output 16 [2025-03-17 12:10:29,815 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:10:29,816 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 14 treesize of output 13 [2025-03-17 12:10:29,840 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 12:10:29,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 12:10:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:30,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:30,221 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 16 treesize of output 14 [2025-03-17 12:10:30,226 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 24 treesize of output 20 [2025-03-17 12:10:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:30,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601785786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:30,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:30,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 24 [2025-03-17 12:10:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453137161] [2025-03-17 12:10:30,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:30,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 12:10:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:30,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 12:10:30,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-03-17 12:10:30,423 INFO L87 Difference]: Start difference. First operand 340 states and 379 transitions. Second operand has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 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 12:10:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:31,206 INFO L93 Difference]: Finished difference Result 373 states and 415 transitions. [2025-03-17 12:10:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:10:31,207 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 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) Word has length 45 [2025-03-17 12:10:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:31,208 INFO L225 Difference]: With dead ends: 373 [2025-03-17 12:10:31,208 INFO L226 Difference]: Without dead ends: 373 [2025-03-17 12:10:31,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 12:10:31,209 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 557 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:31,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1880 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 12:10:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-17 12:10:31,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 342. [2025-03-17 12:10:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 246 states have (on average 1.4959349593495934) internal successors, (368), 339 states have internal predecessors, (368), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 382 transitions. [2025-03-17 12:10:31,215 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 382 transitions. Word has length 45 [2025-03-17 12:10:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:31,215 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 382 transitions. [2025-03-17 12:10:31,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 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 12:10:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 382 transitions. [2025-03-17 12:10:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 12:10:31,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:31,216 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:31,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 12:10:31,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:31,420 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:31,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1282301651, now seen corresponding path program 1 times [2025-03-17 12:10:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:31,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043213548] [2025-03-17 12:10:31,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:31,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 12:10:31,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 12:10:31,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:31,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:31,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043213548] [2025-03-17 12:10:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043213548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583126296] [2025-03-17 12:10:31,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:31,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:31,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:31,857 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 12:10:31,859 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 12:10:31,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 12:10:31,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 12:10:31,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:31,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:31,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-17 12:10:31,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:31,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:10:31,986 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 12:10:32,045 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:10:32,045 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 17 treesize of output 21 [2025-03-17 12:10:32,054 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 12:10:32,121 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:10:32,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:10:32,143 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 12:10:32,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 12:10:32,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 12:10:32,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-17 12:10:32,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:32,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-03-17 12:10:32,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:10:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:32,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:33,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583126296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:33,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:33,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-03-17 12:10:33,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865182822] [2025-03-17 12:10:33,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:33,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 12:10:33,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:33,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 12:10:33,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 12:10:33,160 INFO L87 Difference]: Start difference. First operand 342 states and 382 transitions. Second operand has 34 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 34 states have internal predecessors, (126), 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 12:10:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:35,347 INFO L93 Difference]: Finished difference Result 418 states and 460 transitions. [2025-03-17 12:10:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 12:10:35,348 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 34 states have internal predecessors, (126), 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) Word has length 45 [2025-03-17 12:10:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:35,349 INFO L225 Difference]: With dead ends: 418 [2025-03-17 12:10:35,349 INFO L226 Difference]: Without dead ends: 418 [2025-03-17 12:10:35,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=371, Invalid=2179, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 12:10:35,350 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 919 mSDsluCounter, 2983 mSDsCounter, 0 mSdLazyCounter, 3404 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:35,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 3209 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3404 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 12:10:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-17 12:10:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 358. [2025-03-17 12:10:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 265 states have (on average 1.4641509433962263) internal successors, (388), 355 states have internal predecessors, (388), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 402 transitions. [2025-03-17 12:10:35,355 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 402 transitions. Word has length 45 [2025-03-17 12:10:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:35,355 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 402 transitions. [2025-03-17 12:10:35,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 34 states have internal predecessors, (126), 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 12:10:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 402 transitions. [2025-03-17 12:10:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 12:10:35,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:35,355 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:35,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:10:35,556 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,SelfDestructingSolverStorable32 [2025-03-17 12:10:35,556 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:35,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2130723312, now seen corresponding path program 1 times [2025-03-17 12:10:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:35,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282179782] [2025-03-17 12:10:35,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:35,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 12:10:35,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:10:35,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:35,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:10:35,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:35,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282179782] [2025-03-17 12:10:35,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282179782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:35,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:35,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:10:35,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118358200] [2025-03-17 12:10:35,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:35,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:10:35,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:35,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:10:35,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:35,660 INFO L87 Difference]: Start difference. First operand 358 states and 402 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 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 12:10:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:35,951 INFO L93 Difference]: Finished difference Result 378 states and 423 transitions. [2025-03-17 12:10:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:10:35,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 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) Word has length 47 [2025-03-17 12:10:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:35,954 INFO L225 Difference]: With dead ends: 378 [2025-03-17 12:10:35,954 INFO L226 Difference]: Without dead ends: 378 [2025-03-17 12:10:35,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:10:35,954 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 62 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:35,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1164 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-17 12:10:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 361. [2025-03-17 12:10:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 270 states have (on average 1.4444444444444444) internal successors, (390), 358 states have internal predecessors, (390), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 404 transitions. [2025-03-17 12:10:35,959 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 404 transitions. Word has length 47 [2025-03-17 12:10:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:35,959 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 404 transitions. [2025-03-17 12:10:35,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 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 12:10:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 404 transitions. [2025-03-17 12:10:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 12:10:35,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:35,959 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:35,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 12:10:35,960 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:35,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:35,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2130723313, now seen corresponding path program 1 times [2025-03-17 12:10:35,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:35,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452917198] [2025-03-17 12:10:35,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:35,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 12:10:35,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:10:35,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:35,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:36,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:36,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452917198] [2025-03-17 12:10:36,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452917198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:36,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:36,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 12:10:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592109873] [2025-03-17 12:10:36,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:36,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:10:36,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:36,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:10:36,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:10:36,163 INFO L87 Difference]: Start difference. First operand 361 states and 404 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 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 12:10:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:36,564 INFO L93 Difference]: Finished difference Result 392 states and 434 transitions. [2025-03-17 12:10:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:10:36,565 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 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) Word has length 47 [2025-03-17 12:10:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:36,566 INFO L225 Difference]: With dead ends: 392 [2025-03-17 12:10:36,566 INFO L226 Difference]: Without dead ends: 392 [2025-03-17 12:10:36,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:10:36,566 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 145 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:36,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1713 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:36,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-17 12:10:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 364. [2025-03-17 12:10:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 273 states have (on average 1.4395604395604396) internal successors, (393), 361 states have internal predecessors, (393), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 407 transitions. [2025-03-17 12:10:36,571 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 407 transitions. Word has length 47 [2025-03-17 12:10:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:36,571 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 407 transitions. [2025-03-17 12:10:36,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 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 12:10:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 407 transitions. [2025-03-17 12:10:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:10:36,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:36,572 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:36,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 12:10:36,572 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:36,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1577874331, now seen corresponding path program 1 times [2025-03-17 12:10:36,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:36,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350316212] [2025-03-17 12:10:36,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:36,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:10:36,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:10:36,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:36,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:10:36,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350316212] [2025-03-17 12:10:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350316212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403411094] [2025-03-17 12:10:36,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:36,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:36,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:36,934 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 12:10:36,935 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 12:10:37,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:10:37,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:10:37,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:37,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:37,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 12:10:37,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:37,068 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 12:10:37,077 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 12:10:37,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 12:10:37,096 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 12:10:37,122 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:10:37,122 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 12:10:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 12:10:37,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 12:10:37,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403411094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:37,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:37,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 3, 3] total 14 [2025-03-17 12:10:37,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796757892] [2025-03-17 12:10:37,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:37,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:10:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:37,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:10:37,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:10:37,206 INFO L87 Difference]: Start difference. First operand 364 states and 407 transitions. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:37,427 INFO L93 Difference]: Finished difference Result 362 states and 401 transitions. [2025-03-17 12:10:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:10:37,427 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-17 12:10:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:37,428 INFO L225 Difference]: With dead ends: 362 [2025-03-17 12:10:37,428 INFO L226 Difference]: Without dead ends: 362 [2025-03-17 12:10:37,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-17 12:10:37,429 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 425 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:37,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 668 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-17 12:10:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-03-17 12:10:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 273 states have (on average 1.424908424908425) internal successors, (389), 359 states have internal predecessors, (389), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 401 transitions. [2025-03-17 12:10:37,433 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 401 transitions. Word has length 51 [2025-03-17 12:10:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:37,433 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 401 transitions. [2025-03-17 12:10:37,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 401 transitions. [2025-03-17 12:10:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:10:37,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:37,434 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:37,441 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 12:10:37,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:37,635 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:37,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:37,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1606321997, now seen corresponding path program 1 times [2025-03-17 12:10:37,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:37,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565971394] [2025-03-17 12:10:37,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:37,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:37,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:10:37,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:10:37,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:37,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:10:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565971394] [2025-03-17 12:10:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565971394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 12:10:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546829764] [2025-03-17 12:10:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:37,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:10:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:37,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:10:37,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:10:37,811 INFO L87 Difference]: Start difference. First operand 362 states and 401 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 12:10:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:38,071 INFO L93 Difference]: Finished difference Result 369 states and 408 transitions. [2025-03-17 12:10:38,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:10:38,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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) Word has length 51 [2025-03-17 12:10:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:38,072 INFO L225 Difference]: With dead ends: 369 [2025-03-17 12:10:38,072 INFO L226 Difference]: Without dead ends: 369 [2025-03-17 12:10:38,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:10:38,073 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 46 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:38,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1777 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-17 12:10:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2025-03-17 12:10:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 272 states have (on average 1.4227941176470589) internal successors, (387), 358 states have internal predecessors, (387), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 399 transitions. [2025-03-17 12:10:38,077 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 399 transitions. Word has length 51 [2025-03-17 12:10:38,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:38,077 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 399 transitions. [2025-03-17 12:10:38,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 12:10:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 399 transitions. [2025-03-17 12:10:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:10:38,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:38,079 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:38,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 12:10:38,080 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:38,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1977509651, now seen corresponding path program 2 times [2025-03-17 12:10:38,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:38,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905628468] [2025-03-17 12:10:38,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:10:38,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:38,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 12:10:38,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 51 statements. [2025-03-17 12:10:38,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 12:10:38,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:10:38,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:38,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905628468] [2025-03-17 12:10:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905628468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:38,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:38,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:10:38,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892923361] [2025-03-17 12:10:38,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:38,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:10:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:38,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:10:38,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:38,182 INFO L87 Difference]: Start difference. First operand 361 states and 399 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 12:10:38,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:38,308 INFO L93 Difference]: Finished difference Result 369 states and 407 transitions. [2025-03-17 12:10:38,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:10:38,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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) Word has length 51 [2025-03-17 12:10:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:38,309 INFO L225 Difference]: With dead ends: 369 [2025-03-17 12:10:38,309 INFO L226 Difference]: Without dead ends: 369 [2025-03-17 12:10:38,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:38,309 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 41 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:38,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1024 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-17 12:10:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2025-03-17 12:10:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 272 states have (on average 1.4191176470588236) internal successors, (386), 358 states have internal predecessors, (386), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 398 transitions. [2025-03-17 12:10:38,314 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 398 transitions. Word has length 51 [2025-03-17 12:10:38,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:38,314 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 398 transitions. [2025-03-17 12:10:38,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 12:10:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 398 transitions. [2025-03-17 12:10:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 12:10:38,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:38,315 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:38,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 12:10:38,315 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:38,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:38,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1333324495, now seen corresponding path program 1 times [2025-03-17 12:10:38,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:38,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933400981] [2025-03-17 12:10:38,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:38,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:38,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 12:10:38,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 12:10:38,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:38,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:10:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933400981] [2025-03-17 12:10:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933400981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942140897] [2025-03-17 12:10:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:38,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:38,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:38,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:38,367 INFO L87 Difference]: Start difference. First operand 361 states and 398 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:38,420 INFO L93 Difference]: Finished difference Result 360 states and 395 transitions. [2025-03-17 12:10:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:10:38,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-17 12:10:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:38,421 INFO L225 Difference]: With dead ends: 360 [2025-03-17 12:10:38,421 INFO L226 Difference]: Without dead ends: 360 [2025-03-17 12:10:38,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:38,421 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 3 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:38,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 863 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:10:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-17 12:10:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-17 12:10:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 272 states have (on average 1.411764705882353) internal successors, (384), 357 states have internal predecessors, (384), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 395 transitions. [2025-03-17 12:10:38,425 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 395 transitions. Word has length 54 [2025-03-17 12:10:38,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:38,425 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 395 transitions. [2025-03-17 12:10:38,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 395 transitions. [2025-03-17 12:10:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 12:10:38,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:38,430 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:38,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 12:10:38,430 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:38,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1134846561, now seen corresponding path program 2 times [2025-03-17 12:10:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408525223] [2025-03-17 12:10:38,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:10:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:38,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-17 12:10:38,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 54 statements. [2025-03-17 12:10:38,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 12:10:38,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:10:38,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:38,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408525223] [2025-03-17 12:10:38,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408525223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:38,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:38,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:10:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571449703] [2025-03-17 12:10:38,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:38,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:10:38,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:38,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:10:38,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:38,533 INFO L87 Difference]: Start difference. First operand 360 states and 395 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:38,647 INFO L93 Difference]: Finished difference Result 366 states and 400 transitions. [2025-03-17 12:10:38,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:38,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-17 12:10:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:38,648 INFO L225 Difference]: With dead ends: 366 [2025-03-17 12:10:38,648 INFO L226 Difference]: Without dead ends: 366 [2025-03-17 12:10:38,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:10:38,649 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 48 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:38,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1030 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-17 12:10:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2025-03-17 12:10:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 252 states have (on average 1.4404761904761905) internal successors, (363), 337 states have internal predecessors, (363), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 374 transitions. [2025-03-17 12:10:38,652 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 374 transitions. Word has length 54 [2025-03-17 12:10:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:38,653 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 374 transitions. [2025-03-17 12:10:38,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 374 transitions. [2025-03-17 12:10:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 12:10:38,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:38,653 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:38,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 12:10:38,653 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:38,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash -982591211, now seen corresponding path program 1 times [2025-03-17 12:10:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:38,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728030602] [2025-03-17 12:10:38,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:38,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:10:38,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:10:38,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:38,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:38,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:38,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728030602] [2025-03-17 12:10:38,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728030602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:38,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:38,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:10:38,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223132194] [2025-03-17 12:10:38,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:38,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:10:38,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:38,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:10:38,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:10:38,689 INFO L87 Difference]: Start difference. First operand 340 states and 374 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 12:10:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:38,731 INFO L93 Difference]: Finished difference Result 347 states and 377 transitions. [2025-03-17 12:10:38,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:10:38,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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) Word has length 56 [2025-03-17 12:10:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:38,732 INFO L225 Difference]: With dead ends: 347 [2025-03-17 12:10:38,732 INFO L226 Difference]: Without dead ends: 347 [2025-03-17 12:10:38,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:38,733 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 47 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:38,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 598 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:10:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-17 12:10:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 341. [2025-03-17 12:10:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 253 states have (on average 1.4387351778656126) internal successors, (364), 338 states have internal predecessors, (364), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 375 transitions. [2025-03-17 12:10:38,736 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 375 transitions. Word has length 56 [2025-03-17 12:10:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:38,736 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 375 transitions. [2025-03-17 12:10:38,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 12:10:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 375 transitions. [2025-03-17 12:10:38,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 12:10:38,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:38,737 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:38,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 12:10:38,737 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:38,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1319702208, now seen corresponding path program 1 times [2025-03-17 12:10:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:38,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608412390] [2025-03-17 12:10:38,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:38,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:38,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 12:10:38,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 12:10:38,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:38,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:39,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608412390] [2025-03-17 12:10:39,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608412390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:39,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062007744] [2025-03-17 12:10:39,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:39,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:39,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:39,331 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 12:10:39,333 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 12:10:39,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 12:10:39,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 12:10:39,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:39,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:39,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-17 12:10:39,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:39,521 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 12:10:39,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:39,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:39,625 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:10:39,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 12:10:39,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 12:10:39,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 12:10:39,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 12:10:39,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 12:10:39,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:10:39,763 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:10:39,764 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:10:39,809 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2025-03-17 12:10:39,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2025-03-17 12:10:39,825 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-17 12:10:39,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2025-03-17 12:10:40,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-17 12:10:40,646 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-03-17 12:10:40,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 28 [2025-03-17 12:10:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:40,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:41,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:41,185 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:10:41,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:41,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 62 [2025-03-17 12:10:41,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:41,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 308 [2025-03-17 12:10:41,891 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:41,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 494 treesize of output 466 [2025-03-17 12:10:42,043 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:42,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 97 [2025-03-17 12:10:42,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:42,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:10:42,080 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:42,083 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 36 treesize of output 24 [2025-03-17 12:10:42,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:42,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2025-03-17 12:10:42,103 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:42,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:42,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 83 [2025-03-17 12:10:42,124 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 160 treesize of output 156 [2025-03-17 12:10:42,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:42,137 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 18 treesize of output 20 [2025-03-17 12:10:42,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2025-03-17 12:10:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062007744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:42,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:42,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 50 [2025-03-17 12:10:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737277444] [2025-03-17 12:10:42,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:42,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-17 12:10:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:42,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-17 12:10:42,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2289, Unknown=2, NotChecked=0, Total=2450 [2025-03-17 12:10:42,369 INFO L87 Difference]: Start difference. First operand 341 states and 375 transitions. Second operand has 50 states, 50 states have (on average 3.06) internal successors, (153), 50 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:46,567 INFO L93 Difference]: Finished difference Result 555 states and 598 transitions. [2025-03-17 12:10:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 12:10:46,568 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.06) internal successors, (153), 50 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-17 12:10:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:46,569 INFO L225 Difference]: With dead ends: 555 [2025-03-17 12:10:46,569 INFO L226 Difference]: Without dead ends: 555 [2025-03-17 12:10:46,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=643, Invalid=6161, Unknown=2, NotChecked=0, Total=6806 [2025-03-17 12:10:46,570 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1773 mSDsluCounter, 6185 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1773 SdHoareTripleChecker+Valid, 6424 SdHoareTripleChecker+Invalid, 3467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:46,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1773 Valid, 6424 Invalid, 3467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3406 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 12:10:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-17 12:10:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 398. [2025-03-17 12:10:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 310 states have (on average 1.3903225806451613) internal successors, (431), 395 states have internal predecessors, (431), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 442 transitions. [2025-03-17 12:10:46,575 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 442 transitions. Word has length 57 [2025-03-17 12:10:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:46,575 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 442 transitions. [2025-03-17 12:10:46,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.06) internal successors, (153), 50 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 442 transitions. [2025-03-17 12:10:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 12:10:46,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:46,576 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:46,589 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 12:10:46,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:46,777 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:46,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash -181166975, now seen corresponding path program 1 times [2025-03-17 12:10:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:46,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032168203] [2025-03-17 12:10:46,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:46,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:46,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:10:46,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:10:46,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:46,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032168203] [2025-03-17 12:10:47,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032168203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499486653] [2025-03-17 12:10:47,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:47,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:47,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:47,462 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 12:10:47,462 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 12:10:47,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:10:47,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:10:47,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:47,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:47,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-17 12:10:47,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:47,615 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 12:10:47,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:47,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:47,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:10:47,709 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 12:10:47,740 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 16 treesize of output 11 [2025-03-17 12:10:47,744 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 16 treesize of output 11 [2025-03-17 12:10:47,754 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 16 treesize of output 11 [2025-03-17 12:10:47,758 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 16 treesize of output 11 [2025-03-17 12:10:47,820 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:10:47,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:10:47,834 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:10:47,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:10:47,878 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-17 12:10:47,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2025-03-17 12:10:47,896 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2025-03-17 12:10:47,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2025-03-17 12:10:48,461 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 7 treesize of output 3 [2025-03-17 12:10:48,545 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-03-17 12:10:48,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 25 [2025-03-17 12:10:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:48,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:48,764 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-17 12:10:48,765 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 28 treesize of output 27 [2025-03-17 12:10:49,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:49,154 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2025-03-17 12:10:49,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:49,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2025-03-17 12:10:49,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:49,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 191 [2025-03-17 12:10:49,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-03-17 12:10:49,781 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:49,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:49,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 117 [2025-03-17 12:10:49,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:49,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:10:49,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:49,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:10:49,847 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:49,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2025-03-17 12:10:49,852 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:49,854 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 36 treesize of output 24 [2025-03-17 12:10:49,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:49,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:49,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2025-03-17 12:10:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:49,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499486653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:49,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:49,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 55 [2025-03-17 12:10:49,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423369032] [2025-03-17 12:10:49,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:49,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-17 12:10:49,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:49,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-17 12:10:49,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2887, Unknown=8, NotChecked=0, Total=3080 [2025-03-17 12:10:49,982 INFO L87 Difference]: Start difference. First operand 398 states and 442 transitions. Second operand has 56 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 56 states have internal predecessors, (156), 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 12:10:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:53,877 INFO L93 Difference]: Finished difference Result 553 states and 596 transitions. [2025-03-17 12:10:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 12:10:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 56 states have internal predecessors, (156), 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) Word has length 56 [2025-03-17 12:10:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:53,879 INFO L225 Difference]: With dead ends: 553 [2025-03-17 12:10:53,879 INFO L226 Difference]: Without dead ends: 553 [2025-03-17 12:10:53,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=648, Invalid=7176, Unknown=8, NotChecked=0, Total=7832 [2025-03-17 12:10:53,880 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1234 mSDsluCounter, 7185 mSDsCounter, 0 mSdLazyCounter, 5401 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 7424 SdHoareTripleChecker+Invalid, 5454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 5401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:53,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 7424 Invalid, 5454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 5401 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-17 12:10:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-17 12:10:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 399. [2025-03-17 12:10:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 311 states have (on average 1.3890675241157557) internal successors, (432), 396 states have internal predecessors, (432), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 443 transitions. [2025-03-17 12:10:53,886 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 443 transitions. Word has length 56 [2025-03-17 12:10:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:53,887 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 443 transitions. [2025-03-17 12:10:53,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.8363636363636364) internal successors, (156), 56 states have internal predecessors, (156), 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 12:10:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 443 transitions. [2025-03-17 12:10:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 12:10:53,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:53,888 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:53,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 12:10:54,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-03-17 12:10:54,089 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:10:54,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:54,089 INFO L85 PathProgramCache]: Analyzing trace with hash -181166974, now seen corresponding path program 1 times [2025-03-17 12:10:54,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:54,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940314279] [2025-03-17 12:10:54,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:54,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:10:54,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:10:54,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:54,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:54,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940314279] [2025-03-17 12:10:54,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940314279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200607082] [2025-03-17 12:10:54,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:54,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:54,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:54,877 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:10:54,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:10:54,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:10:55,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:10:55,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:55,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:55,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-17 12:10:55,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:55,043 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 12:10:55,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:55,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:55,131 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:10:55,131 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 12:10:55,159 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 16 treesize of output 11 [2025-03-17 12:10:55,162 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 16 treesize of output 11 [2025-03-17 12:10:55,171 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 16 treesize of output 11 [2025-03-17 12:10:55,174 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 16 treesize of output 11 [2025-03-17 12:10:55,233 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:10:55,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:10:55,244 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:10:55,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:10:55,280 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2025-03-17 12:10:55,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2025-03-17 12:10:55,292 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-17 12:10:55,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2025-03-17 12:10:55,981 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-03-17 12:10:55,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 38 [2025-03-17 12:10:55,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-17 12:10:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:56,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:56,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:56,292 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 67 treesize of output 71 [2025-03-17 12:10:56,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:56,838 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 58 [2025-03-17 12:10:56,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-17 12:10:56,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-17 12:10:56,879 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 5 treesize of output 3 [2025-03-17 12:10:56,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:56,888 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2025-03-17 12:10:56,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:56,917 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 30 [2025-03-17 12:10:58,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2025-03-17 12:10:58,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 183 [2025-03-17 12:10:58,564 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 101 [2025-03-17 12:10:58,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2025-03-17 12:10:58,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2025-03-17 12:10:58,619 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2025-03-17 12:10:58,624 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2025-03-17 12:10:58,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:10:58,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:10:58,647 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2025-03-17 12:10:58,652 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,654 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 36 treesize of output 24 [2025-03-17 12:10:58,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2025-03-17 12:10:58,670 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2025-03-17 12:10:58,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:10:58,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:10:58,691 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,693 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 36 treesize of output 24 [2025-03-17 12:10:58,695 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,697 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2025-03-17 12:10:58,700 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 11 treesize of output 7 [2025-03-17 12:10:58,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2025-03-17 12:10:58,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 46 [2025-03-17 12:10:58,738 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2025-03-17 12:10:58,743 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 47 [2025-03-17 12:10:58,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-17 12:10:58,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:10:58,781 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,783 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2025-03-17 12:10:58,786 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:10:58,788 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 36 treesize of output 24 [2025-03-17 12:10:58,793 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 11 treesize of output 7 [2025-03-17 12:10:58,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:58,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2025-03-17 12:10:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200607082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:58,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 20] total 53 [2025-03-17 12:10:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41079723] [2025-03-17 12:10:58,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:58,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-17 12:10:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:58,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-17 12:10:58,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2679, Unknown=7, NotChecked=0, Total=2862 [2025-03-17 12:10:58,951 INFO L87 Difference]: Start difference. First operand 399 states and 443 transitions. Second operand has 54 states, 53 states have (on average 3.018867924528302) internal successors, (160), 54 states have internal predecessors, (160), 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 12:11:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:04,655 INFO L93 Difference]: Finished difference Result 551 states and 594 transitions. [2025-03-17 12:11:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-17 12:11:04,655 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 3.018867924528302) internal successors, (160), 54 states have internal predecessors, (160), 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) Word has length 56 [2025-03-17 12:11:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:04,656 INFO L225 Difference]: With dead ends: 551 [2025-03-17 12:11:04,656 INFO L226 Difference]: Without dead ends: 551 [2025-03-17 12:11:04,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=682, Invalid=7143, Unknown=7, NotChecked=0, Total=7832 [2025-03-17 12:11:04,658 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1215 mSDsluCounter, 6042 mSDsCounter, 0 mSdLazyCounter, 4917 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 6277 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 4917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:04,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 6277 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 4917 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-17 12:11:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-17 12:11:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 399. [2025-03-17 12:11:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 311 states have (on average 1.382636655948553) internal successors, (430), 396 states have internal predecessors, (430), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:11:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 441 transitions. [2025-03-17 12:11:04,662 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 441 transitions. Word has length 56 [2025-03-17 12:11:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:04,662 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 441 transitions. [2025-03-17 12:11:04,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 3.018867924528302) internal successors, (160), 54 states have internal predecessors, (160), 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 12:11:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 441 transitions. [2025-03-17 12:11:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 12:11:04,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:04,663 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:04,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 12:11:04,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:04,863 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:11:04,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1501574783, now seen corresponding path program 1 times [2025-03-17 12:11:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:04,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208664797] [2025-03-17 12:11:04,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:04,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:04,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 12:11:04,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 12:11:04,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:04,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208664797] [2025-03-17 12:11:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208664797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729914105] [2025-03-17 12:11:05,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:05,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:05,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:05,451 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:11:05,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:11:05,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 12:11:05,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 12:11:05,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:05,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:05,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-17 12:11:05,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:11:05,627 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 12:11:05,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:11:05,660 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 24 treesize of output 12 [2025-03-17 12:11:05,708 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:11:05,709 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 19 treesize of output 16 [2025-03-17 12:11:05,745 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 17 treesize of output 12 [2025-03-17 12:11:05,756 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 17 treesize of output 12 [2025-03-17 12:11:05,768 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:11:05,768 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 12:11:05,797 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 17 treesize of output 12 [2025-03-17 12:11:05,805 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 12:11:05,807 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 28 treesize of output 16 [2025-03-17 12:11:05,954 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 15 treesize of output 7 [2025-03-17 12:11:06,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:06,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2025-03-17 12:11:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:06,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:11:06,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:06,376 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2025-03-17 12:11:06,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:06,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2025-03-17 12:11:06,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:06,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 127 [2025-03-17 12:11:06,838 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 50 [2025-03-17 12:11:06,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:06,844 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 57 treesize of output 59 [2025-03-17 12:11:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729914105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:11:07,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:11:07,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 17] total 43 [2025-03-17 12:11:07,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829535460] [2025-03-17 12:11:07,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:07,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 12:11:07,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:07,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 12:11:07,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1678, Unknown=12, NotChecked=0, Total=1806 [2025-03-17 12:11:07,077 INFO L87 Difference]: Start difference. First operand 399 states and 441 transitions. Second operand has 43 states, 43 states have (on average 3.488372093023256) internal successors, (150), 43 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:09,161 INFO L93 Difference]: Finished difference Result 456 states and 496 transitions. [2025-03-17 12:11:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 12:11:09,162 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.488372093023256) internal successors, (150), 43 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-17 12:11:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:09,163 INFO L225 Difference]: With dead ends: 456 [2025-03-17 12:11:09,163 INFO L226 Difference]: Without dead ends: 456 [2025-03-17 12:11:09,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=372, Invalid=3156, Unknown=12, NotChecked=0, Total=3540 [2025-03-17 12:11:09,164 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 800 mSDsluCounter, 6097 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 6341 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:09,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 6341 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 12:11:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-17 12:11:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 399. [2025-03-17 12:11:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 311 states have (on average 1.3794212218649518) internal successors, (429), 396 states have internal predecessors, (429), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:11:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 440 transitions. [2025-03-17 12:11:09,168 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 440 transitions. Word has length 57 [2025-03-17 12:11:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:09,168 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 440 transitions. [2025-03-17 12:11:09,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.488372093023256) internal successors, (150), 43 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 440 transitions. [2025-03-17 12:11:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 12:11:09,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:09,168 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:09,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 12:11:09,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-03-17 12:11:09,369 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:11:09,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1849472578, now seen corresponding path program 1 times [2025-03-17 12:11:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982308931] [2025-03-17 12:11:09,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:09,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:11:09,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:11:09,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:09,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:09,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:09,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982308931] [2025-03-17 12:11:09,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982308931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:09,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361850062] [2025-03-17 12:11:09,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:09,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:09,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:09,980 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:11:09,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:11:10,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:11:10,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:11:10,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:10,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:10,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-17 12:11:10,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:11:10,122 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 12:11:10,143 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:11:10,143 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 12 treesize of output 14 [2025-03-17 12:11:10,165 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 12:11:10,169 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 25 treesize of output 13 [2025-03-17 12:11:10,210 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2025-03-17 12:11:10,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2025-03-17 12:11:10,251 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 26 treesize of output 19 [2025-03-17 12:11:10,263 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 26 treesize of output 19 [2025-03-17 12:11:10,286 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2025-03-17 12:11:10,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2025-03-17 12:11:10,343 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-17 12:11:10,343 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 1 case distinctions, treesize of input 45 treesize of output 29 [2025-03-17 12:11:10,392 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:11:10,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 54 [2025-03-17 12:11:10,402 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 12:11:10,877 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 15 treesize of output 7 [2025-03-17 12:11:11,348 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-03-17 12:11:11,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 101 [2025-03-17 12:11:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:11,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:11:13,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:13,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 51 [2025-03-17 12:11:13,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:13,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 212 [2025-03-17 12:11:13,073 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 312 treesize of output 304 [2025-03-17 12:11:13,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:13,148 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 309 treesize of output 307 [2025-03-17 12:11:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:15,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361850062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:11:15,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:11:15,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 22] total 55 [2025-03-17 12:11:15,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399107479] [2025-03-17 12:11:15,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:15,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-17 12:11:15,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:15,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-17 12:11:15,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2870, Unknown=9, NotChecked=0, Total=3080 [2025-03-17 12:11:15,870 INFO L87 Difference]: Start difference. First operand 399 states and 440 transitions. Second operand has 56 states, 55 states have (on average 2.890909090909091) internal successors, (159), 56 states have internal predecessors, (159), 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 12:11:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:19,815 INFO L93 Difference]: Finished difference Result 455 states and 495 transitions. [2025-03-17 12:11:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 12:11:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.890909090909091) internal successors, (159), 56 states have internal predecessors, (159), 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) Word has length 56 [2025-03-17 12:11:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:19,816 INFO L225 Difference]: With dead ends: 455 [2025-03-17 12:11:19,816 INFO L226 Difference]: Without dead ends: 455 [2025-03-17 12:11:19,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=542, Invalid=4851, Unknown=9, NotChecked=0, Total=5402 [2025-03-17 12:11:19,818 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 753 mSDsluCounter, 4888 mSDsCounter, 0 mSdLazyCounter, 4211 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 5133 SdHoareTripleChecker+Invalid, 4239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:19,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 5133 Invalid, 4239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4211 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-17 12:11:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-17 12:11:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 400. [2025-03-17 12:11:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 312 states have (on average 1.3814102564102564) internal successors, (431), 397 states have internal predecessors, (431), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:11:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 442 transitions. [2025-03-17 12:11:19,821 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 442 transitions. Word has length 56 [2025-03-17 12:11:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:19,821 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 442 transitions. [2025-03-17 12:11:19,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.890909090909091) internal successors, (159), 56 states have internal predecessors, (159), 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 12:11:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 442 transitions. [2025-03-17 12:11:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 12:11:19,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:19,822 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:19,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 12:11:20,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-03-17 12:11:20,023 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:11:20,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1849472579, now seen corresponding path program 1 times [2025-03-17 12:11:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:20,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748439566] [2025-03-17 12:11:20,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:20,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:11:20,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:11:20,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:20,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748439566] [2025-03-17 12:11:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748439566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189355454] [2025-03-17 12:11:20,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:20,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:20,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:20,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:11:20,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 12:11:20,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:11:20,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:11:20,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:20,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:20,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-17 12:11:20,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:11:20,887 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 12:11:20,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:11:20,922 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:11:20,922 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 17 treesize of output 21 [2025-03-17 12:11:20,927 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 12:11:20,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:11:20,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:11:20,983 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 23 treesize of output 11 [2025-03-17 12:11:20,987 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 42 treesize of output 22 [2025-03-17 12:11:21,046 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-17 12:11:21,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-03-17 12:11:21,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:11:21,097 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 16 treesize of output 11 [2025-03-17 12:11:21,100 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 43 treesize of output 32 [2025-03-17 12:11:21,127 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 43 treesize of output 32 [2025-03-17 12:11:21,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 12:11:21,148 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-17 12:11:21,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 12:11:21,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:11:21,197 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 16 treesize of output 11 [2025-03-17 12:11:21,202 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 34 treesize of output 25 [2025-03-17 12:11:21,215 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 57 treesize of output 29 [2025-03-17 12:11:21,222 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 27 treesize of output 15 [2025-03-17 12:11:21,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:21,838 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:21,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:21,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 41 [2025-03-17 12:11:21,846 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:11:21,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-03-17 12:11:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:21,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:11:22,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:22,639 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:11:22,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:22,650 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-03-17 12:11:22,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:22,653 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2025-03-17 12:11:28,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:28,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2025-03-17 12:11:28,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:28,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 52 [2025-03-17 12:11:28,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:28,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 140 [2025-03-17 12:11:28,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:28,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 430 treesize of output 418 [2025-03-17 12:11:28,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:28,362 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 100 treesize of output 102 [2025-03-17 12:11:28,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:28,373 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 100 treesize of output 100 [2025-03-17 12:11:28,378 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 44 treesize of output 42 [2025-03-17 12:11:28,383 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 42 treesize of output 40 [2025-03-17 12:11:28,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:28,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2025-03-17 12:11:28,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:28,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 68 [2025-03-17 12:11:28,717 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 24 treesize of output 22 [2025-03-17 12:11:28,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:28,724 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 56 treesize of output 56 [2025-03-17 12:11:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:29,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189355454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:11:29,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:11:29,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 17] total 44 [2025-03-17 12:11:29,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979367145] [2025-03-17 12:11:29,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:29,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-17 12:11:29,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:29,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-17 12:11:29,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1836, Unknown=5, NotChecked=0, Total=1980 [2025-03-17 12:11:29,406 INFO L87 Difference]: Start difference. First operand 400 states and 442 transitions. Second operand has 45 states, 44 states have (on average 3.6363636363636362) internal successors, (160), 45 states have internal predecessors, (160), 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 12:11:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:34,880 INFO L93 Difference]: Finished difference Result 454 states and 494 transitions. [2025-03-17 12:11:34,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 12:11:34,881 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.6363636363636362) internal successors, (160), 45 states have internal predecessors, (160), 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) Word has length 56 [2025-03-17 12:11:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:34,882 INFO L225 Difference]: With dead ends: 454 [2025-03-17 12:11:34,882 INFO L226 Difference]: Without dead ends: 454 [2025-03-17 12:11:34,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=438, Invalid=3463, Unknown=5, NotChecked=0, Total=3906 [2025-03-17 12:11:34,883 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 977 mSDsluCounter, 4450 mSDsCounter, 0 mSdLazyCounter, 4935 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 4687 SdHoareTripleChecker+Invalid, 4955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:34,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 4687 Invalid, 4955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4935 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-17 12:11:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-17 12:11:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 400. [2025-03-17 12:11:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 312 states have (on average 1.3782051282051282) internal successors, (430), 397 states have internal predecessors, (430), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:11:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 441 transitions. [2025-03-17 12:11:34,886 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 441 transitions. Word has length 56 [2025-03-17 12:11:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:34,886 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 441 transitions. [2025-03-17 12:11:34,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.6363636363636362) internal successors, (160), 45 states have internal predecessors, (160), 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 12:11:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 441 transitions. [2025-03-17 12:11:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 12:11:34,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:34,886 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:34,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 12:11:35,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-17 12:11:35,087 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:11:35,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2122340122, now seen corresponding path program 1 times [2025-03-17 12:11:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:35,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877466492] [2025-03-17 12:11:35,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:35,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 12:11:35,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 12:11:35,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:35,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:35,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:35,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877466492] [2025-03-17 12:11:35,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877466492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:35,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:35,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 12:11:35,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071941497] [2025-03-17 12:11:35,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:35,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:11:35,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:35,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:11:35,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:11:35,228 INFO L87 Difference]: Start difference. First operand 400 states and 441 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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 12:11:35,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:35,491 INFO L93 Difference]: Finished difference Result 421 states and 462 transitions. [2025-03-17 12:11:35,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:11:35,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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) Word has length 59 [2025-03-17 12:11:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:35,493 INFO L225 Difference]: With dead ends: 421 [2025-03-17 12:11:35,493 INFO L226 Difference]: Without dead ends: 421 [2025-03-17 12:11:35,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:11:35,493 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 134 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:35,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1678 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:11:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-17 12:11:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 409. [2025-03-17 12:11:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 321 states have (on average 1.367601246105919) internal successors, (439), 406 states have internal predecessors, (439), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:11:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 450 transitions. [2025-03-17 12:11:35,496 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 450 transitions. Word has length 59 [2025-03-17 12:11:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:35,497 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 450 transitions. [2025-03-17 12:11:35,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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 12:11:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 450 transitions. [2025-03-17 12:11:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 12:11:35,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:35,497 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:35,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-17 12:11:35,497 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:11:35,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2122340474, now seen corresponding path program 1 times [2025-03-17 12:11:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:35,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045129185] [2025-03-17 12:11:35,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:35,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 12:11:35,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 12:11:35,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:35,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:35,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:35,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045129185] [2025-03-17 12:11:35,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045129185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:35,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:35,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 12:11:35,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71205095] [2025-03-17 12:11:35,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:35,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:11:35,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:35,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:11:35,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:11:35,676 INFO L87 Difference]: Start difference. First operand 409 states and 450 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 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 12:11:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:36,027 INFO L93 Difference]: Finished difference Result 415 states and 453 transitions. [2025-03-17 12:11:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:11:36,028 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 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) Word has length 59 [2025-03-17 12:11:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:36,029 INFO L225 Difference]: With dead ends: 415 [2025-03-17 12:11:36,029 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 12:11:36,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:11:36,029 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 119 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:36,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1416 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:11:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 12:11:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 409. [2025-03-17 12:11:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 322 states have (on average 1.3664596273291925) internal successors, (440), 406 states have internal predecessors, (440), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:11:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 451 transitions. [2025-03-17 12:11:36,032 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 451 transitions. Word has length 59 [2025-03-17 12:11:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:36,032 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 451 transitions. [2025-03-17 12:11:36,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 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 12:11:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 451 transitions. [2025-03-17 12:11:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 12:11:36,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:36,033 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:36,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-17 12:11:36,033 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:11:36,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2122340475, now seen corresponding path program 1 times [2025-03-17 12:11:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251540592] [2025-03-17 12:11:36,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:36,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 12:11:36,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 12:11:36,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:36,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:36,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:36,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251540592] [2025-03-17 12:11:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251540592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:36,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:36,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:11:36,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619240139] [2025-03-17 12:11:36,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:36,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:11:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:36,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:11:36,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:11:36,227 INFO L87 Difference]: Start difference. First operand 409 states and 451 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 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 12:11:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:36,574 INFO L93 Difference]: Finished difference Result 417 states and 454 transitions. [2025-03-17 12:11:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:11:36,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 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) Word has length 59 [2025-03-17 12:11:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:36,575 INFO L225 Difference]: With dead ends: 417 [2025-03-17 12:11:36,575 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 12:11:36,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:11:36,576 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 100 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:36,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1495 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:11:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 12:11:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 411. [2025-03-17 12:11:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 324 states have (on average 1.3611111111111112) internal successors, (441), 408 states have internal predecessors, (441), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:11:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 452 transitions. [2025-03-17 12:11:36,580 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 452 transitions. Word has length 59 [2025-03-17 12:11:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:36,581 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 452 transitions. [2025-03-17 12:11:36,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 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 12:11:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 452 transitions. [2025-03-17 12:11:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 12:11:36,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:36,582 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:36,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-17 12:11:36,583 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2025-03-17 12:11:36,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:36,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1869402236, now seen corresponding path program 1 times [2025-03-17 12:11:36,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:36,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651942612] [2025-03-17 12:11:36,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:36,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:36,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 12:11:36,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 12:11:36,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:36,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:37,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:37,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651942612] [2025-03-17 12:11:37,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651942612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:37,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077489243] [2025-03-17 12:11:37,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:37,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:37,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:37,571 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:11:37,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 12:11:37,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 12:11:37,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 12:11:37,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:37,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:37,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-17 12:11:37,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:11:37,765 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 12:11:37,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:11:37,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:11:37,874 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:11:37,874 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 19 treesize of output 16 [2025-03-17 12:11:37,916 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 16 treesize of output 11 [2025-03-17 12:11:37,921 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 16 treesize of output 11 [2025-03-17 12:11:37,934 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 16 treesize of output 11 [2025-03-17 12:11:37,938 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 16 treesize of output 11 [2025-03-17 12:11:37,950 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:11:37,950 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 12:11:37,989 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 16 treesize of output 11 [2025-03-17 12:11:37,995 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 16 treesize of output 11 [2025-03-17 12:11:38,003 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 23 treesize of output 22 [2025-03-17 12:11:38,008 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 27 treesize of output 15 [2025-03-17 12:11:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:38,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:11:38,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:38,695 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:11:38,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:38,700 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:11:38,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_arrayElimArr_30 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 0) (not (= (select v_arrayElimArr_30 .cse1) |c_ULTIMATE.start_main_~data~0#1.base|)))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~data~0#1.offset| (select v_arrayElimArr_31 .cse1))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_31) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 0))))) is different from false [2025-03-17 12:11:39,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:39,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:11:39,204 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 140 treesize of output 122 [2025-03-17 12:11:39,208 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 25 treesize of output 21 [2025-03-17 12:11:39,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:39,213 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 35 treesize of output 33 [2025-03-17 12:11:39,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:39,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:11:39,285 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 70 treesize of output 58 [2025-03-17 12:11:39,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:39,290 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 60 treesize of output 58 [2025-03-17 12:11:39,294 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 24 treesize of output 20 [2025-03-17 12:11:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-17 12:11:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077489243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:11:39,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:11:39,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 15] total 48 [2025-03-17 12:11:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088311111] [2025-03-17 12:11:39,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:39,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 12:11:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:39,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 12:11:39,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2038, Unknown=3, NotChecked=90, Total=2256 [2025-03-17 12:11:39,614 INFO L87 Difference]: Start difference. First operand 411 states and 452 transitions. Second operand has 48 states, 48 states have (on average 3.25) internal successors, (156), 48 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)