./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-08 23:02:44,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:02:44,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:02:44,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:02:44,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:02:44,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:02:44,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:02:44,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:02:44,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:02:44,991 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:02:44,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:02:44,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:02:44,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:02:44,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:02:44,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:02:44,993 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:02:44,993 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:02:44,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:02:44,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:02:44,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:02:44,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:02:44,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:02:44,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:02:44,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:02:44,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:02:44,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:02:44,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:02:44,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:02:44,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:02:44,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:02:44,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:02:44,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:02:44,994 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2025-03-08 23:02:45,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:02:45,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:02:45,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:02:45,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:02:45,203 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:02:45,204 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-08 23:02:46,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc322e94/37c9239af0a34ca998559f8dd3341347/FLAG8dbfe7bc9 [2025-03-08 23:02:46,514 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:02:46,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2025-03-08 23:02:46,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc322e94/37c9239af0a34ca998559f8dd3341347/FLAG8dbfe7bc9 [2025-03-08 23:02:46,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc322e94/37c9239af0a34ca998559f8dd3341347 [2025-03-08 23:02:46,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:02:46,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:02:46,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:02:46,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:02:46,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:02:46,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:02:46" (1/1) ... [2025-03-08 23:02:46,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49deb0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:46, skipping insertion in model container [2025-03-08 23:02:46,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:02:46" (1/1) ... [2025-03-08 23:02:46,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:02:47,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:02:47,109 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:02:47,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:02:47,164 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:02:47,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47 WrapperNode [2025-03-08 23:02:47,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:02:47,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:02:47,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:02:47,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:02:47,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,196 INFO L138 Inliner]: procedures = 125, calls = 84, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 278 [2025-03-08 23:02:47,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:02:47,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:02:47,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:02:47,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:02:47,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,225 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 34, 3, 10]. 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, 8, 2, 3]. [2025-03-08 23:02:47,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:02:47,239 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:02:47,239 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:02:47,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:02:47,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:02:47,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:47,264 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-08 23:02:47,266 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-08 23:02:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:02:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:02:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 23:02:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 23:02:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2025-03-08 23:02:47,282 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2025-03-08 23:02:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-08 23:02:47,282 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-08 23:02:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:02:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:02:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 23:02:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:02:47,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:02:47,395 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:02:47,396 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:02:47,884 INFO L? ?]: Removed 241 outVars from TransFormulas that were not future-live. [2025-03-08 23:02:47,884 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:02:47,900 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:02:47,900 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:02:47,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:02:47 BoogieIcfgContainer [2025-03-08 23:02:47,900 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:02:47,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:02:47,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:02:47,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:02:47,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:02:46" (1/3) ... [2025-03-08 23:02:47,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31099ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:02:47, skipping insertion in model container [2025-03-08 23:02:47,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (2/3) ... [2025-03-08 23:02:47,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31099ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:02:47, skipping insertion in model container [2025-03-08 23:02:47,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:02:47" (3/3) ... [2025-03-08 23:02:47,908 INFO L128 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2025-03-08 23:02:47,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:02:47,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG merge_sort-2.i that has 3 procedures, 264 locations, 1 initial locations, 20 loop locations, and 105 error locations. [2025-03-08 23:02:47,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:02:47,968 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;@297b0056, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:02:47,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-03-08 23:02:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 264 states, 141 states have (on average 2.1702127659574466) internal successors, (306), 261 states have internal predecessors, (306), 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-08 23:02:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:02:47,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:47,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:02:47,976 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-08 23:02:47,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash 341608285, now seen corresponding path program 1 times [2025-03-08 23:02:47,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:47,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125493330] [2025-03-08 23:02:47,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:48,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:02:48,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:02:48,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:48,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:48,061 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-08 23:02:48,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125493330] [2025-03-08 23:02:48,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125493330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:48,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:48,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:02:48,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833066645] [2025-03-08 23:02:48,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:48,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 23:02:48,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:48,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 23:02:48,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:02:48,089 INFO L87 Difference]: Start difference. First operand has 264 states, 141 states have (on average 2.1702127659574466) internal successors, (306), 261 states have internal predecessors, (306), 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.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-08 23:02:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:48,108 INFO L93 Difference]: Finished difference Result 261 states and 286 transitions. [2025-03-08 23:02:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 23:02:48,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 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-08 23:02:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:48,117 INFO L225 Difference]: With dead ends: 261 [2025-03-08 23:02:48,117 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 23:02:48,118 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-08 23:02:48,120 INFO L435 NwaCegarLoop]: 286 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, 286 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-08 23:02:48,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:02:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 23:02:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-08 23:02:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 138 states have (on average 1.934782608695652) internal successors, (267), 256 states have internal predecessors, (267), 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-08 23:02:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 284 transitions. [2025-03-08 23:02:48,164 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 284 transitions. Word has length 5 [2025-03-08 23:02:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:48,165 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 284 transitions. [2025-03-08 23:02:48,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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-08 23:02:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 284 transitions. [2025-03-08 23:02:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:02:48,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:48,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:02:48,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:02:48,167 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-08 23:02:48,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:48,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1999923765, now seen corresponding path program 1 times [2025-03-08 23:02:48,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:48,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510205734] [2025-03-08 23:02:48,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:48,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:48,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:02:48,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:02:48,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:48,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:48,209 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-08 23:02:48,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:48,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510205734] [2025-03-08 23:02:48,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510205734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:48,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:48,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:02:48,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696768415] [2025-03-08 23:02:48,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:48,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:02:48,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:48,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:02:48,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:02:48,211 INFO L87 Difference]: Start difference. First operand 259 states and 284 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 23:02:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:48,419 INFO L93 Difference]: Finished difference Result 392 states and 436 transitions. [2025-03-08 23:02:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:02:48,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-08 23:02:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:48,421 INFO L225 Difference]: With dead ends: 392 [2025-03-08 23:02:48,422 INFO L226 Difference]: Without dead ends: 391 [2025-03-08 23:02:48,422 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-08 23:02:48,438 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 133 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:48,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 398 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-08 23:02:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 262. [2025-03-08 23:02:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 141 states have (on average 1.9219858156028369) internal successors, (271), 259 states have internal predecessors, (271), 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-08 23:02:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 288 transitions. [2025-03-08 23:02:48,449 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 288 transitions. Word has length 6 [2025-03-08 23:02:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:48,449 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 288 transitions. [2025-03-08 23:02:48,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 23:02:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 288 transitions. [2025-03-08 23:02:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:02:48,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:48,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:02:48,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:02:48,450 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-08 23:02:48,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1999925660, now seen corresponding path program 1 times [2025-03-08 23:02:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:48,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540039324] [2025-03-08 23:02:48,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:48,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:02:48,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:02:48,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:48,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:48,509 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-08 23:02:48,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:48,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540039324] [2025-03-08 23:02:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540039324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:48,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:48,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:02:48,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193678592] [2025-03-08 23:02:48,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:48,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:02:48,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:48,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:02:48,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:02:48,511 INFO L87 Difference]: Start difference. First operand 262 states and 288 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 23:02:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:48,637 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2025-03-08 23:02:48,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:02:48,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-08 23:02:48,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:48,640 INFO L225 Difference]: With dead ends: 260 [2025-03-08 23:02:48,640 INFO L226 Difference]: Without dead ends: 260 [2025-03-08 23:02:48,640 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-08 23:02:48,641 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 6 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:48,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 442 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-08 23:02:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-03-08 23:02:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 141 states have (on average 1.9078014184397163) internal successors, (269), 257 states have internal predecessors, (269), 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-08 23:02:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 286 transitions. [2025-03-08 23:02:48,656 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 286 transitions. Word has length 6 [2025-03-08 23:02:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:48,656 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 286 transitions. [2025-03-08 23:02:48,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 23:02:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 286 transitions. [2025-03-08 23:02:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:02:48,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:48,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:02:48,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:02:48,656 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-08 23:02:48,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1999925661, now seen corresponding path program 1 times [2025-03-08 23:02:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105162237] [2025-03-08 23:02:48,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:48,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:02:48,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:02:48,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:48,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:48,726 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-08 23:02:48,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:48,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105162237] [2025-03-08 23:02:48,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105162237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:48,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:48,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:02:48,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711120777] [2025-03-08 23:02:48,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:48,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:02:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:48,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:02:48,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:02:48,728 INFO L87 Difference]: Start difference. First operand 260 states and 286 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 23:02:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:48,830 INFO L93 Difference]: Finished difference Result 258 states and 284 transitions. [2025-03-08 23:02:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:02:48,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-08 23:02:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:48,831 INFO L225 Difference]: With dead ends: 258 [2025-03-08 23:02:48,831 INFO L226 Difference]: Without dead ends: 258 [2025-03-08 23:02:48,831 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-08 23:02:48,831 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 6 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:48,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 450 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-08 23:02:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-03-08 23:02:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 141 states have (on average 1.8936170212765957) internal successors, (267), 255 states have internal predecessors, (267), 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-08 23:02:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 284 transitions. [2025-03-08 23:02:48,843 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 284 transitions. Word has length 6 [2025-03-08 23:02:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:48,843 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 284 transitions. [2025-03-08 23:02:48,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 23:02:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 284 transitions. [2025-03-08 23:02:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 23:02:48,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:48,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:48,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:02:48,844 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-08 23:02:48,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2076676596, now seen corresponding path program 1 times [2025-03-08 23:02:48,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166545355] [2025-03-08 23:02:48,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:48,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 23:02:48,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 23:02:48,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:48,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:48,889 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-08 23:02:48,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:48,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166545355] [2025-03-08 23:02:48,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166545355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:48,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:48,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:02:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653181497] [2025-03-08 23:02:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:02:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:48,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:02:48,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:02:48,892 INFO L87 Difference]: Start difference. First operand 258 states and 284 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-08 23:02:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:48,916 INFO L93 Difference]: Finished difference Result 270 states and 295 transitions. [2025-03-08 23:02:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:02:48,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-08 23:02:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:48,917 INFO L225 Difference]: With dead ends: 270 [2025-03-08 23:02:48,917 INFO L226 Difference]: Without dead ends: 269 [2025-03-08 23:02:48,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 23:02:48,918 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 12 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 539 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-08 23:02:48,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 539 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:02:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-08 23:02:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 257. [2025-03-08 23:02:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 140 states have (on average 1.8928571428571428) internal successors, (265), 254 states have internal predecessors, (265), 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-08 23:02:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2025-03-08 23:02:48,923 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 8 [2025-03-08 23:02:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:48,924 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2025-03-08 23:02:48,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-08 23:02:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2025-03-08 23:02:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 23:02:48,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:48,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:48,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:02:48,924 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-08 23:02:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash -682439428, now seen corresponding path program 1 times [2025-03-08 23:02:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:48,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886590398] [2025-03-08 23:02:48,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:48,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 23:02:48,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 23:02:48,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:48,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:48,983 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-08 23:02:48,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:48,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886590398] [2025-03-08 23:02:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886590398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:48,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:48,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:02:48,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755594144] [2025-03-08 23:02:48,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:48,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:02:48,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:48,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:02:48,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:02:48,984 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-08 23:02:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:49,092 INFO L93 Difference]: Finished difference Result 255 states and 280 transitions. [2025-03-08 23:02:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:02:49,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-03-08 23:02:49,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:49,093 INFO L225 Difference]: With dead ends: 255 [2025-03-08 23:02:49,093 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 23:02:49,093 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-08 23:02:49,093 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:49,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 441 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 23:02:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-03-08 23:02:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 140 states have (on average 1.8785714285714286) internal successors, (263), 252 states have internal predecessors, (263), 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-08 23:02:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 280 transitions. [2025-03-08 23:02:49,098 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 280 transitions. Word has length 11 [2025-03-08 23:02:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:49,098 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 280 transitions. [2025-03-08 23:02:49,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-08 23:02:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 280 transitions. [2025-03-08 23:02:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 23:02:49,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:49,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:49,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 23:02:49,099 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-08 23:02:49,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash -682439427, now seen corresponding path program 1 times [2025-03-08 23:02:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:49,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048607356] [2025-03-08 23:02:49,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:49,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 23:02:49,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 23:02:49,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:49,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:49,161 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-08 23:02:49,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:49,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048607356] [2025-03-08 23:02:49,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048607356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:49,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:49,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:02:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40822541] [2025-03-08 23:02:49,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:49,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:02:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:49,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:02:49,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:02:49,163 INFO L87 Difference]: Start difference. First operand 255 states and 280 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-08 23:02:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:49,270 INFO L93 Difference]: Finished difference Result 253 states and 278 transitions. [2025-03-08 23:02:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:02:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-03-08 23:02:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:49,271 INFO L225 Difference]: With dead ends: 253 [2025-03-08 23:02:49,271 INFO L226 Difference]: Without dead ends: 253 [2025-03-08 23:02:49,271 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-08 23:02:49,272 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:49,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 449 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-08 23:02:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-08 23:02:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 140 states have (on average 1.8642857142857143) internal successors, (261), 250 states have internal predecessors, (261), 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-08 23:02:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 278 transitions. [2025-03-08 23:02:49,276 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 278 transitions. Word has length 11 [2025-03-08 23:02:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:49,276 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 278 transitions. [2025-03-08 23:02:49,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-08 23:02:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 278 transitions. [2025-03-08 23:02:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 23:02:49,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:49,277 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:49,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:02:49,277 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-08 23:02:49,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash -49635185, now seen corresponding path program 1 times [2025-03-08 23:02:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:49,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902999128] [2025-03-08 23:02:49,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:49,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 23:02:49,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 23:02:49,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:49,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:49,335 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-08 23:02:49,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:49,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902999128] [2025-03-08 23:02:49,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902999128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:49,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:49,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:02:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844398811] [2025-03-08 23:02:49,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:49,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:02:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:49,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:02:49,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:02:49,337 INFO L87 Difference]: Start difference. First operand 253 states and 278 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-08 23:02:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:49,377 INFO L93 Difference]: Finished difference Result 305 states and 341 transitions. [2025-03-08 23:02:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:02:49,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-03-08 23:02:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:49,378 INFO L225 Difference]: With dead ends: 305 [2025-03-08 23:02:49,378 INFO L226 Difference]: Without dead ends: 305 [2025-03-08 23:02:49,378 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-08 23:02:49,379 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 114 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 721 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-08 23:02:49,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 721 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:02:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-08 23:02:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 253. [2025-03-08 23:02:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 140 states have (on average 1.8571428571428572) internal successors, (260), 250 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-08 23:02:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 277 transitions. [2025-03-08 23:02:49,383 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 277 transitions. Word has length 17 [2025-03-08 23:02:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:49,383 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 277 transitions. [2025-03-08 23:02:49,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-08 23:02:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 277 transitions. [2025-03-08 23:02:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:02:49,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:49,384 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:49,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:02:49,384 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-08 23:02:49,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash -454452786, now seen corresponding path program 1 times [2025-03-08 23:02:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:49,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039998653] [2025-03-08 23:02:49,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:49,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:02:49,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:02:49,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:49,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:49,459 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-08 23:02:49,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:49,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039998653] [2025-03-08 23:02:49,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039998653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:49,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:49,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:02:49,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845828338] [2025-03-08 23:02:49,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:49,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:02:49,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:49,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:02:49,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:02:49,461 INFO L87 Difference]: Start difference. First operand 253 states and 277 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-08 23:02:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:49,687 INFO L93 Difference]: Finished difference Result 254 states and 280 transitions. [2025-03-08 23:02:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:02:49,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2025-03-08 23:02:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:49,688 INFO L225 Difference]: With dead ends: 254 [2025-03-08 23:02:49,688 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 23:02:49,689 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-08 23:02:49,689 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 148 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:49,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 540 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 23:02:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 246. [2025-03-08 23:02:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 142 states have (on average 1.795774647887324) internal successors, (255), 243 states have internal predecessors, (255), 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-08 23:02:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 272 transitions. [2025-03-08 23:02:49,693 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 272 transitions. Word has length 19 [2025-03-08 23:02:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:49,693 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 272 transitions. [2025-03-08 23:02:49,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-08 23:02:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 272 transitions. [2025-03-08 23:02:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:02:49,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:49,694 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:49,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 23:02:49,694 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-08 23:02:49,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash -454452785, now seen corresponding path program 1 times [2025-03-08 23:02:49,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:49,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980497644] [2025-03-08 23:02:49,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:49,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:49,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:02:49,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:02:49,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:49,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:49,807 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-08 23:02:49,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:49,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980497644] [2025-03-08 23:02:49,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980497644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:49,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:49,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:02:49,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278496138] [2025-03-08 23:02:49,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:49,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:02:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:49,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:02:49,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:02:49,808 INFO L87 Difference]: Start difference. First operand 246 states and 272 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-08 23:02:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:50,069 INFO L93 Difference]: Finished difference Result 333 states and 372 transitions. [2025-03-08 23:02:50,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:02:50,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2025-03-08 23:02:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:50,070 INFO L225 Difference]: With dead ends: 333 [2025-03-08 23:02:50,070 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 23:02:50,070 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-08 23:02:50,071 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 183 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:50,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 621 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 23:02:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 293. [2025-03-08 23:02:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 189 states have (on average 1.7354497354497354) internal successors, (328), 290 states have internal predecessors, (328), 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-08 23:02:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 345 transitions. [2025-03-08 23:02:50,076 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 345 transitions. Word has length 19 [2025-03-08 23:02:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:50,077 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 345 transitions. [2025-03-08 23:02:50,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-08 23:02:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 345 transitions. [2025-03-08 23:02:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:02:50,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:50,077 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] [2025-03-08 23:02:50,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 23:02:50,078 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-08 23:02:50,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1358333512, now seen corresponding path program 1 times [2025-03-08 23:02:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:50,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713614723] [2025-03-08 23:02:50,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:50,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:50,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:02:50,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:02:50,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:50,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:50,140 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-08 23:02:50,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:50,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713614723] [2025-03-08 23:02:50,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713614723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:50,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:50,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:02:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984455250] [2025-03-08 23:02:50,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:50,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:02:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:50,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:02:50,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:02:50,141 INFO L87 Difference]: Start difference. First operand 293 states and 345 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-08 23:02:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:50,210 INFO L93 Difference]: Finished difference Result 322 states and 358 transitions. [2025-03-08 23:02:50,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:02:50,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 21 [2025-03-08 23:02:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:50,211 INFO L225 Difference]: With dead ends: 322 [2025-03-08 23:02:50,211 INFO L226 Difference]: Without dead ends: 322 [2025-03-08 23:02:50,212 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-08 23:02:50,212 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 181 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 901 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-08 23:02:50,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 901 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-08 23:02:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2025-03-08 23:02:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 189 states have (on average 1.7195767195767195) internal successors, (325), 289 states have internal predecessors, (325), 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-08 23:02:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 341 transitions. [2025-03-08 23:02:50,217 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 341 transitions. Word has length 21 [2025-03-08 23:02:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:50,217 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 341 transitions. [2025-03-08 23:02:50,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-08 23:02:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 341 transitions. [2025-03-08 23:02:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:02:50,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:50,217 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] [2025-03-08 23:02:50,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:02:50,217 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-08 23:02:50,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1149484698, now seen corresponding path program 1 times [2025-03-08 23:02:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780394454] [2025-03-08 23:02:50,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:50,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:02:50,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:02:50,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:50,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:50,294 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-08 23:02:50,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:50,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780394454] [2025-03-08 23:02:50,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780394454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:50,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:50,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:02:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991356000] [2025-03-08 23:02:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:50,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:02:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:50,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:02:50,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:02:50,295 INFO L87 Difference]: Start difference. First operand 292 states and 341 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-08 23:02:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:50,391 INFO L93 Difference]: Finished difference Result 291 states and 338 transitions. [2025-03-08 23:02:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:02:50,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 28 [2025-03-08 23:02:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:50,393 INFO L225 Difference]: With dead ends: 291 [2025-03-08 23:02:50,394 INFO L226 Difference]: Without dead ends: 291 [2025-03-08 23:02:50,394 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-08 23:02:50,394 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 15 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 898 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-08 23:02:50,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 898 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-08 23:02:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-03-08 23:02:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 189 states have (on average 1.708994708994709) internal successors, (323), 288 states have internal predecessors, (323), 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-08 23:02:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 338 transitions. [2025-03-08 23:02:50,399 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 338 transitions. Word has length 28 [2025-03-08 23:02:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:50,399 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 338 transitions. [2025-03-08 23:02:50,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-08 23:02:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 338 transitions. [2025-03-08 23:02:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:02:50,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:50,400 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] [2025-03-08 23:02:50,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 23:02:50,400 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-08 23:02:50,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:50,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1977662609, now seen corresponding path program 1 times [2025-03-08 23:02:50,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223415245] [2025-03-08 23:02:50,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:50,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:02:50,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:02:50,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:50,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:50,463 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-08 23:02:50,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:50,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223415245] [2025-03-08 23:02:50,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223415245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:50,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:50,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:02:50,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287034287] [2025-03-08 23:02:50,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:50,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:02:50,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:50,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:02:50,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:02:50,465 INFO L87 Difference]: Start difference. First operand 291 states and 338 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-08 23:02:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:50,557 INFO L93 Difference]: Finished difference Result 290 states and 335 transitions. [2025-03-08 23:02:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:02:50,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 28 [2025-03-08 23:02:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:50,559 INFO L225 Difference]: With dead ends: 290 [2025-03-08 23:02:50,559 INFO L226 Difference]: Without dead ends: 290 [2025-03-08 23:02:50,559 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-08 23:02:50,560 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 15 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 894 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-08 23:02:50,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 894 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-08 23:02:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-08 23:02:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6984126984126984) internal successors, (321), 287 states have internal predecessors, (321), 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-08 23:02:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 335 transitions. [2025-03-08 23:02:50,565 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 335 transitions. Word has length 28 [2025-03-08 23:02:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:50,565 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 335 transitions. [2025-03-08 23:02:50,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-08 23:02:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 335 transitions. [2025-03-08 23:02:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 23:02:50,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:50,567 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] [2025-03-08 23:02:50,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 23:02:50,567 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-08 23:02:50,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1066235426, now seen corresponding path program 1 times [2025-03-08 23:02:50,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:50,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066053781] [2025-03-08 23:02:50,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:50,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 23:02:50,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 23:02:50,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:50,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:50,749 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-08 23:02:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:50,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066053781] [2025-03-08 23:02:50,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066053781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:50,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:50,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:02:50,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757710253] [2025-03-08 23:02:50,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:50,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:02:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:50,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:02:50,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:02:50,751 INFO L87 Difference]: Start difference. First operand 290 states and 335 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-08 23:02:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:50,913 INFO L93 Difference]: Finished difference Result 319 states and 350 transitions. [2025-03-08 23:02:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:02:50,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 31 [2025-03-08 23:02:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:50,915 INFO L225 Difference]: With dead ends: 319 [2025-03-08 23:02:50,915 INFO L226 Difference]: Without dead ends: 319 [2025-03-08 23:02:50,915 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-08 23:02:50,915 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 158 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1247 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-08 23:02:50,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1247 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-08 23:02:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 290. [2025-03-08 23:02:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 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-08 23:02:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2025-03-08 23:02:50,920 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 31 [2025-03-08 23:02:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:50,920 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2025-03-08 23:02:50,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-08 23:02:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2025-03-08 23:02:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:02:50,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:50,921 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-08 23:02:50,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 23:02:50,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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-08 23:02:50,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2112654141, now seen corresponding path program 1 times [2025-03-08 23:02:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:50,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939805973] [2025-03-08 23:02:50,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:50,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:02:50,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:02:50,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:50,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:51,210 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-08 23:02:51,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:51,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939805973] [2025-03-08 23:02:51,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939805973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:51,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:51,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:02:51,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25331074] [2025-03-08 23:02:51,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:51,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:02:51,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:51,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:02:51,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:02:51,212 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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-08 23:02:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:51,568 INFO L93 Difference]: Finished difference Result 318 states and 349 transitions. [2025-03-08 23:02:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:02:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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 30 [2025-03-08 23:02:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:51,570 INFO L225 Difference]: With dead ends: 318 [2025-03-08 23:02:51,570 INFO L226 Difference]: Without dead ends: 318 [2025-03-08 23:02:51,570 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-08 23:02:51,570 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 152 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:51,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 888 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:02:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-08 23:02:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 290. [2025-03-08 23:02:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 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-08 23:02:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 333 transitions. [2025-03-08 23:02:51,576 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 333 transitions. Word has length 30 [2025-03-08 23:02:51,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:51,576 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 333 transitions. [2025-03-08 23:02:51,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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-08 23:02:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 333 transitions. [2025-03-08 23:02:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:02:51,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:51,576 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-08 23:02:51,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 23:02:51,578 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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-08 23:02:51,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:51,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2112654142, now seen corresponding path program 1 times [2025-03-08 23:02:51,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:51,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724442584] [2025-03-08 23:02:51,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:51,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:51,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:02:51,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:02:51,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:51,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:51,750 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-08 23:02:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724442584] [2025-03-08 23:02:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724442584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:02:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620038917] [2025-03-08 23:02:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:51,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:02:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:51,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:02:51,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:02:51,753 INFO L87 Difference]: Start difference. First operand 290 states and 333 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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-08 23:02:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:52,165 INFO L93 Difference]: Finished difference Result 317 states and 348 transitions. [2025-03-08 23:02:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:02:52,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2025-03-08 23:02:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:52,166 INFO L225 Difference]: With dead ends: 317 [2025-03-08 23:02:52,166 INFO L226 Difference]: Without dead ends: 317 [2025-03-08 23:02:52,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:02:52,167 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 152 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:52,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1165 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:02:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-08 23:02:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 290. [2025-03-08 23:02:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 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-08 23:02:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 332 transitions. [2025-03-08 23:02:52,171 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 332 transitions. Word has length 30 [2025-03-08 23:02:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:52,172 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 332 transitions. [2025-03-08 23:02:52,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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-08 23:02:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 332 transitions. [2025-03-08 23:02:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 23:02:52,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:52,172 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] [2025-03-08 23:02:52,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 23:02:52,173 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-08 23:02:52,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1755041565, now seen corresponding path program 1 times [2025-03-08 23:02:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:52,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004511639] [2025-03-08 23:02:52,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:52,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 23:02:52,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 23:02:52,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:52,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:52,277 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-08 23:02:52,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:52,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004511639] [2025-03-08 23:02:52,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004511639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:52,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:52,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:02:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277793170] [2025-03-08 23:02:52,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:52,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:02:52,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:52,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:02:52,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:02:52,278 INFO L87 Difference]: Start difference. First operand 290 states and 332 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-08 23:02:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:52,442 INFO L93 Difference]: Finished difference Result 316 states and 346 transitions. [2025-03-08 23:02:52,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:02:52,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 31 [2025-03-08 23:02:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:52,443 INFO L225 Difference]: With dead ends: 316 [2025-03-08 23:02:52,443 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 23:02:52,443 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-08 23:02:52,443 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 152 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1247 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-08 23:02:52,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1247 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 23:02:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 290. [2025-03-08 23:02:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 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-08 23:02:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 331 transitions. [2025-03-08 23:02:52,450 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 331 transitions. Word has length 31 [2025-03-08 23:02:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:52,451 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 331 transitions. [2025-03-08 23:02:52,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-08 23:02:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 331 transitions. [2025-03-08 23:02:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:02:52,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:52,451 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-08 23:02:52,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 23:02:52,452 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-08 23:02:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash -82014589, now seen corresponding path program 1 times [2025-03-08 23:02:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:52,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38979580] [2025-03-08 23:02:52,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:52,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:02:52,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:02:52,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:52,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:52,627 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-08 23:02:52,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38979580] [2025-03-08 23:02:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38979580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:52,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:52,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:02:52,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625871252] [2025-03-08 23:02:52,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:52,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:02:52,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:52,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:02:52,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:02:52,629 INFO L87 Difference]: Start difference. First operand 290 states and 331 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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-08 23:02:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:52,930 INFO L93 Difference]: Finished difference Result 315 states and 345 transitions. [2025-03-08 23:02:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:02:52,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2025-03-08 23:02:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:52,931 INFO L225 Difference]: With dead ends: 315 [2025-03-08 23:02:52,931 INFO L226 Difference]: Without dead ends: 315 [2025-03-08 23:02:52,931 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-08 23:02:52,932 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 147 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:52,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 884 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:02:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-08 23:02:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 291. [2025-03-08 23:02:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 190 states have (on average 1.6789473684210525) internal successors, (319), 288 states have internal predecessors, (319), 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-08 23:02:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 333 transitions. [2025-03-08 23:02:52,936 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 333 transitions. Word has length 30 [2025-03-08 23:02:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:52,937 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 333 transitions. [2025-03-08 23:02:52,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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-08 23:02:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 333 transitions. [2025-03-08 23:02:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:02:52,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:52,937 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-08 23:02:52,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 23:02:52,938 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-08 23:02:52,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash -82014588, now seen corresponding path program 1 times [2025-03-08 23:02:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:52,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744165904] [2025-03-08 23:02:52,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:52,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:52,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:02:52,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:02:52,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:52,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:53,173 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-08 23:02:53,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:53,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744165904] [2025-03-08 23:02:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744165904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:53,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:53,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:02:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036569699] [2025-03-08 23:02:53,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:53,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:02:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:53,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:02:53,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:02:53,174 INFO L87 Difference]: Start difference. First operand 291 states and 333 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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-08 23:02:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:53,635 INFO L93 Difference]: Finished difference Result 314 states and 344 transitions. [2025-03-08 23:02:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:02:53,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2025-03-08 23:02:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:53,636 INFO L225 Difference]: With dead ends: 314 [2025-03-08 23:02:53,636 INFO L226 Difference]: Without dead ends: 314 [2025-03-08 23:02:53,636 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-08 23:02:53,637 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 146 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:53,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1132 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:02:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-08 23:02:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 291. [2025-03-08 23:02:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 190 states have (on average 1.6736842105263159) internal successors, (318), 288 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-08 23:02:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 332 transitions. [2025-03-08 23:02:53,641 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 332 transitions. Word has length 30 [2025-03-08 23:02:53,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:53,641 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 332 transitions. [2025-03-08 23:02:53,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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-08 23:02:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 332 transitions. [2025-03-08 23:02:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 23:02:53,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:53,642 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] [2025-03-08 23:02:53,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 23:02:53,642 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-08 23:02:53,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash 466292954, now seen corresponding path program 1 times [2025-03-08 23:02:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382917521] [2025-03-08 23:02:53,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:53,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 23:02:53,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 23:02:53,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:53,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:53,930 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-08 23:02:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382917521] [2025-03-08 23:02:53,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382917521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:53,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:53,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 23:02:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105703241] [2025-03-08 23:02:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:53,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:02:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:53,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:02:53,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:02:53,932 INFO L87 Difference]: Start difference. First operand 291 states and 332 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-08 23:02:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:54,261 INFO L93 Difference]: Finished difference Result 313 states and 342 transitions. [2025-03-08 23:02:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:02:54,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 35 [2025-03-08 23:02:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:54,262 INFO L225 Difference]: With dead ends: 313 [2025-03-08 23:02:54,263 INFO L226 Difference]: Without dead ends: 313 [2025-03-08 23:02:54,263 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-08 23:02:54,263 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 144 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:54,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1580 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:02:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-08 23:02:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 291. [2025-03-08 23:02:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 190 states have (on average 1.668421052631579) internal successors, (317), 288 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-08 23:02:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 331 transitions. [2025-03-08 23:02:54,268 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 331 transitions. Word has length 35 [2025-03-08 23:02:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:54,268 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 331 transitions. [2025-03-08 23:02:54,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-08 23:02:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 331 transitions. [2025-03-08 23:02:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 23:02:54,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:54,269 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] [2025-03-08 23:02:54,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 23:02:54,269 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-08 23:02:54,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash -794191719, now seen corresponding path program 1 times [2025-03-08 23:02:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:54,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469749714] [2025-03-08 23:02:54,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:54,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:54,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 23:02:54,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 23:02:54,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:54,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:54,524 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-08 23:02:54,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:54,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469749714] [2025-03-08 23:02:54,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469749714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:54,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:54,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 23:02:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499626211] [2025-03-08 23:02:54,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:54,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:02:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:54,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:02:54,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:02:54,525 INFO L87 Difference]: Start difference. First operand 291 states and 331 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-08 23:02:54,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:54,852 INFO L93 Difference]: Finished difference Result 312 states and 340 transitions. [2025-03-08 23:02:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:02:54,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 35 [2025-03-08 23:02:54,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:54,854 INFO L225 Difference]: With dead ends: 312 [2025-03-08 23:02:54,854 INFO L226 Difference]: Without dead ends: 312 [2025-03-08 23:02:54,854 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-08 23:02:54,854 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 142 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:54,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1789 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:02:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-08 23:02:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 292. [2025-03-08 23:02:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 191 states have (on average 1.6649214659685865) internal successors, (318), 289 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-08 23:02:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 332 transitions. [2025-03-08 23:02:54,858 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 332 transitions. Word has length 35 [2025-03-08 23:02:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:54,859 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 332 transitions. [2025-03-08 23:02:54,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-08 23:02:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 332 transitions. [2025-03-08 23:02:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 23:02:54,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:54,859 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] [2025-03-08 23:02:54,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 23:02:54,859 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-08 23:02:54,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash 464450915, now seen corresponding path program 1 times [2025-03-08 23:02:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:54,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236110624] [2025-03-08 23:02:54,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:54,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 23:02:54,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 23:02:54,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:54,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:55,116 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-08 23:02:55,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:55,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236110624] [2025-03-08 23:02:55,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236110624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:02:55,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234201245] [2025-03-08 23:02:55,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:55,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:55,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:55,119 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-08 23:02:55,120 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-08 23:02:55,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 23:02:55,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 23:02:55,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:55,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:55,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 23:02:55,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:55,283 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-08 23:02:55,290 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-08 23:02:55,334 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-08 23:02:55,348 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-08 23:02:55,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:02:55,454 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-08 23:02:55,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234201245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:02:55,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:02:55,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 15 [2025-03-08 23:02:55,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749626772] [2025-03-08 23:02:55,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:02:55,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 23:02:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:55,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 23:02:55,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 23:02:55,457 INFO L87 Difference]: Start difference. First operand 292 states and 332 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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-08 23:02:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:55,693 INFO L93 Difference]: Finished difference Result 366 states and 413 transitions. [2025-03-08 23:02:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:02:55,696 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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 35 [2025-03-08 23:02:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:55,697 INFO L225 Difference]: With dead ends: 366 [2025-03-08 23:02:55,697 INFO L226 Difference]: Without dead ends: 366 [2025-03-08 23:02:55,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-08 23:02:55,698 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 138 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:55,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1756 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-08 23:02:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 308. [2025-03-08 23:02:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 207 states have (on average 1.6183574879227054) 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-08 23:02:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 349 transitions. [2025-03-08 23:02:55,704 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 349 transitions. Word has length 35 [2025-03-08 23:02:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:55,704 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 349 transitions. [2025-03-08 23:02:55,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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-08 23:02:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 349 transitions. [2025-03-08 23:02:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:02:55,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:55,705 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-08 23:02:55,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 23:02:55,909 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-08 23:02:55,909 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-08 23:02:55,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:55,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1436786162, now seen corresponding path program 1 times [2025-03-08 23:02:55,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:55,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438564857] [2025-03-08 23:02:55,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:55,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:55,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:02:55,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:02:55,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:55,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:55,965 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-08 23:02:55,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:55,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438564857] [2025-03-08 23:02:55,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438564857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:55,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:55,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:02:55,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125935517] [2025-03-08 23:02:55,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:55,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:02:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:55,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:02:55,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:02:55,967 INFO L87 Difference]: Start difference. First operand 308 states and 349 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-08 23:02:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:56,115 INFO L93 Difference]: Finished difference Result 308 states and 351 transitions. [2025-03-08 23:02:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:02:56,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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 37 [2025-03-08 23:02:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:56,117 INFO L225 Difference]: With dead ends: 308 [2025-03-08 23:02:56,117 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 23:02:56,117 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-08 23:02:56,117 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 101 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:56,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 423 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 23:02:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-08 23:02:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 209 states have (on average 1.61244019138756) internal successors, (337), 305 states have internal predecessors, (337), 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-08 23:02:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 351 transitions. [2025-03-08 23:02:56,122 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 351 transitions. Word has length 37 [2025-03-08 23:02:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:56,122 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 351 transitions. [2025-03-08 23:02:56,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-08 23:02:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 351 transitions. [2025-03-08 23:02:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:02:56,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:56,123 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-08 23:02:56,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 23:02:56,123 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-08 23:02:56,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:56,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1436786161, now seen corresponding path program 1 times [2025-03-08 23:02:56,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:56,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039929799] [2025-03-08 23:02:56,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:56,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:56,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:02:56,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:02:56,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:56,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:56,211 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-08 23:02:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:56,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039929799] [2025-03-08 23:02:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039929799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:02:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010649249] [2025-03-08 23:02:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:56,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:02:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:56,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:02:56,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:02:56,213 INFO L87 Difference]: Start difference. First operand 308 states and 351 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-08 23:02:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:56,447 INFO L93 Difference]: Finished difference Result 335 states and 368 transitions. [2025-03-08 23:02:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:02:56,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-08 23:02:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:56,448 INFO L225 Difference]: With dead ends: 335 [2025-03-08 23:02:56,448 INFO L226 Difference]: Without dead ends: 335 [2025-03-08 23:02:56,448 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-08 23:02:56,449 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 89 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:56,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 600 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-08 23:02:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 314. [2025-03-08 23:02:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 215 states have (on average 1.6046511627906976) internal successors, (345), 311 states have internal predecessors, (345), 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-08 23:02:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 359 transitions. [2025-03-08 23:02:56,453 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 359 transitions. Word has length 37 [2025-03-08 23:02:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:56,453 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 359 transitions. [2025-03-08 23:02:56,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-08 23:02:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 359 transitions. [2025-03-08 23:02:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 23:02:56,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:56,454 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] [2025-03-08 23:02:56,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 23:02:56,454 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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-08 23:02:56,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:56,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2070718359, now seen corresponding path program 1 times [2025-03-08 23:02:56,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:56,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562316550] [2025-03-08 23:02:56,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:56,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:56,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:02:56,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:02:56,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:56,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:56,501 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-08 23:02:56,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:56,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562316550] [2025-03-08 23:02:56,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562316550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:56,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:56,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:02:56,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797368771] [2025-03-08 23:02:56,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:56,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:02:56,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:56,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:02:56,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:02:56,502 INFO L87 Difference]: Start difference. First operand 314 states and 359 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 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-08 23:02:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:56,634 INFO L93 Difference]: Finished difference Result 311 states and 353 transitions. [2025-03-08 23:02:56,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:02:56,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 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 39 [2025-03-08 23:02:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:56,636 INFO L225 Difference]: With dead ends: 311 [2025-03-08 23:02:56,636 INFO L226 Difference]: Without dead ends: 311 [2025-03-08 23:02:56,636 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-08 23:02:56,636 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 49 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:56,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 498 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-08 23:02:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2025-03-08 23:02:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 215 states have (on average 1.5767441860465117) internal successors, (339), 308 states have internal predecessors, (339), 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-08 23:02:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 353 transitions. [2025-03-08 23:02:56,641 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 353 transitions. Word has length 39 [2025-03-08 23:02:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:56,641 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 353 transitions. [2025-03-08 23:02:56,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 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-08 23:02:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 353 transitions. [2025-03-08 23:02:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 23:02:56,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:56,642 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] [2025-03-08 23:02:56,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 23:02:56,642 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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-08 23:02:56,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2070718358, now seen corresponding path program 1 times [2025-03-08 23:02:56,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:56,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253707124] [2025-03-08 23:02:56,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:56,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:02:56,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:02:56,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:56,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:56,733 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-08 23:02:56,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:56,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253707124] [2025-03-08 23:02:56,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253707124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:56,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:56,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:02:56,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135316771] [2025-03-08 23:02:56,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:56,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:02:56,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:56,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:02:56,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:02:56,735 INFO L87 Difference]: Start difference. First operand 311 states and 353 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 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-08 23:02:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:56,962 INFO L93 Difference]: Finished difference Result 321 states and 354 transitions. [2025-03-08 23:02:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:02:56,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 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 39 [2025-03-08 23:02:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:56,964 INFO L225 Difference]: With dead ends: 321 [2025-03-08 23:02:56,964 INFO L226 Difference]: Without dead ends: 321 [2025-03-08 23:02:56,964 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-08 23:02:56,964 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 83 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:56,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 607 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-08 23:02:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 311. [2025-03-08 23:02:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 215 states have (on average 1.5627906976744186) internal successors, (336), 308 states have internal predecessors, (336), 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-08 23:02:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 350 transitions. [2025-03-08 23:02:56,969 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 350 transitions. Word has length 39 [2025-03-08 23:02:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:56,970 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 350 transitions. [2025-03-08 23:02:56,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 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-08 23:02:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 350 transitions. [2025-03-08 23:02:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 23:02:56,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:56,970 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] [2025-03-08 23:02:56,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 23:02:56,971 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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-08 23:02:56,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:56,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2067048968, now seen corresponding path program 1 times [2025-03-08 23:02:56,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:56,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71008470] [2025-03-08 23:02:56,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:56,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:56,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:02:56,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:02:56,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:56,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:57,016 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-08 23:02:57,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:57,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71008470] [2025-03-08 23:02:57,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71008470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:57,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:57,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:02:57,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216445551] [2025-03-08 23:02:57,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:57,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:02:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:57,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:02:57,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:02:57,018 INFO L87 Difference]: Start difference. First operand 311 states and 350 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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-08 23:02:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:57,091 INFO L93 Difference]: Finished difference Result 380 states and 422 transitions. [2025-03-08 23:02:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:02:57,092 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), 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 39 [2025-03-08 23:02:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:57,093 INFO L225 Difference]: With dead ends: 380 [2025-03-08 23:02:57,093 INFO L226 Difference]: Without dead ends: 380 [2025-03-08 23:02:57,093 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-08 23:02:57,093 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 230 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 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-08 23:02:57,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1032 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-08 23:02:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 311. [2025-03-08 23:02:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 215 states have (on average 1.558139534883721) internal successors, (335), 308 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-08 23:02:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 349 transitions. [2025-03-08 23:02:57,099 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 349 transitions. Word has length 39 [2025-03-08 23:02:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:57,099 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 349 transitions. [2025-03-08 23:02:57,099 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), 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-08 23:02:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 349 transitions. [2025-03-08 23:02:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:02:57,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:57,099 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] [2025-03-08 23:02:57,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 23:02:57,100 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-08 23:02:57,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1384500807, now seen corresponding path program 1 times [2025-03-08 23:02:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:57,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686151645] [2025-03-08 23:02:57,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:57,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:02:57,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:02:57,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:57,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:57,157 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-08 23:02:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686151645] [2025-03-08 23:02:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686151645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:57,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:57,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:02:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106690884] [2025-03-08 23:02:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:57,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:02:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:57,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:02:57,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:02:57,158 INFO L87 Difference]: Start difference. First operand 311 states and 349 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-08 23:02:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:57,216 INFO L93 Difference]: Finished difference Result 322 states and 354 transitions. [2025-03-08 23:02:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:02:57,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 41 [2025-03-08 23:02:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:57,218 INFO L225 Difference]: With dead ends: 322 [2025-03-08 23:02:57,218 INFO L226 Difference]: Without dead ends: 322 [2025-03-08 23:02:57,218 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-08 23:02:57,218 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 173 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1072 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-08 23:02:57,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1072 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:02:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-08 23:02:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 311. [2025-03-08 23:02:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 215 states have (on average 1.5534883720930233) internal successors, (334), 308 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-08 23:02:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 348 transitions. [2025-03-08 23:02:57,222 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 348 transitions. Word has length 41 [2025-03-08 23:02:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:57,223 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 348 transitions. [2025-03-08 23:02:57,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-08 23:02:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 348 transitions. [2025-03-08 23:02:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:02:57,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:57,223 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] [2025-03-08 23:02:57,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 23:02:57,223 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-08 23:02:57,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:57,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2106740950, now seen corresponding path program 1 times [2025-03-08 23:02:57,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:57,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756180752] [2025-03-08 23:02:57,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:57,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:57,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:02:57,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:02:57,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:57,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:57,399 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-08 23:02:57,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:57,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756180752] [2025-03-08 23:02:57,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756180752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:02:57,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032210911] [2025-03-08 23:02:57,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:57,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:57,402 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-08 23:02:57,403 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-08 23:02:57,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:02:57,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:02:57,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:57,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:57,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 23:02:57,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:57,562 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-08 23:02:57,565 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-08 23:02:57,703 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-08 23:02:57,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:02:57,852 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-08 23:02:57,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032210911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:02:57,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:02:57,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 15 [2025-03-08 23:02:57,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164836664] [2025-03-08 23:02:57,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:02:57,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 23:02:57,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:57,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 23:02:57,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-08 23:02:57,854 INFO L87 Difference]: Start difference. First operand 311 states and 348 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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-08 23:02:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:58,083 INFO L93 Difference]: Finished difference Result 362 states and 403 transitions. [2025-03-08 23:02:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:02:58,083 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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 41 [2025-03-08 23:02:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:58,084 INFO L225 Difference]: With dead ends: 362 [2025-03-08 23:02:58,084 INFO L226 Difference]: Without dead ends: 362 [2025-03-08 23:02:58,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 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-08 23:02:58,085 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 72 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:58,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2187 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-08 23:02:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 326. [2025-03-08 23:02:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 230 states have (on average 1.517391304347826) internal successors, (349), 323 states have internal predecessors, (349), 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-08 23:02:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 363 transitions. [2025-03-08 23:02:58,090 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 363 transitions. Word has length 41 [2025-03-08 23:02:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:58,090 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 363 transitions. [2025-03-08 23:02:58,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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-08 23:02:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 363 transitions. [2025-03-08 23:02:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 23:02:58,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:58,091 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] [2025-03-08 23:02:58,097 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-08 23:02:58,295 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-08 23:02:58,295 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-08 23:02:58,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1091480966, now seen corresponding path program 1 times [2025-03-08 23:02:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:58,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746586544] [2025-03-08 23:02:58,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:58,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:58,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 23:02:58,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 23:02:58,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:58,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:58,555 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-08 23:02:58,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:58,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746586544] [2025-03-08 23:02:58,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746586544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:02:58,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572173648] [2025-03-08 23:02:58,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:58,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:58,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:58,558 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-08 23:02:58,559 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-08 23:02:58,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 23:02:58,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 23:02:58,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:58,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:58,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 23:02:58,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:58,692 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-08 23:02:58,695 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-08 23:02:58,823 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-08 23:02:58,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:02:58,956 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-08 23:02:58,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572173648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:02:58,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:02:58,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 13 [2025-03-08 23:02:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727449157] [2025-03-08 23:02:58,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:02:58,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 23:02:58,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:58,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 23:02:58,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:02:58,957 INFO L87 Difference]: Start difference. First operand 326 states and 363 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-08 23:02:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:59,158 INFO L93 Difference]: Finished difference Result 361 states and 401 transitions. [2025-03-08 23:02:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:02:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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 44 [2025-03-08 23:02:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:59,159 INFO L225 Difference]: With dead ends: 361 [2025-03-08 23:02:59,159 INFO L226 Difference]: Without dead ends: 361 [2025-03-08 23:02:59,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 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-08 23:02:59,160 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 50 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1748 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-08 23:02:59,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1748 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-08 23:02:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 331. [2025-03-08 23:02:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 235 states have (on average 1.5063829787234042) internal successors, (354), 328 states have internal predecessors, (354), 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-08 23:02:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 368 transitions. [2025-03-08 23:02:59,164 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 368 transitions. Word has length 44 [2025-03-08 23:02:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:59,165 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 368 transitions. [2025-03-08 23:02:59,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-08 23:02:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 368 transitions. [2025-03-08 23:02:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 23:02:59,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:59,165 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-08 23:02:59,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 23:02:59,370 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-08 23:02:59,370 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-08 23:02:59,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:59,370 INFO L85 PathProgramCache]: Analyzing trace with hash -887453196, now seen corresponding path program 1 times [2025-03-08 23:02:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:59,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927059708] [2025-03-08 23:02:59,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:59,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:59,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 23:02:59,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 23:02:59,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:59,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:59,532 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-08 23:02:59,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:02:59,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927059708] [2025-03-08 23:02:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927059708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:59,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:59,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 23:02:59,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140817684] [2025-03-08 23:02:59,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:59,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 23:02:59,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:02:59,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 23:02:59,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:02:59,534 INFO L87 Difference]: Start difference. First operand 331 states and 368 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-08 23:02:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:59,790 INFO L93 Difference]: Finished difference Result 375 states and 410 transitions. [2025-03-08 23:02:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 23:02:59,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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 47 [2025-03-08 23:02:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:59,791 INFO L225 Difference]: With dead ends: 375 [2025-03-08 23:02:59,791 INFO L226 Difference]: Without dead ends: 375 [2025-03-08 23:02:59,791 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-08 23:02:59,792 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 201 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1743 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-08 23:02:59,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1743 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-08 23:02:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 343. [2025-03-08 23:02:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 247 states have (on average 1.4898785425101215) internal successors, (368), 340 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-08 23:02:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 382 transitions. [2025-03-08 23:02:59,797 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 382 transitions. Word has length 47 [2025-03-08 23:02:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:59,798 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 382 transitions. [2025-03-08 23:02:59,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-08 23:02:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 382 transitions. [2025-03-08 23:02:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:02:59,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:59,798 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] [2025-03-08 23:02:59,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 23:02:59,798 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-08 23:02:59,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash -696199863, now seen corresponding path program 2 times [2025-03-08 23:02:59,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:02:59,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31364618] [2025-03-08 23:02:59,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:02:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:02:59,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-08 23:02:59,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:02:59,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:02:59,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:00,143 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-08 23:03:00,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31364618] [2025-03-08 23:03:00,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31364618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:00,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020280863] [2025-03-08 23:03:00,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:03:00,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:00,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:00,146 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-08 23:03:00,147 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-08 23:03:00,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-08 23:03:00,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:03:00,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:03:00,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:00,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 23:03:00,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:00,262 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-08 23:03:00,287 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:03:00,287 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-08 23:03:00,332 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:03:00,332 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 18 treesize of output 17 [2025-03-08 23:03:00,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 15 treesize of output 1 [2025-03-08 23:03:00,395 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 44 treesize of output 32 [2025-03-08 23:03:00,726 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 26 treesize of output 14 [2025-03-08 23:03:00,754 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-08 23:03:00,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:01,117 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 33 treesize of output 29 [2025-03-08 23:03:01,124 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 82 treesize of output 76 [2025-03-08 23:03:01,283 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-08 23:03:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020280863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:01,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:01,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 30 [2025-03-08 23:03:01,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801796974] [2025-03-08 23:03:01,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:01,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 23:03:01,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:01,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 23:03:01,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-03-08 23:03:01,285 INFO L87 Difference]: Start difference. First operand 343 states and 382 transitions. Second operand has 31 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 31 states have internal predecessors, (109), 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-08 23:03:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:02,545 INFO L93 Difference]: Finished difference Result 376 states and 418 transitions. [2025-03-08 23:03:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 23:03:02,545 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 31 states have internal predecessors, (109), 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 46 [2025-03-08 23:03:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:02,546 INFO L225 Difference]: With dead ends: 376 [2025-03-08 23:03:02,546 INFO L226 Difference]: Without dead ends: 376 [2025-03-08 23:03:02,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 23:03:02,547 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 481 mSDsluCounter, 2796 mSDsCounter, 0 mSdLazyCounter, 2680 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:02,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 3037 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2680 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 23:03:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-08 23:03:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 345. [2025-03-08 23:03:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 249 states have (on average 1.4899598393574298) internal successors, (371), 342 states have internal predecessors, (371), 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-08 23:03:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 385 transitions. [2025-03-08 23:03:02,553 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 385 transitions. Word has length 46 [2025-03-08 23:03:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:02,553 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 385 transitions. [2025-03-08 23:03:02,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 31 states have internal predecessors, (109), 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-08 23:03:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 385 transitions. [2025-03-08 23:03:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:03:02,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:02,553 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] [2025-03-08 23:03:02,560 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-08 23:03:02,754 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-08 23:03:02,754 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-08 23:03:02,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash -696199862, now seen corresponding path program 1 times [2025-03-08 23:03:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:02,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202025756] [2025-03-08 23:03:02,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:02,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:03:02,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:03:02,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:02,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:03,202 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-08 23:03:03,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:03,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202025756] [2025-03-08 23:03:03,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202025756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:03,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498182298] [2025-03-08 23:03:03,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:03,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:03,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:03,205 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-08 23:03:03,206 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-08 23:03:03,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:03:03,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:03:03,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:03,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:03,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-08 23:03:03,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:03,331 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-08 23:03:03,333 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-08 23:03:03,378 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 23:03:03,379 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-08 23:03:03,385 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-08 23:03:03,446 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:03:03,447 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-08 23:03:03,462 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-08 23:03:03,462 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-08 23:03:03,504 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-08 23:03:03,536 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-08 23:03:03,546 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-08 23:03:03,812 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-08 23:03:03,815 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-08 23:03:03,818 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-08 23:03:03,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:04,403 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-08 23:03:04,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498182298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:04,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:04,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2025-03-08 23:03:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570158593] [2025-03-08 23:03:04,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:04,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 23:03:04,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:04,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 23:03:04,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-03-08 23:03:04,408 INFO L87 Difference]: Start difference. First operand 345 states and 385 transitions. Second operand has 30 states, 29 states have (on average 4.206896551724138) internal successors, (122), 30 states have internal predecessors, (122), 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-08 23:03:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:06,114 INFO L93 Difference]: Finished difference Result 419 states and 461 transitions. [2025-03-08 23:03:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 23:03:06,114 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.206896551724138) internal successors, (122), 30 states have internal predecessors, (122), 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 46 [2025-03-08 23:03:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:06,115 INFO L225 Difference]: With dead ends: 419 [2025-03-08 23:03:06,115 INFO L226 Difference]: Without dead ends: 419 [2025-03-08 23:03:06,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=1753, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 23:03:06,116 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1049 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 3008 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 2841 SdHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:06,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 2841 Invalid, 3035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3008 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 23:03:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-08 23:03:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 361. [2025-03-08 23:03:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 268 states have (on average 1.458955223880597) internal successors, (391), 358 states have internal predecessors, (391), 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-08 23:03:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 405 transitions. [2025-03-08 23:03:06,120 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 405 transitions. Word has length 46 [2025-03-08 23:03:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:06,120 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 405 transitions. [2025-03-08 23:03:06,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.206896551724138) internal successors, (122), 30 states have internal predecessors, (122), 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-08 23:03:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 405 transitions. [2025-03-08 23:03:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 23:03:06,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:06,120 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] [2025-03-08 23:03:06,127 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-08 23:03:06,321 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-08 23:03:06,321 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-08 23:03:06,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1940081302, now seen corresponding path program 1 times [2025-03-08 23:03:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:06,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424142066] [2025-03-08 23:03:06,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:06,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 23:03:06,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 23:03:06,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:06,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:06,403 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-08 23:03:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424142066] [2025-03-08 23:03:06,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424142066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:06,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:06,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:03:06,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597622920] [2025-03-08 23:03:06,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:06,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:03:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:06,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:03:06,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:03:06,405 INFO L87 Difference]: Start difference. First operand 361 states and 405 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 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-08 23:03:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:06,694 INFO L93 Difference]: Finished difference Result 381 states and 426 transitions. [2025-03-08 23:03:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:03:06,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 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 48 [2025-03-08 23:03:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:06,700 INFO L225 Difference]: With dead ends: 381 [2025-03-08 23:03:06,700 INFO L226 Difference]: Without dead ends: 381 [2025-03-08 23:03:06,700 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-08 23:03:06,701 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 62 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:06,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1181 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:03:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-08 23:03:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 364. [2025-03-08 23:03:06,704 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-08 23:03:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 407 transitions. [2025-03-08 23:03:06,705 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 407 transitions. Word has length 48 [2025-03-08 23:03:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:06,705 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 407 transitions. [2025-03-08 23:03:06,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 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-08 23:03:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 407 transitions. [2025-03-08 23:03:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 23:03:06,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:06,705 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] [2025-03-08 23:03:06,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 23:03:06,705 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-08 23:03:06,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:06,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1940081301, now seen corresponding path program 1 times [2025-03-08 23:03:06,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:06,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091567372] [2025-03-08 23:03:06,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:06,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:06,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 23:03:06,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 23:03:06,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:06,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:06,886 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-08 23:03:06,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091567372] [2025-03-08 23:03:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091567372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:06,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 23:03:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021890960] [2025-03-08 23:03:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:06,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 23:03:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:06,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 23:03:06,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:03:06,888 INFO L87 Difference]: Start difference. First operand 364 states and 407 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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-08 23:03:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:07,354 INFO L93 Difference]: Finished difference Result 395 states and 437 transitions. [2025-03-08 23:03:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 23:03:07,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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 48 [2025-03-08 23:03:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:07,355 INFO L225 Difference]: With dead ends: 395 [2025-03-08 23:03:07,355 INFO L226 Difference]: Without dead ends: 395 [2025-03-08 23:03:07,356 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-08 23:03:07,356 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 145 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:07,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1742 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:03:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-08 23:03:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 367. [2025-03-08 23:03:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 276 states have (on average 1.434782608695652) internal successors, (396), 364 states have internal predecessors, (396), 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-08 23:03:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 410 transitions. [2025-03-08 23:03:07,361 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 410 transitions. Word has length 48 [2025-03-08 23:03:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:07,361 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 410 transitions. [2025-03-08 23:03:07,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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-08 23:03:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 410 transitions. [2025-03-08 23:03:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 23:03:07,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:07,361 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, 1] [2025-03-08 23:03:07,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 23:03:07,362 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-08 23:03:07,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:07,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1561008286, now seen corresponding path program 1 times [2025-03-08 23:03:07,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:07,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523495256] [2025-03-08 23:03:07,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:07,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:07,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 23:03:07,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 23:03:07,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:07,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:07,671 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-08 23:03:07,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523495256] [2025-03-08 23:03:07,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523495256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335595262] [2025-03-08 23:03:07,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:07,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:07,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:07,673 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-08 23:03:07,674 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-08 23:03:07,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 23:03:07,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 23:03:07,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:07,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:07,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 23:03:07,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:07,800 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-08 23:03:07,806 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-08 23:03:07,816 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-08 23:03:07,823 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-08 23:03:07,846 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:03:07,846 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-08 23:03:07,850 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-08 23:03:07,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:07,941 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-08 23:03:07,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335595262] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:07,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:07,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 3, 3] total 14 [2025-03-08 23:03:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458030178] [2025-03-08 23:03:07,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:07,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 23:03:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:07,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 23:03:07,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-08 23:03:07,942 INFO L87 Difference]: Start difference. First operand 367 states and 410 transitions. Second operand has 15 states, 15 states have (on average 7.266666666666667) internal successors, (109), 14 states have internal predecessors, (109), 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-08 23:03:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:08,250 INFO L93 Difference]: Finished difference Result 365 states and 404 transitions. [2025-03-08 23:03:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:03:08,251 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.266666666666667) internal successors, (109), 14 states have internal predecessors, (109), 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 52 [2025-03-08 23:03:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:08,251 INFO L225 Difference]: With dead ends: 365 [2025-03-08 23:03:08,252 INFO L226 Difference]: Without dead ends: 365 [2025-03-08 23:03:08,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 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-08 23:03:08,252 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1194 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:08,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 950 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:03:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-08 23:03:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-08 23:03:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 276 states have (on average 1.4202898550724639) internal successors, (392), 362 states have internal predecessors, (392), 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-08 23:03:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 404 transitions. [2025-03-08 23:03:08,256 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 404 transitions. Word has length 52 [2025-03-08 23:03:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:08,256 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 404 transitions. [2025-03-08 23:03:08,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.266666666666667) internal successors, (109), 14 states have internal predecessors, (109), 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-08 23:03:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 404 transitions. [2025-03-08 23:03:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 23:03:08,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:08,257 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] [2025-03-08 23:03:08,263 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-08 23:03:08,457 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-08 23:03:08,457 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-08 23:03:08,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash -85745875, now seen corresponding path program 1 times [2025-03-08 23:03:08,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:08,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216772362] [2025-03-08 23:03:08,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:08,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:08,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 23:03:08,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 23:03:08,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:08,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:08,643 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-08 23:03:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216772362] [2025-03-08 23:03:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216772362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:08,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:08,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 23:03:08,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782768757] [2025-03-08 23:03:08,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:08,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:03:08,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:08,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:03:08,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:03:08,644 INFO L87 Difference]: Start difference. First operand 365 states and 404 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-08 23:03:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:08,943 INFO L93 Difference]: Finished difference Result 372 states and 411 transitions. [2025-03-08 23:03:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 23:03:08,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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 52 [2025-03-08 23:03:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:08,944 INFO L225 Difference]: With dead ends: 372 [2025-03-08 23:03:08,944 INFO L226 Difference]: Without dead ends: 372 [2025-03-08 23:03:08,945 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-08 23:03:08,945 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 46 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1804 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-08 23:03:08,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1804 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:03:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-08 23:03:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2025-03-08 23:03:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 275 states have (on average 1.4181818181818182) internal successors, (390), 361 states have internal predecessors, (390), 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-08 23:03:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 402 transitions. [2025-03-08 23:03:08,949 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 402 transitions. Word has length 52 [2025-03-08 23:03:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:08,950 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 402 transitions. [2025-03-08 23:03:08,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-08 23:03:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 402 transitions. [2025-03-08 23:03:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 23:03:08,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:08,950 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] [2025-03-08 23:03:08,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 23:03:08,951 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-08 23:03:08,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash 821398160, now seen corresponding path program 2 times [2025-03-08 23:03:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:08,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729726370] [2025-03-08 23:03:08,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:03:08,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:08,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-08 23:03:08,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 52 statements. [2025-03-08 23:03:08,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 23:03:08,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:09,047 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-08 23:03:09,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:09,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729726370] [2025-03-08 23:03:09,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729726370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:09,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:09,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:03:09,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80273837] [2025-03-08 23:03:09,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:09,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:03:09,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:09,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:03:09,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:03:09,049 INFO L87 Difference]: Start difference. First operand 364 states and 402 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-08 23:03:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:09,173 INFO L93 Difference]: Finished difference Result 372 states and 410 transitions. [2025-03-08 23:03:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:03:09,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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 52 [2025-03-08 23:03:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:09,175 INFO L225 Difference]: With dead ends: 372 [2025-03-08 23:03:09,175 INFO L226 Difference]: Without dead ends: 372 [2025-03-08 23:03:09,175 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-08 23:03:09,175 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 45 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:09,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1024 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-08 23:03:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2025-03-08 23:03:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 275 states have (on average 1.4145454545454546) internal successors, (389), 361 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-08 23:03:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 401 transitions. [2025-03-08 23:03:09,179 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 401 transitions. Word has length 52 [2025-03-08 23:03:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:09,179 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 401 transitions. [2025-03-08 23:03:09,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-08 23:03:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 401 transitions. [2025-03-08 23:03:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 23:03:09,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:09,180 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] [2025-03-08 23:03:09,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 23:03:09,180 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-08 23:03:09,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:09,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1796623249, now seen corresponding path program 1 times [2025-03-08 23:03:09,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:09,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441210037] [2025-03-08 23:03:09,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:09,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:09,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 23:03:09,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 23:03:09,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:09,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:09,228 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-08 23:03:09,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:09,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441210037] [2025-03-08 23:03:09,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441210037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:09,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:09,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:03:09,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226643883] [2025-03-08 23:03:09,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:09,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:03:09,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:09,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:03:09,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:03:09,229 INFO L87 Difference]: Start difference. First operand 364 states and 401 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-08 23:03:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:09,298 INFO L93 Difference]: Finished difference Result 363 states and 398 transitions. [2025-03-08 23:03:09,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:09,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 55 [2025-03-08 23:03:09,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:09,299 INFO L225 Difference]: With dead ends: 363 [2025-03-08 23:03:09,299 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 23:03:09,300 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-08 23:03:09,300 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 3 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 875 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:09,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 875 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 23:03:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-03-08 23:03:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 275 states have (on average 1.4072727272727272) internal successors, (387), 360 states have internal predecessors, (387), 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-08 23:03:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 398 transitions. [2025-03-08 23:03:09,304 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 398 transitions. Word has length 55 [2025-03-08 23:03:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:09,304 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 398 transitions. [2025-03-08 23:03:09,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-08 23:03:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 398 transitions. [2025-03-08 23:03:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 23:03:09,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:09,304 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, 1] [2025-03-08 23:03:09,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 23:03:09,305 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-08 23:03:09,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:09,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1797042080, now seen corresponding path program 2 times [2025-03-08 23:03:09,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:09,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678053562] [2025-03-08 23:03:09,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:03:09,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:09,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-08 23:03:09,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 55 statements. [2025-03-08 23:03:09,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 23:03:09,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:09,418 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-08 23:03:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678053562] [2025-03-08 23:03:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678053562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:09,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:09,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:03:09,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278769673] [2025-03-08 23:03:09,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:09,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:03:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:09,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:03:09,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:03:09,419 INFO L87 Difference]: Start difference. First operand 363 states and 398 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-08 23:03:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:09,585 INFO L93 Difference]: Finished difference Result 369 states and 403 transitions. [2025-03-08 23:03:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:03:09,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 55 [2025-03-08 23:03:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:09,586 INFO L225 Difference]: With dead ends: 369 [2025-03-08 23:03:09,586 INFO L226 Difference]: Without dead ends: 369 [2025-03-08 23:03:09,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:03:09,587 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 48 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:09,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1213 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:03:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-08 23:03:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 343. [2025-03-08 23:03:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 255 states have (on average 1.4352941176470588) internal successors, (366), 340 states have internal predecessors, (366), 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-08 23:03:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 377 transitions. [2025-03-08 23:03:09,590 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 377 transitions. Word has length 55 [2025-03-08 23:03:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:09,590 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 377 transitions. [2025-03-08 23:03:09,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-08 23:03:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 377 transitions. [2025-03-08 23:03:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 23:03:09,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:09,591 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] [2025-03-08 23:03:09,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 23:03:09,591 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-08 23:03:09,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1751363291, now seen corresponding path program 1 times [2025-03-08 23:03:09,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:09,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580862743] [2025-03-08 23:03:09,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:09,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:09,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:03:09,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:03:09,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:09,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:09,629 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-08 23:03:09,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580862743] [2025-03-08 23:03:09,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580862743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:03:09,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:03:09,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:03:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636113896] [2025-03-08 23:03:09,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:03:09,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:03:09,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:09,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:03:09,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:03:09,630 INFO L87 Difference]: Start difference. First operand 343 states and 377 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-08 23:03:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:09,678 INFO L93 Difference]: Finished difference Result 350 states and 380 transitions. [2025-03-08 23:03:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:03:09,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2025-03-08 23:03:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:09,681 INFO L225 Difference]: With dead ends: 350 [2025-03-08 23:03:09,681 INFO L226 Difference]: Without dead ends: 350 [2025-03-08 23:03:09,681 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-08 23:03:09,682 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 47 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:09,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 622 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:03:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-08 23:03:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 344. [2025-03-08 23:03:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 256 states have (on average 1.43359375) internal successors, (367), 341 states have internal predecessors, (367), 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-08 23:03:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 378 transitions. [2025-03-08 23:03:09,689 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 378 transitions. Word has length 57 [2025-03-08 23:03:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:09,689 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 378 transitions. [2025-03-08 23:03:09,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-08 23:03:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 378 transitions. [2025-03-08 23:03:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 23:03:09,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:09,690 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, 1] [2025-03-08 23:03:09,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 23:03:09,690 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-08 23:03:09,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash -755145511, now seen corresponding path program 1 times [2025-03-08 23:03:09,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:09,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804166355] [2025-03-08 23:03:09,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:09,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:09,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 23:03:09,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 23:03:09,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:09,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:10,302 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-08 23:03:10,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:10,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804166355] [2025-03-08 23:03:10,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804166355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:10,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376970334] [2025-03-08 23:03:10,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:10,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:10,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:10,304 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-08 23:03:10,305 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-08 23:03:10,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 23:03:10,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 23:03:10,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:10,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:10,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-08 23:03:10,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:10,480 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-08 23:03:10,518 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-08 23:03:10,522 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-08 23:03:10,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:03:10,598 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-08 23:03:10,640 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-08 23:03:10,647 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-08 23:03:10,665 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-08 23:03:10,668 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-08 23:03:10,753 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:03:10,753 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-08 23:03:10,760 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 19 treesize of output 18 [2025-03-08 23:03:10,807 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-08 23:03:10,807 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-08 23:03:10,816 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2025-03-08 23:03:10,817 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 30 treesize of output 32 [2025-03-08 23:03:11,397 INFO L349 Elim1Store]: treesize reduction 20, result has 71.0 percent of original size [2025-03-08 23:03:11,397 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 118 [2025-03-08 23:03:11,667 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-03-08 23:03:11,667 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 39 treesize of output 24 [2025-03-08 23:03:11,670 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-08 23:03:11,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:12,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:12,357 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 66 treesize of output 68 [2025-03-08 23:03:17,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:17,671 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 50 treesize of output 40 [2025-03-08 23:03:17,676 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 126 treesize of output 110 [2025-03-08 23:03:17,682 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:17,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:17,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 125 [2025-03-08 23:03:17,707 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 73 treesize of output 67 [2025-03-08 23:03:17,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:17,832 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 24 treesize of output 25 [2025-03-08 23:03:17,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:17,852 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 46 treesize of output 37 [2025-03-08 23:03:17,855 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:17,860 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 35 treesize of output 25 [2025-03-08 23:03:17,865 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:17,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:17,876 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 86 treesize of output 86 [2025-03-08 23:03:17,883 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:17,886 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 37 treesize of output 33 [2025-03-08 23:03:17,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:17,906 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 32 treesize of output 42 [2025-03-08 23:03:17,981 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:17,985 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 48 treesize of output 32 [2025-03-08 23:03:18,160 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-08 23:03:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376970334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:18,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 53 [2025-03-08 23:03:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60624116] [2025-03-08 23:03:18,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:18,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-08 23:03:18,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:18,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-08 23:03:18,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2580, Unknown=8, NotChecked=0, Total=2756 [2025-03-08 23:03:18,162 INFO L87 Difference]: Start difference. First operand 344 states and 378 transitions. Second operand has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 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-08 23:03:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:23,129 INFO L93 Difference]: Finished difference Result 558 states and 601 transitions. [2025-03-08 23:03:23,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-08 23:03:23,130 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 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 58 [2025-03-08 23:03:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:23,131 INFO L225 Difference]: With dead ends: 558 [2025-03-08 23:03:23,131 INFO L226 Difference]: Without dead ends: 558 [2025-03-08 23:03:23,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=695, Invalid=6779, Unknown=8, NotChecked=0, Total=7482 [2025-03-08 23:03:23,132 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1700 mSDsluCounter, 7478 mSDsCounter, 0 mSdLazyCounter, 4116 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 7720 SdHoareTripleChecker+Invalid, 4172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 4116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:23,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 7720 Invalid, 4172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 4116 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 23:03:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-08 23:03:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 401. [2025-03-08 23:03:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 313 states have (on average 1.3865814696485623) internal successors, (434), 398 states have internal predecessors, (434), 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-08 23:03:23,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 445 transitions. [2025-03-08 23:03:23,137 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 445 transitions. Word has length 58 [2025-03-08 23:03:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:23,137 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 445 transitions. [2025-03-08 23:03:23,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.9056603773584904) internal successors, (154), 53 states have internal predecessors, (154), 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-08 23:03:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 445 transitions. [2025-03-08 23:03:23,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 23:03:23,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:23,138 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, 1] [2025-03-08 23:03:23,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 23:03:23,343 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-08 23:03:23,343 INFO L396 AbstractCegarLoop]: === Iteration 43 === 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-08 23:03:23,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash 529780328, now seen corresponding path program 1 times [2025-03-08 23:03:23,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:23,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710354684] [2025-03-08 23:03:23,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:23,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:23,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:03:23,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:03:23,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:23,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:24,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:24,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710354684] [2025-03-08 23:03:24,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710354684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:24,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826340552] [2025-03-08 23:03:24,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:24,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:24,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:24,582 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-08 23:03:24,582 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-08 23:03:24,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:03:24,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:03:24,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:24,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:24,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-03-08 23:03:24,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:24,758 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-08 23:03:24,799 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-08 23:03:24,802 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-08 23:03:24,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:03:24,879 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-08 23:03:24,933 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-08 23:03:24,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-08 23:03:24,957 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-08 23:03:24,962 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-08 23:03:25,060 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:03:25,061 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-08 23:03:25,069 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 19 treesize of output 18 [2025-03-08 23:03:25,118 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2025-03-08 23:03:25,118 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 30 treesize of output 32 [2025-03-08 23:03:25,137 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-08 23:03:25,137 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-08 23:03:26,098 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-03-08 23:03:26,098 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 51 treesize of output 32 [2025-03-08 23:03:26,102 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-08 23:03:26,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:26,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:26,516 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-08 23:03:27,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:27,278 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-08 23:03:29,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,704 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-08 23:03:29,710 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 140 treesize of output 126 [2025-03-08 23:03:29,716 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 27 treesize of output 25 [2025-03-08 23:03:29,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,734 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 60 treesize of output 62 [2025-03-08 23:03:29,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,742 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 22 treesize of output 23 [2025-03-08 23:03:29,746 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-08 23:03:29,750 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-08 23:03:29,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,774 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-08 23:03:29,777 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:29,780 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-08 23:03:29,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,785 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 46 treesize of output 37 [2025-03-08 23:03:29,788 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:29,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,795 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 86 treesize of output 86 [2025-03-08 23:03:29,801 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 59 treesize of output 57 [2025-03-08 23:03:29,808 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-08 23:03:29,828 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 60 treesize of output 52 [2025-03-08 23:03:29,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,839 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 69 treesize of output 49 [2025-03-08 23:03:29,841 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:29,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,852 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 95 treesize of output 93 [2025-03-08 23:03:29,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 59 treesize of output 57 [2025-03-08 23:03:29,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 23 treesize of output 13 [2025-03-08 23:03:29,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,904 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 67 treesize of output 47 [2025-03-08 23:03:29,906 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:29,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,913 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 87 treesize of output 85 [2025-03-08 23:03:29,921 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 59 treesize of output 57 [2025-03-08 23:03:29,959 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 62 treesize of output 50 [2025-03-08 23:03:29,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,969 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-08 23:03:29,971 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:29,973 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-08 23:03:29,979 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:29,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:29,985 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-08 23:03:30,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:30,010 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-08 23:03:30,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:30,018 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 44 treesize of output 35 [2025-03-08 23:03:30,021 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:30,024 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-08 23:03:30,030 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:30,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:30,040 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 78 treesize of output 78 [2025-03-08 23:03:30,048 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-08 23:03:30,056 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 59 treesize of output 57 [2025-03-08 23:03:30,093 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 109 treesize of output 99 [2025-03-08 23:03:30,292 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-08 23:03:30,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826340552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:30,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:30,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 56 [2025-03-08 23:03:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382948566] [2025-03-08 23:03:30,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:30,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-08 23:03:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:30,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-08 23:03:30,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2999, Unknown=3, NotChecked=0, Total=3192 [2025-03-08 23:03:30,294 INFO L87 Difference]: Start difference. First operand 401 states and 445 transitions. Second operand has 57 states, 56 states have (on average 2.875) internal successors, (161), 57 states have internal predecessors, (161), 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-08 23:03:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:38,972 INFO L93 Difference]: Finished difference Result 556 states and 599 transitions. [2025-03-08 23:03:38,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 23:03:38,972 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.875) internal successors, (161), 57 states have internal predecessors, (161), 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 57 [2025-03-08 23:03:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:38,973 INFO L225 Difference]: With dead ends: 556 [2025-03-08 23:03:38,973 INFO L226 Difference]: Without dead ends: 556 [2025-03-08 23:03:38,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=623, Invalid=7384, Unknown=3, NotChecked=0, Total=8010 [2025-03-08 23:03:38,975 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 1104 mSDsluCounter, 5894 mSDsCounter, 0 mSdLazyCounter, 4781 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 6132 SdHoareTripleChecker+Invalid, 4824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:38,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 6132 Invalid, 4824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4781 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-03-08 23:03:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-08 23:03:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 402. [2025-03-08 23:03:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 314 states have (on average 1.3853503184713376) internal successors, (435), 399 states have internal predecessors, (435), 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-08 23:03:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 446 transitions. [2025-03-08 23:03:38,979 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 446 transitions. Word has length 57 [2025-03-08 23:03:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:38,979 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 446 transitions. [2025-03-08 23:03:38,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.875) internal successors, (161), 57 states have internal predecessors, (161), 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-08 23:03:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 446 transitions. [2025-03-08 23:03:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 23:03:38,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:38,979 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, 1] [2025-03-08 23:03:38,986 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-08 23:03:39,180 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-08 23:03:39,180 INFO L396 AbstractCegarLoop]: === Iteration 44 === 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-08 23:03:39,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash 529780327, now seen corresponding path program 1 times [2025-03-08 23:03:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:39,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851974803] [2025-03-08 23:03:39,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:39,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:03:39,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:03:39,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:39,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:39,953 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-08 23:03:39,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:39,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851974803] [2025-03-08 23:03:39,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851974803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:39,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377075902] [2025-03-08 23:03:39,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:39,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:39,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:39,955 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-08 23:03:39,956 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-08 23:03:40,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:03:40,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:03:40,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:40,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:40,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-08 23:03:40,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:40,150 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-08 23:03:40,189 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-08 23:03:40,197 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-08 23:03:40,273 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:03:40,273 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-08 23:03:40,319 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-08 23:03:40,325 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-08 23:03:40,340 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-08 23:03:40,344 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-08 23:03:40,429 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:03:40,429 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-08 23:03:40,445 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:03:40,445 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-08 23:03:40,499 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-08 23:03:40,500 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-08 23:03:40,516 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2025-03-08 23:03:40,516 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-08 23:03:41,213 INFO L349 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-03-08 23:03:41,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 114 [2025-03-08 23:03:41,665 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-03-08 23:03:41,666 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-08 23:03:41,668 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-08 23:03:41,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:41,969 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-08 23:03:41,969 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-08 23:03:42,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:42,460 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-08 23:03:43,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:43,119 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-08 23:03:43,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:43,125 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-08 23:03:43,131 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 70 treesize of output 60 [2025-03-08 23:03:43,137 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-08 23:03:43,143 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 28 treesize of output 26 [2025-03-08 23:03:43,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:43,157 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 60 treesize of output 62 [2025-03-08 23:03:43,162 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 54 treesize of output 46 [2025-03-08 23:03:43,167 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-08 23:03:43,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:43,219 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-08 23:03:43,221 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:43,222 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-08 23:03:43,227 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:43,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:43,233 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-08 23:03:43,412 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-08 23:03:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377075902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:43,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:43,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 54 [2025-03-08 23:03:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497930489] [2025-03-08 23:03:43,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:43,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 23:03:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:43,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 23:03:43,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2796, Unknown=8, NotChecked=0, Total=2970 [2025-03-08 23:03:43,414 INFO L87 Difference]: Start difference. First operand 402 states and 446 transitions. Second operand has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 55 states have internal predecessors, (157), 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-08 23:03:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:48,467 INFO L93 Difference]: Finished difference Result 554 states and 597 transitions. [2025-03-08 23:03:48,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 23:03:48,467 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 55 states have internal predecessors, (157), 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 57 [2025-03-08 23:03:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:48,468 INFO L225 Difference]: With dead ends: 554 [2025-03-08 23:03:48,468 INFO L226 Difference]: Without dead ends: 554 [2025-03-08 23:03:48,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=627, Invalid=7021, Unknown=8, NotChecked=0, Total=7656 [2025-03-08 23:03:48,470 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 1286 mSDsluCounter, 6266 mSDsCounter, 0 mSdLazyCounter, 4679 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 6510 SdHoareTripleChecker+Invalid, 4734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:48,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 6510 Invalid, 4734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4679 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 23:03:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-08 23:03:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 402. [2025-03-08 23:03:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 314 states have (on average 1.3789808917197452) internal successors, (433), 399 states have internal predecessors, (433), 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-08 23:03:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 444 transitions. [2025-03-08 23:03:48,475 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 444 transitions. Word has length 57 [2025-03-08 23:03:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:48,476 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 444 transitions. [2025-03-08 23:03:48,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 55 states have internal predecessors, (157), 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-08 23:03:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 444 transitions. [2025-03-08 23:03:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 23:03:48,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:48,476 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, 1] [2025-03-08 23:03:48,483 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-08 23:03:48,677 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-08 23:03:48,677 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-08 23:03:48,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:48,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2066131480, now seen corresponding path program 1 times [2025-03-08 23:03:48,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:48,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48214423] [2025-03-08 23:03:48,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:48,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 23:03:48,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 23:03:48,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:48,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:49,327 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-08 23:03:49,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:49,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48214423] [2025-03-08 23:03:49,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48214423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:49,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827190035] [2025-03-08 23:03:49,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:49,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:49,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:49,329 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-08 23:03:49,330 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-08 23:03:49,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 23:03:49,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 23:03:49,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:49,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:49,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 23:03:49,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:49,492 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-08 23:03:49,521 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-08 23:03:49,526 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-08 23:03:49,573 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 23:03:49,573 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-08 23:03:49,612 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-08 23:03:49,624 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-08 23:03:49,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:03:49,636 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-08 23:03:49,671 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-08 23:03:49,682 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-08 23:03:49,687 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-08 23:03:49,898 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-08 23:03:50,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:50,038 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-08 23:03:50,040 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-08 23:03:50,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:50,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:50,455 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-08 23:03:50,465 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_inspect_before_~shape#1.offset_51| Int) (v_arrayElimArr_19 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| |v_ULTIMATE.start_inspect_before_~shape#1.offset_51|) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_inspect_before_~shape#1.offset_51|) 0)) (not (= (select v_arrayElimArr_19 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) |c_ULTIMATE.start_main_~data~0#1.base|)) (< |v_ULTIMATE.start_inspect_before_~shape#1.offset_51| 0))) is different from false [2025-03-08 23:03:50,560 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (|v_ULTIMATE.start_inspect_before_~shape#1.offset_51| Int) (v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (< |c_ULTIMATE.start_main_~data~0#1.offset| |v_ULTIMATE.start_inspect_before_~shape#1.offset_51|) (< |v_ULTIMATE.start_inspect_before_~shape#1.offset_51| 0) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_1904) |v_ULTIMATE.start_main_~item~0#1.base_51| v_arrayElimArr_19) |c_ULTIMATE.start_main_~data~0#1.base|) |v_ULTIMATE.start_inspect_before_~shape#1.offset_51|) 0)) (not (= (select v_arrayElimArr_19 4) |c_ULTIMATE.start_main_~data~0#1.base|)))) is different from false [2025-03-08 23:03:50,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:50,869 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 19 treesize of output 20 [2025-03-08 23:03:50,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:50,877 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 33 treesize of output 33 [2025-03-08 23:03:50,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:50,884 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 27 treesize of output 31 [2025-03-08 23:03:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:03:50,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827190035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:03:50,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:03:50,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 15] total 41 [2025-03-08 23:03:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080352197] [2025-03-08 23:03:50,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:50,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 23:03:50,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:03:50,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 23:03:50,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1382, Unknown=6, NotChecked=150, Total=1640 [2025-03-08 23:03:50,994 INFO L87 Difference]: Start difference. First operand 402 states and 444 transitions. Second operand has 41 states, 41 states have (on average 3.682926829268293) internal successors, (151), 41 states have internal predecessors, (151), 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-08 23:03:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:54,046 INFO L93 Difference]: Finished difference Result 459 states and 499 transitions. [2025-03-08 23:03:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 23:03:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.682926829268293) internal successors, (151), 41 states have internal predecessors, (151), 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 58 [2025-03-08 23:03:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:54,047 INFO L225 Difference]: With dead ends: 459 [2025-03-08 23:03:54,047 INFO L226 Difference]: Without dead ends: 459 [2025-03-08 23:03:54,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=336, Invalid=2746, Unknown=6, NotChecked=218, Total=3306 [2025-03-08 23:03:54,048 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 684 mSDsluCounter, 6780 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 7027 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 537 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:54,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 7027 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3254 Invalid, 0 Unknown, 537 Unchecked, 2.1s Time] [2025-03-08 23:03:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-08 23:03:54,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 402. [2025-03-08 23:03:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 314 states have (on average 1.375796178343949) internal successors, (432), 399 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-08 23:03:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 443 transitions. [2025-03-08 23:03:54,051 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 443 transitions. Word has length 58 [2025-03-08 23:03:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:54,051 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 443 transitions. [2025-03-08 23:03:54,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.682926829268293) internal successors, (151), 41 states have internal predecessors, (151), 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-08 23:03:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 443 transitions. [2025-03-08 23:03:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 23:03:54,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:54,052 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-08 23:03:54,060 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-08 23:03:54,252 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-08 23:03:54,252 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-08 23:03:54,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1734547416, now seen corresponding path program 1 times [2025-03-08 23:03:54,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:03:54,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663257359] [2025-03-08 23:03:54,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:03:54,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:03:54,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:03:54,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:54,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:54,974 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-08 23:03:54,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:03:54,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663257359] [2025-03-08 23:03:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663257359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:54,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766848328] [2025-03-08 23:03:54,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:54,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:54,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:54,976 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-08 23:03:54,976 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-08 23:03:55,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:03:55,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:03:55,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:55,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:55,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-08 23:03:55,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:55,121 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-08 23:03:55,152 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:03:55,152 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-08 23:03:55,184 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-08 23:03:55,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 23:03:55,243 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2025-03-08 23:03:55,244 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 26 treesize of output 41 [2025-03-08 23:03:55,295 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-08 23:03:55,311 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-08 23:03:55,354 INFO L349 Elim1Store]: treesize reduction 84, result has 30.0 percent of original size [2025-03-08 23:03:55,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 48 [2025-03-08 23:03:55,433 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 45 treesize of output 25 [2025-03-08 23:03:55,489 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:03:55,489 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 86 treesize of output 49 [2025-03-08 23:03:55,500 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-08 23:03:56,038 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-08 23:03:56,478 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:03:56,478 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 2 case distinctions, treesize of input 91 treesize of output 42 [2025-03-08 23:03:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:56,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:58,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:58,147 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-08 23:03:58,151 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:58,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:58,161 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 108 treesize of output 108 [2025-03-08 23:03:58,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2025-03-08 23:03:58,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:58,181 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 25 treesize of output 29 [2025-03-08 23:03:58,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:58,216 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 410 treesize of output 406 [2025-03-08 23:04:03,418 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-08 23:04:03,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766848328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:04:03,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:04:03,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 22] total 54 [2025-03-08 23:04:03,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543337351] [2025-03-08 23:04:03,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:04:03,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 23:04:03,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:03,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 23:04:03,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2746, Unknown=4, NotChecked=0, Total=2970 [2025-03-08 23:04:03,420 INFO L87 Difference]: Start difference. First operand 402 states and 443 transitions. Second operand has 55 states, 54 states have (on average 2.962962962962963) internal successors, (160), 55 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-08 23:04:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:08,722 INFO L93 Difference]: Finished difference Result 458 states and 498 transitions. [2025-03-08 23:04:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 23:04:08,722 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.962962962962963) internal successors, (160), 55 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 57 [2025-03-08 23:04:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:08,724 INFO L225 Difference]: With dead ends: 458 [2025-03-08 23:04:08,724 INFO L226 Difference]: Without dead ends: 458 [2025-03-08 23:04:08,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=549, Invalid=4559, Unknown=4, NotChecked=0, Total=5112 [2025-03-08 23:04:08,725 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 697 mSDsluCounter, 5243 mSDsCounter, 0 mSdLazyCounter, 4445 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 5492 SdHoareTripleChecker+Invalid, 4463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:08,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 5492 Invalid, 4463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4445 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 23:04:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-08 23:04:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 403. [2025-03-08 23:04:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 315 states have (on average 1.3777777777777778) internal successors, (434), 400 states have internal predecessors, (434), 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-08 23:04:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 445 transitions. [2025-03-08 23:04:08,728 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 445 transitions. Word has length 57 [2025-03-08 23:04:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:08,728 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 445 transitions. [2025-03-08 23:04:08,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.962962962962963) internal successors, (160), 55 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-08 23:04:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 445 transitions. [2025-03-08 23:04:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 23:04:08,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:08,729 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-08 23:04:08,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 23:04:08,929 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-08 23:04:08,930 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-08 23:04:08,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1734547415, now seen corresponding path program 1 times [2025-03-08 23:04:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032419107] [2025-03-08 23:04:08,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:08,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:04:08,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:04:08,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:08,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:09,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032419107] [2025-03-08 23:04:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032419107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:04:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420075330] [2025-03-08 23:04:09,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:09,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:09,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:09,862 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-08 23:04:09,863 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-08 23:04:09,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 23:04:10,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 23:04:10,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:10,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:10,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-08 23:04:10,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:10,019 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-08 23:04:10,023 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-08 23:04:10,074 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 23:04:10,074 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-08 23:04:10,081 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-08 23:04:10,126 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-08 23:04:10,131 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-08 23:04:10,167 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-08 23:04:10,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 42 treesize of output 22 [2025-03-08 23:04:10,242 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:04:10,242 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 18 treesize of output 21 [2025-03-08 23:04:10,277 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-08 23:04:10,277 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-08 23:04:10,346 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-08 23:04:10,358 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-08 23:04:10,380 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-08 23:04:10,385 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-08 23:04:10,406 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:04:10,406 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 18 treesize of output 21 [2025-03-08 23:04:10,427 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-08 23:04:10,427 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-08 23:04:10,489 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-08 23:04:10,494 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-08 23:04:10,513 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-08 23:04:10,518 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-08 23:04:11,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:11,340 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:04:11,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:11,342 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-08 23:04:11,357 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 23:04:11,357 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-08 23:04:11,412 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-08 23:04:11,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:04:12,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:12,388 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-08 23:04:12,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:12,392 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-08 23:04:12,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:12,406 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