./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.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 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:47:57,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:47:57,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 13:47:57,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:47:57,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:47:57,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:47:57,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:47:57,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:47:57,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:47:57,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:47:57,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:47:57,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:47:57,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:47:57,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:47:57,330 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:47:57,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:47:57,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 13:47:57,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:47:57,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 13:47:57,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:47:57,331 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:47:57,331 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:47:57,331 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:47:57,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:47:57,332 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:47:57,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:47:57,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 13:47:57,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:47:57,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:47:57,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:47:57,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:47:57,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:47:57,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:47:57,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:47:57,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:47:57,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:47:57,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:47:57,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:47:57,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:47:57,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:47:57,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:47:57,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:47:57,334 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 -> 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 [2025-03-17 13:47:57,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:47:57,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:47:57,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:47:57,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:47:57,573 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:47:57,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2025-03-17 13:47:58,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3d44811/3f2fa7e38aec47b6bc4189e530cf6b3b/FLAGb1c70571a [2025-03-17 13:47:59,001 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:47:59,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2025-03-17 13:47:59,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3d44811/3f2fa7e38aec47b6bc4189e530cf6b3b/FLAGb1c70571a [2025-03-17 13:47:59,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3d44811/3f2fa7e38aec47b6bc4189e530cf6b3b [2025-03-17 13:47:59,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:47:59,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:47:59,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:47:59,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:47:59,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:47:59,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:47:59,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58686f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59, skipping insertion in model container [2025-03-17 13:47:59,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:47:59,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:47:59,567 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,601 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,607 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,613 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,620 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,641 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,643 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,644 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,649 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,676 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,676 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,677 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,678 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:47:59,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:47:59,696 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:47:59,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:47:59,800 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:47:59,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59 WrapperNode [2025-03-17 13:47:59,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:47:59,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:47:59,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:47:59,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:47:59,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:47:59,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:47:59,872 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1990 [2025-03-17 13:47:59,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:47:59,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:47:59,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:47:59,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:47:59,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:47:59,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:47:59,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:47:59,955 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2025-03-17 13:47:59,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:47:59,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:48:00,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:48:00,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:48:00,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:48:00,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:48:00,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:48:00,036 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:48:00,037 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:48:00,037 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:48:00,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (1/1) ... [2025-03-17 13:48:00,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:48:00,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:48:00,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 13:48:00,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 13:48:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 13:48:00,084 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 13:48:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:48:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:48:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 13:48:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 13:48:00,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 13:48:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:48:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:48:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 13:48:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 13:48:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 13:48:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 13:48:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 13:48:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 13:48:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 13:48:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:48:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:48:00,272 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:48:00,274 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:48:02,315 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-03-17 13:48:02,491 INFO L? ?]: Removed 1734 outVars from TransFormulas that were not future-live. [2025-03-17 13:48:02,491 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:48:02,561 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:48:02,562 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 13:48:02,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:48:02 BoogieIcfgContainer [2025-03-17 13:48:02,562 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:48:02,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:48:02,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:48:02,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:48:02,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:47:59" (1/3) ... [2025-03-17 13:48:02,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c257037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:48:02, skipping insertion in model container [2025-03-17 13:48:02,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:47:59" (2/3) ... [2025-03-17 13:48:02,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c257037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:48:02, skipping insertion in model container [2025-03-17 13:48:02,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:48:02" (3/3) ... [2025-03-17 13:48:02,573 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-1.i [2025-03-17 13:48:02,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:48:02,585 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test5-1.i that has 6 procedures, 1736 locations, 1 initial locations, 46 loop locations, and 712 error locations. [2025-03-17 13:48:02,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:48:02,654 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;@10284305, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:48:02,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2025-03-17 13:48:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 1726 states, 1003 states have (on average 2.0388833499501495) internal successors, (2045), 1716 states have internal predecessors, (2045), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 13:48:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:48:02,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:02,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:48:02,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr709REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:02,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash 66769438, now seen corresponding path program 1 times [2025-03-17 13:48:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:02,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604154893] [2025-03-17 13:48:02,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:02,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:02,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:48:02,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:48:02,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:02,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:02,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:02,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604154893] [2025-03-17 13:48:02,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604154893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:02,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:02,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:48:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236542964] [2025-03-17 13:48:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:02,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 13:48:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:02,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 13:48:02,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 13:48:02,821 INFO L87 Difference]: Start difference. First operand has 1726 states, 1003 states have (on average 2.0388833499501495) internal successors, (2045), 1716 states have internal predecessors, (2045), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:02,974 INFO L93 Difference]: Finished difference Result 1706 states and 1966 transitions. [2025-03-17 13:48:02,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 13:48:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 13:48:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:02,997 INFO L225 Difference]: With dead ends: 1706 [2025-03-17 13:48:02,997 INFO L226 Difference]: Without dead ends: 1704 [2025-03-17 13:48:02,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 13:48:03,001 INFO L435 NwaCegarLoop]: 1903 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:03,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1903 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:48:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2025-03-17 13:48:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2025-03-17 13:48:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 993 states have (on average 1.9536757301107754) internal successors, (1940), 1694 states have internal predecessors, (1940), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 1964 transitions. [2025-03-17 13:48:03,115 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 1964 transitions. Word has length 4 [2025-03-17 13:48:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:03,115 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 1964 transitions. [2025-03-17 13:48:03,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1964 transitions. [2025-03-17 13:48:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:48:03,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:03,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:48:03,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:48:03,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr709REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:03,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash 66769469, now seen corresponding path program 1 times [2025-03-17 13:48:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:03,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834621740] [2025-03-17 13:48:03,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:03,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:03,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:48:03,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:48:03,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:03,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:03,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:03,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834621740] [2025-03-17 13:48:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834621740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:03,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:03,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:48:03,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821338911] [2025-03-17 13:48:03,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:03,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:48:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:03,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:48:03,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:48:03,207 INFO L87 Difference]: Start difference. First operand 1704 states and 1964 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:04,213 INFO L93 Difference]: Finished difference Result 1928 states and 2276 transitions. [2025-03-17 13:48:04,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:48:04,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 13:48:04,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:04,220 INFO L225 Difference]: With dead ends: 1928 [2025-03-17 13:48:04,220 INFO L226 Difference]: Without dead ends: 1928 [2025-03-17 13:48:04,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:48:04,221 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 1726 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:04,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 1795 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:48:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-03-17 13:48:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1612. [2025-03-17 13:48:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 993 states have (on average 1.8610271903323263) internal successors, (1848), 1602 states have internal predecessors, (1848), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 1872 transitions. [2025-03-17 13:48:04,279 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 1872 transitions. Word has length 4 [2025-03-17 13:48:04,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:04,279 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 1872 transitions. [2025-03-17 13:48:04,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1872 transitions. [2025-03-17 13:48:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:48:04,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:04,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:48:04,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:48:04,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr710REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash 66769470, now seen corresponding path program 1 times [2025-03-17 13:48:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:04,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943154500] [2025-03-17 13:48:04,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:04,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:48:04,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:48:04,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:04,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:04,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:04,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943154500] [2025-03-17 13:48:04,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943154500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:04,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:04,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:48:04,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267602806] [2025-03-17 13:48:04,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:04,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:48:04,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:04,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:48:04,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:48:04,370 INFO L87 Difference]: Start difference. First operand 1612 states and 1872 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:05,398 INFO L93 Difference]: Finished difference Result 2342 states and 2766 transitions. [2025-03-17 13:48:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:48:05,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 13:48:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:05,405 INFO L225 Difference]: With dead ends: 2342 [2025-03-17 13:48:05,405 INFO L226 Difference]: Without dead ends: 2342 [2025-03-17 13:48:05,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:48:05,405 INFO L435 NwaCegarLoop]: 1856 mSDtfsCounter, 1208 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:05,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 2737 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:48:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2025-03-17 13:48:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 1873. [2025-03-17 13:48:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1264 states have (on average 1.8354430379746836) internal successors, (2320), 1863 states have internal predecessors, (2320), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2344 transitions. [2025-03-17 13:48:05,434 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2344 transitions. Word has length 4 [2025-03-17 13:48:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:05,435 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 2344 transitions. [2025-03-17 13:48:05,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2344 transitions. [2025-03-17 13:48:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:48:05,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:05,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:48:05,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:48:05,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:05,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:05,439 INFO L85 PathProgramCache]: Analyzing trace with hash 65102749, now seen corresponding path program 1 times [2025-03-17 13:48:05,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:05,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713761653] [2025-03-17 13:48:05,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:05,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:05,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:48:05,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:48:05,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:05,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:05,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:05,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713761653] [2025-03-17 13:48:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713761653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:05,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:05,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:48:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112728606] [2025-03-17 13:48:05,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:05,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:48:05,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:05,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:48:05,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:48:05,479 INFO L87 Difference]: Start difference. First operand 1873 states and 2344 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:05,646 INFO L93 Difference]: Finished difference Result 3730 states and 4672 transitions. [2025-03-17 13:48:05,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:48:05,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 13:48:05,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:05,660 INFO L225 Difference]: With dead ends: 3730 [2025-03-17 13:48:05,660 INFO L226 Difference]: Without dead ends: 3730 [2025-03-17 13:48:05,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:48:05,662 INFO L435 NwaCegarLoop]: 2070 mSDtfsCounter, 1821 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 3860 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:05,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 3860 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:48:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2025-03-17 13:48:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 1875. [2025-03-17 13:48:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1266 states have (on average 1.8341232227488151) internal successors, (2322), 1865 states have internal predecessors, (2322), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2346 transitions. [2025-03-17 13:48:05,707 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2346 transitions. Word has length 4 [2025-03-17 13:48:05,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:05,707 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2346 transitions. [2025-03-17 13:48:05,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2346 transitions. [2025-03-17 13:48:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 13:48:05,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:05,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:05,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:48:05,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr705REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:05,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1585296687, now seen corresponding path program 1 times [2025-03-17 13:48:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:05,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841183659] [2025-03-17 13:48:05,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:05,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 13:48:05,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 13:48:05,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:05,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841183659] [2025-03-17 13:48:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841183659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:05,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:48:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468955960] [2025-03-17 13:48:05,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:05,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:48:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:05,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:48:05,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:48:05,781 INFO L87 Difference]: Start difference. First operand 1875 states and 2346 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:06,768 INFO L93 Difference]: Finished difference Result 1901 states and 2399 transitions. [2025-03-17 13:48:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:48:06,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-17 13:48:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:06,774 INFO L225 Difference]: With dead ends: 1901 [2025-03-17 13:48:06,774 INFO L226 Difference]: Without dead ends: 1901 [2025-03-17 13:48:06,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:48:06,775 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 1994 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:06,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 2037 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:48:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-03-17 13:48:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1852. [2025-03-17 13:48:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1266 states have (on average 1.815955766192733) internal successors, (2299), 1842 states have internal predecessors, (2299), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2323 transitions. [2025-03-17 13:48:06,802 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2323 transitions. Word has length 9 [2025-03-17 13:48:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:06,802 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 2323 transitions. [2025-03-17 13:48:06,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2323 transitions. [2025-03-17 13:48:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 13:48:06,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:06,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 13:48:06,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr706REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:06,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1585296686, now seen corresponding path program 1 times [2025-03-17 13:48:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231300217] [2025-03-17 13:48:06,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:06,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 13:48:06,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 13:48:06,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:06,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:06,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:06,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231300217] [2025-03-17 13:48:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231300217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:06,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:48:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185115843] [2025-03-17 13:48:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:06,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:48:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:06,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:48:06,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:48:06,851 INFO L87 Difference]: Start difference. First operand 1852 states and 2323 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:06,950 INFO L93 Difference]: Finished difference Result 1777 states and 2220 transitions. [2025-03-17 13:48:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:48:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-17 13:48:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:06,955 INFO L225 Difference]: With dead ends: 1777 [2025-03-17 13:48:06,955 INFO L226 Difference]: Without dead ends: 1777 [2025-03-17 13:48:06,955 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-17 13:48:06,956 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 60 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:06,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3289 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:48:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-03-17 13:48:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2025-03-17 13:48:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1203 states have (on average 1.825436408977556) internal successors, (2196), 1767 states have internal predecessors, (2196), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2220 transitions. [2025-03-17 13:48:07,001 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2220 transitions. Word has length 9 [2025-03-17 13:48:07,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:07,002 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2220 transitions. [2025-03-17 13:48:07,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2220 transitions. [2025-03-17 13:48:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 13:48:07,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:07,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:07,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:48:07,003 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:07,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:07,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1899680038, now seen corresponding path program 1 times [2025-03-17 13:48:07,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:07,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759043870] [2025-03-17 13:48:07,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:07,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:07,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 13:48:07,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 13:48:07,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:07,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:07,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:07,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759043870] [2025-03-17 13:48:07,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759043870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:07,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:07,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:48:07,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902513642] [2025-03-17 13:48:07,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:07,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:48:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:07,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:48:07,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:48:07,080 INFO L87 Difference]: Start difference. First operand 1777 states and 2220 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:07,245 INFO L93 Difference]: Finished difference Result 1759 states and 2195 transitions. [2025-03-17 13:48:07,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:48:07,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 13:48:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:07,250 INFO L225 Difference]: With dead ends: 1759 [2025-03-17 13:48:07,250 INFO L226 Difference]: Without dead ends: 1759 [2025-03-17 13:48:07,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:48:07,251 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 41 mSDsluCounter, 3244 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4880 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:07,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4880 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:48:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2025-03-17 13:48:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1756. [2025-03-17 13:48:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1189 states have (on average 1.823380992430614) internal successors, (2168), 1746 states have internal predecessors, (2168), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2192 transitions. [2025-03-17 13:48:07,282 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2192 transitions. Word has length 10 [2025-03-17 13:48:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:07,286 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2192 transitions. [2025-03-17 13:48:07,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2192 transitions. [2025-03-17 13:48:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 13:48:07,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:07,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:07,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:48:07,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr668REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:07,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1746315184, now seen corresponding path program 1 times [2025-03-17 13:48:07,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:07,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765091976] [2025-03-17 13:48:07,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:07,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 13:48:07,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 13:48:07,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:07,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:07,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:07,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765091976] [2025-03-17 13:48:07,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765091976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:07,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:07,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:48:07,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950599935] [2025-03-17 13:48:07,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:07,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:48:07,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:07,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:48:07,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:48:07,461 INFO L87 Difference]: Start difference. First operand 1756 states and 2192 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:08,641 INFO L93 Difference]: Finished difference Result 2271 states and 2687 transitions. [2025-03-17 13:48:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:48:08,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-17 13:48:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:08,647 INFO L225 Difference]: With dead ends: 2271 [2025-03-17 13:48:08,647 INFO L226 Difference]: Without dead ends: 2271 [2025-03-17 13:48:08,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:48:08,648 INFO L435 NwaCegarLoop]: 1365 mSDtfsCounter, 1214 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:08,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 3201 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:48:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2025-03-17 13:48:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 1752. [2025-03-17 13:48:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1189 states have (on average 1.8200168208578638) internal successors, (2164), 1742 states have internal predecessors, (2164), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2188 transitions. [2025-03-17 13:48:08,671 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2188 transitions. Word has length 24 [2025-03-17 13:48:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:08,671 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2188 transitions. [2025-03-17 13:48:08,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2188 transitions. [2025-03-17 13:48:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 13:48:08,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:08,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:08,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 13:48:08,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:08,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1379029764, now seen corresponding path program 1 times [2025-03-17 13:48:08,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:08,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142411919] [2025-03-17 13:48:08,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:08,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:08,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 13:48:08,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 13:48:08,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:08,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:08,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142411919] [2025-03-17 13:48:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142411919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:48:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159347194] [2025-03-17 13:48:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:08,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:48:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:08,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:48:08,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:48:08,789 INFO L87 Difference]: Start difference. First operand 1752 states and 2188 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:08,904 INFO L93 Difference]: Finished difference Result 1752 states and 2184 transitions. [2025-03-17 13:48:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:48:08,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-17 13:48:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:08,909 INFO L225 Difference]: With dead ends: 1752 [2025-03-17 13:48:08,909 INFO L226 Difference]: Without dead ends: 1752 [2025-03-17 13:48:08,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:48:08,910 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 21 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4862 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:08,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4862 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:48:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2025-03-17 13:48:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2025-03-17 13:48:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1189 states have (on average 1.8166526492851136) internal successors, (2160), 1742 states have internal predecessors, (2160), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2184 transitions. [2025-03-17 13:48:08,931 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2184 transitions. Word has length 58 [2025-03-17 13:48:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:08,931 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2184 transitions. [2025-03-17 13:48:08,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2184 transitions. [2025-03-17 13:48:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 13:48:08,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:08,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:08,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:48:08,933 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:08,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:08,933 INFO L85 PathProgramCache]: Analyzing trace with hash 536629708, now seen corresponding path program 1 times [2025-03-17 13:48:08,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:08,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746106242] [2025-03-17 13:48:08,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:08,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 13:48:08,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 13:48:08,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:08,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:09,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:09,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746106242] [2025-03-17 13:48:09,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746106242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:09,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:09,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:48:09,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925593632] [2025-03-17 13:48:09,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:09,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:48:09,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:09,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:48:09,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:48:09,057 INFO L87 Difference]: Start difference. First operand 1752 states and 2184 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:09,156 INFO L93 Difference]: Finished difference Result 1842 states and 2301 transitions. [2025-03-17 13:48:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:48:09,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-17 13:48:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:09,161 INFO L225 Difference]: With dead ends: 1842 [2025-03-17 13:48:09,161 INFO L226 Difference]: Without dead ends: 1842 [2025-03-17 13:48:09,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:48:09,161 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 54 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:09,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3263 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:48:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-03-17 13:48:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1842. [2025-03-17 13:48:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1279 states have (on average 1.7802971071149336) internal successors, (2277), 1832 states have internal predecessors, (2277), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2301 transitions. [2025-03-17 13:48:09,186 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2301 transitions. Word has length 66 [2025-03-17 13:48:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:09,186 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2301 transitions. [2025-03-17 13:48:09,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2301 transitions. [2025-03-17 13:48:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 13:48:09,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:09,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:09,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:48:09,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:09,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash 866786184, now seen corresponding path program 1 times [2025-03-17 13:48:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346333493] [2025-03-17 13:48:09,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:09,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 13:48:09,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 13:48:09,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:09,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:09,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346333493] [2025-03-17 13:48:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346333493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:09,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:48:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279158688] [2025-03-17 13:48:09,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:09,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:48:09,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:09,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:48:09,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:48:09,548 INFO L87 Difference]: Start difference. First operand 1842 states and 2301 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:10,865 INFO L93 Difference]: Finished difference Result 1758 states and 2217 transitions. [2025-03-17 13:48:10,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:48:10,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-17 13:48:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:10,869 INFO L225 Difference]: With dead ends: 1758 [2025-03-17 13:48:10,869 INFO L226 Difference]: Without dead ends: 1758 [2025-03-17 13:48:10,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:48:10,870 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 1524 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:10,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 2197 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2654 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 13:48:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2025-03-17 13:48:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1487. [2025-03-17 13:48:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1008 states have (on average 1.6974206349206349) internal successors, (1711), 1477 states have internal predecessors, (1711), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1735 transitions. [2025-03-17 13:48:10,885 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1735 transitions. Word has length 69 [2025-03-17 13:48:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:10,885 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 1735 transitions. [2025-03-17 13:48:10,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1735 transitions. [2025-03-17 13:48:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 13:48:10,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:10,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:10,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:48:10,886 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr617REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:10,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash -499017256, now seen corresponding path program 1 times [2025-03-17 13:48:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557052078] [2025-03-17 13:48:10,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:10,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 13:48:10,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 13:48:10,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:10,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:11,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557052078] [2025-03-17 13:48:11,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557052078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:11,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:11,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:48:11,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170239499] [2025-03-17 13:48:11,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:11,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:48:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:11,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:48:11,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:48:11,070 INFO L87 Difference]: Start difference. First operand 1487 states and 1735 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:11,819 INFO L93 Difference]: Finished difference Result 1486 states and 1734 transitions. [2025-03-17 13:48:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:48:11,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-17 13:48:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:11,823 INFO L225 Difference]: With dead ends: 1486 [2025-03-17 13:48:11,823 INFO L226 Difference]: Without dead ends: 1486 [2025-03-17 13:48:11,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:48:11,824 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 2 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4517 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:11,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4517 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:48:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-03-17 13:48:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2025-03-17 13:48:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1008 states have (on average 1.6964285714285714) internal successors, (1710), 1476 states have internal predecessors, (1710), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1734 transitions. [2025-03-17 13:48:11,840 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1734 transitions. Word has length 74 [2025-03-17 13:48:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:11,841 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 1734 transitions. [2025-03-17 13:48:11,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1734 transitions. [2025-03-17 13:48:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 13:48:11,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:11,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:11,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:48:11,842 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr618REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:11,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash -499017255, now seen corresponding path program 1 times [2025-03-17 13:48:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:11,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625282864] [2025-03-17 13:48:11,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:11,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 13:48:11,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 13:48:11,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:11,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625282864] [2025-03-17 13:48:12,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625282864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:12,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:12,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:48:12,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743609019] [2025-03-17 13:48:12,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:12,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:48:12,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:12,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:48:12,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:48:12,179 INFO L87 Difference]: Start difference. First operand 1486 states and 1734 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:13,115 INFO L93 Difference]: Finished difference Result 1485 states and 1733 transitions. [2025-03-17 13:48:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:48:13,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-17 13:48:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:13,119 INFO L225 Difference]: With dead ends: 1485 [2025-03-17 13:48:13,119 INFO L226 Difference]: Without dead ends: 1485 [2025-03-17 13:48:13,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:48:13,120 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 1 mSDsluCounter, 2982 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:13,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4539 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1909 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:48:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2025-03-17 13:48:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1485. [2025-03-17 13:48:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1007 states have (on average 1.6971201588877856) internal successors, (1709), 1475 states have internal predecessors, (1709), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1733 transitions. [2025-03-17 13:48:13,136 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1733 transitions. Word has length 74 [2025-03-17 13:48:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:13,137 INFO L471 AbstractCegarLoop]: Abstraction has 1485 states and 1733 transitions. [2025-03-17 13:48:13,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:48:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1733 transitions. [2025-03-17 13:48:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 13:48:13,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:13,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:13,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:48:13,138 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:13,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash -235438187, now seen corresponding path program 1 times [2025-03-17 13:48:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:13,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308836723] [2025-03-17 13:48:13,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:13,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 13:48:13,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 13:48:13,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:13,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:13,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:13,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308836723] [2025-03-17 13:48:13,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308836723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:13,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:13,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:48:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839170132] [2025-03-17 13:48:13,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:13,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:48:13,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:13,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:48:13,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:48:13,302 INFO L87 Difference]: Start difference. First operand 1485 states and 1733 transitions. Second operand has 7 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:14,473 INFO L93 Difference]: Finished difference Result 1497 states and 1751 transitions. [2025-03-17 13:48:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:48:14,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2025-03-17 13:48:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:14,477 INFO L225 Difference]: With dead ends: 1497 [2025-03-17 13:48:14,477 INFO L226 Difference]: Without dead ends: 1497 [2025-03-17 13:48:14,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:48:14,478 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 13 mSDsluCounter, 5538 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7077 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:14,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7077 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:48:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-03-17 13:48:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1491. [2025-03-17 13:48:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1012 states have (on average 1.6956521739130435) internal successors, (1716), 1480 states have internal predecessors, (1716), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 13:48:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1746 transitions. [2025-03-17 13:48:14,492 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1746 transitions. Word has length 82 [2025-03-17 13:48:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:14,493 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1746 transitions. [2025-03-17 13:48:14,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1746 transitions. [2025-03-17 13:48:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 13:48:14,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:14,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:14,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:48:14,494 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:14,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash -235438186, now seen corresponding path program 1 times [2025-03-17 13:48:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:14,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990038945] [2025-03-17 13:48:14,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:14,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 13:48:14,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 13:48:14,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:14,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:14,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:14,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990038945] [2025-03-17 13:48:14,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990038945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:14,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:14,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:48:14,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075050505] [2025-03-17 13:48:14,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:14,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:48:14,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:14,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:48:14,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:48:14,866 INFO L87 Difference]: Start difference. First operand 1491 states and 1746 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:15,933 INFO L93 Difference]: Finished difference Result 1491 states and 1745 transitions. [2025-03-17 13:48:15,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:48:15,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2025-03-17 13:48:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:15,937 INFO L225 Difference]: With dead ends: 1491 [2025-03-17 13:48:15,937 INFO L226 Difference]: Without dead ends: 1491 [2025-03-17 13:48:15,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:48:15,938 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 8 mSDsluCounter, 4261 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5807 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:15,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5807 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:48:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2025-03-17 13:48:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2025-03-17 13:48:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1012 states have (on average 1.6946640316205535) internal successors, (1715), 1480 states have internal predecessors, (1715), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 13:48:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1745 transitions. [2025-03-17 13:48:15,959 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1745 transitions. Word has length 82 [2025-03-17 13:48:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:15,959 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1745 transitions. [2025-03-17 13:48:15,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1745 transitions. [2025-03-17 13:48:15,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 13:48:15,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:15,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:15,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:48:15,961 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:15,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1655123370, now seen corresponding path program 1 times [2025-03-17 13:48:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:15,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683289429] [2025-03-17 13:48:15,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:15,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:48:15,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:48:15,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:15,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:16,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:16,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683289429] [2025-03-17 13:48:16,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683289429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:16,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285418067] [2025-03-17 13:48:16,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:16,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:48:16,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:48:16,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:48:16,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 13:48:16,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:48:16,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:48:16,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:16,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:16,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 13:48:16,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:48:16,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:48:16,639 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:48:16,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:48:16,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 13:48:16,708 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:48:16,708 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:48:16,738 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 31 treesize of output 13 [2025-03-17 13:48:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:16,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:48:16,791 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-17 13:48:16,791 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 21 treesize of output 20 [2025-03-17 13:48:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285418067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:16,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:48:16,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-03-17 13:48:16,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163286325] [2025-03-17 13:48:16,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:48:16,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:48:16,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:16,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:48:16,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=171, Unknown=4, NotChecked=0, Total=210 [2025-03-17 13:48:16,825 INFO L87 Difference]: Start difference. First operand 1491 states and 1745 transitions. Second operand has 14 states, 12 states have (on average 9.833333333333334) internal successors, (118), 13 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:48:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:18,939 INFO L93 Difference]: Finished difference Result 1490 states and 1744 transitions. [2025-03-17 13:48:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:48:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.833333333333334) internal successors, (118), 13 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2025-03-17 13:48:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:18,943 INFO L225 Difference]: With dead ends: 1490 [2025-03-17 13:48:18,943 INFO L226 Difference]: Without dead ends: 1490 [2025-03-17 13:48:18,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=374, Unknown=4, NotChecked=0, Total=462 [2025-03-17 13:48:18,944 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 1530 mSDsluCounter, 7644 mSDsCounter, 0 mSdLazyCounter, 5881 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 8623 SdHoareTripleChecker+Invalid, 5907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:18,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 8623 Invalid, 5907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5881 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 13:48:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-03-17 13:48:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2025-03-17 13:48:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1012 states have (on average 1.6936758893280632) internal successors, (1714), 1479 states have internal predecessors, (1714), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 13:48:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1744 transitions. [2025-03-17 13:48:18,969 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1744 transitions. Word has length 83 [2025-03-17 13:48:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:18,969 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1744 transitions. [2025-03-17 13:48:18,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.833333333333334) internal successors, (118), 13 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:48:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1744 transitions. [2025-03-17 13:48:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 13:48:18,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:18,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:18,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 13:48:19,175 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,SelfDestructingSolverStorable15 [2025-03-17 13:48:19,175 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:19,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:19,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1655123369, now seen corresponding path program 1 times [2025-03-17 13:48:19,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:19,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542263124] [2025-03-17 13:48:19,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:19,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:19,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:48:19,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:48:19,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:19,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542263124] [2025-03-17 13:48:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542263124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209029340] [2025-03-17 13:48:19,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:19,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:48:19,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:48:19,662 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:48:19,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 13:48:19,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 13:48:19,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 13:48:19,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:19,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:19,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 13:48:19,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:48:19,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:48:19,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 13:48:19,947 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:48:19,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:48:19,956 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 19 treesize of output 1 [2025-03-17 13:48:19,962 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 13 treesize of output 9 [2025-03-17 13:48:20,014 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 22 treesize of output 10 [2025-03-17 13:48:20,021 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 9 treesize of output 3 [2025-03-17 13:48:20,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:48:20,104 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 13:48:20,111 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 30 treesize of output 13 [2025-03-17 13:48:20,131 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 31 treesize of output 13 [2025-03-17 13:48:20,153 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 9 treesize of output 3 [2025-03-17 13:48:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:20,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:48:20,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-17 13:48:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209029340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:20,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:48:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-17 13:48:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817094978] [2025-03-17 13:48:20,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:48:20,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:48:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:20,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:48:20,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-17 13:48:20,241 INFO L87 Difference]: Start difference. First operand 1490 states and 1744 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:48:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:23,690 INFO L93 Difference]: Finished difference Result 1497 states and 1751 transitions. [2025-03-17 13:48:23,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:48:23,691 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2025-03-17 13:48:23,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:23,693 INFO L225 Difference]: With dead ends: 1497 [2025-03-17 13:48:23,693 INFO L226 Difference]: Without dead ends: 1497 [2025-03-17 13:48:23,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-03-17 13:48:23,694 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 1530 mSDsluCounter, 6314 mSDsCounter, 0 mSdLazyCounter, 7182 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 7298 SdHoareTripleChecker+Invalid, 7222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 7182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:23,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 7298 Invalid, 7222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 7182 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-17 13:48:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-03-17 13:48:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1488. [2025-03-17 13:48:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1011 states have (on average 1.6933728981206726) internal successors, (1712), 1477 states have internal predecessors, (1712), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1736 transitions. [2025-03-17 13:48:23,713 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1736 transitions. Word has length 83 [2025-03-17 13:48:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:23,714 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1736 transitions. [2025-03-17 13:48:23,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:48:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1736 transitions. [2025-03-17 13:48:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 13:48:23,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:23,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:23,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 13:48:23,915 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,SelfDestructingSolverStorable16 [2025-03-17 13:48:23,916 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash -255733639, now seen corresponding path program 1 times [2025-03-17 13:48:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018003334] [2025-03-17 13:48:23,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:23,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 13:48:23,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 13:48:23,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:23,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:24,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018003334] [2025-03-17 13:48:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018003334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:24,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:24,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 13:48:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997831224] [2025-03-17 13:48:24,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:24,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:48:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:24,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:48:24,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:48:24,327 INFO L87 Difference]: Start difference. First operand 1488 states and 1736 transitions. Second operand has 14 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:26,704 INFO L93 Difference]: Finished difference Result 1501 states and 1755 transitions. [2025-03-17 13:48:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:48:26,705 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-03-17 13:48:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:26,707 INFO L225 Difference]: With dead ends: 1501 [2025-03-17 13:48:26,707 INFO L226 Difference]: Without dead ends: 1501 [2025-03-17 13:48:26,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-17 13:48:26,708 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 1536 mSDsluCounter, 7631 mSDsCounter, 0 mSdLazyCounter, 5878 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 8609 SdHoareTripleChecker+Invalid, 5903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:26,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 8609 Invalid, 5903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5878 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 13:48:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-03-17 13:48:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1497. [2025-03-17 13:48:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1019 states have (on average 1.689892051030422) internal successors, (1722), 1485 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:48:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1747 transitions. [2025-03-17 13:48:26,724 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1747 transitions. Word has length 85 [2025-03-17 13:48:26,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:26,725 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1747 transitions. [2025-03-17 13:48:26,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:26,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1747 transitions. [2025-03-17 13:48:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 13:48:26,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:26,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:26,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:48:26,725 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:26,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:26,726 INFO L85 PathProgramCache]: Analyzing trace with hash -255733638, now seen corresponding path program 1 times [2025-03-17 13:48:26,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:26,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875715881] [2025-03-17 13:48:26,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:26,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:26,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 13:48:26,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 13:48:26,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:26,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:27,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:27,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875715881] [2025-03-17 13:48:27,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875715881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:27,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:27,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 13:48:27,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385500744] [2025-03-17 13:48:27,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:27,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:48:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:27,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:48:27,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:48:27,193 INFO L87 Difference]: Start difference. First operand 1497 states and 1747 transitions. Second operand has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:29,422 INFO L93 Difference]: Finished difference Result 1500 states and 1754 transitions. [2025-03-17 13:48:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:48:29,422 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-03-17 13:48:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:29,425 INFO L225 Difference]: With dead ends: 1500 [2025-03-17 13:48:29,425 INFO L226 Difference]: Without dead ends: 1500 [2025-03-17 13:48:29,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:48:29,425 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 1549 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 5429 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 5842 SdHoareTripleChecker+Invalid, 5453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:29,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 5842 Invalid, 5453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5429 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 13:48:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-03-17 13:48:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1497. [2025-03-17 13:48:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1019 states have (on average 1.6889106967615308) internal successors, (1721), 1485 states have internal predecessors, (1721), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:48:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1746 transitions. [2025-03-17 13:48:29,437 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1746 transitions. Word has length 85 [2025-03-17 13:48:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:29,437 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1746 transitions. [2025-03-17 13:48:29,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1746 transitions. [2025-03-17 13:48:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 13:48:29,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:29,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:29,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:48:29,439 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:29,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:29,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1554056680, now seen corresponding path program 1 times [2025-03-17 13:48:29,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:29,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576814214] [2025-03-17 13:48:29,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:29,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:29,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:48:29,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:48:29,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:29,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:29,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576814214] [2025-03-17 13:48:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576814214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225494041] [2025-03-17 13:48:29,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:29,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:48:29,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:48:29,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:48:29,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 13:48:29,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:48:30,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:48:30,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:30,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:30,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 13:48:30,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:48:30,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:48:30,111 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:48:30,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:48:30,118 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 19 treesize of output 1 [2025-03-17 13:48:30,182 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:48:30,182 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:48:30,218 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:48:30,218 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:48:30,229 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 31 treesize of output 13 [2025-03-17 13:48:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:30,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:48:30,245 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_928 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_928) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-17 13:48:30,299 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-17 13:48:30,300 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 33 treesize of output 32 [2025-03-17 13:48:30,307 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_931))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_928)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-03-17 13:48:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225494041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:30,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:48:30,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2025-03-17 13:48:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183579920] [2025-03-17 13:48:30,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:48:30,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 13:48:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:30,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 13:48:30,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=8, NotChecked=62, Total=342 [2025-03-17 13:48:30,309 INFO L87 Difference]: Start difference. First operand 1497 states and 1746 transitions. Second operand has 16 states, 14 states have (on average 8.785714285714286) internal successors, (123), 15 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:32,459 INFO L93 Difference]: Finished difference Result 1499 states and 1753 transitions. [2025-03-17 13:48:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:48:32,459 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.785714285714286) internal successors, (123), 15 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2025-03-17 13:48:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:32,461 INFO L225 Difference]: With dead ends: 1499 [2025-03-17 13:48:32,461 INFO L226 Difference]: Without dead ends: 1499 [2025-03-17 13:48:32,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=8, NotChecked=90, Total=650 [2025-03-17 13:48:32,462 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 1524 mSDsluCounter, 8563 mSDsCounter, 0 mSdLazyCounter, 6508 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 9541 SdHoareTripleChecker+Invalid, 6533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:32,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 9541 Invalid, 6533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6508 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 13:48:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2025-03-17 13:48:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1496. [2025-03-17 13:48:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1019 states have (on average 1.6879293424926398) internal successors, (1720), 1484 states have internal predecessors, (1720), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:48:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1745 transitions. [2025-03-17 13:48:32,473 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1745 transitions. Word has length 86 [2025-03-17 13:48:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:32,473 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1745 transitions. [2025-03-17 13:48:32,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.785714285714286) internal successors, (123), 15 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1745 transitions. [2025-03-17 13:48:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 13:48:32,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:32,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:32,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 13:48:32,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:48:32,674 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:32,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:32,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1554056679, now seen corresponding path program 1 times [2025-03-17 13:48:32,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:32,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929831558] [2025-03-17 13:48:32,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:32,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:32,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:48:32,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:48:32,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:32,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:33,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:33,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929831558] [2025-03-17 13:48:33,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929831558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:33,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719946452] [2025-03-17 13:48:33,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:33,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:48:33,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:48:33,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:48:33,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 13:48:33,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:48:33,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:48:33,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:33,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:33,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 13:48:33,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:48:33,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:48:33,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 13:48:33,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:48:33,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:48:33,472 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 19 treesize of output 1 [2025-03-17 13:48:33,476 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 13 treesize of output 9 [2025-03-17 13:48:33,530 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 22 treesize of output 10 [2025-03-17 13:48:33,534 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 9 treesize of output 3 [2025-03-17 13:48:33,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:48:33,608 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 13:48:33,616 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 30 treesize of output 13 [2025-03-17 13:48:33,672 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:48:33,672 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 13:48:33,680 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 30 treesize of output 13 [2025-03-17 13:48:33,690 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 31 treesize of output 13 [2025-03-17 13:48:33,694 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 9 treesize of output 3 [2025-03-17 13:48:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:33,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:48:33,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1072 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-17 13:48:33,765 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1072 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-17 13:48:33,832 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1077) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1078))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1077) .cse1 v_ArrVal_1072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-17 13:48:33,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719946452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:33,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:48:33,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-17 13:48:33,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372047998] [2025-03-17 13:48:33,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:48:33,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 13:48:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:33,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 13:48:33,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=397, Unknown=3, NotChecked=126, Total=600 [2025-03-17 13:48:33,835 INFO L87 Difference]: Start difference. First operand 1496 states and 1745 transitions. Second operand has 20 states, 17 states have (on average 8.0) internal successors, (136), 20 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:48:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:36,406 INFO L93 Difference]: Finished difference Result 1498 states and 1752 transitions. [2025-03-17 13:48:36,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:48:36,406 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.0) internal successors, (136), 20 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2025-03-17 13:48:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:36,408 INFO L225 Difference]: With dead ends: 1498 [2025-03-17 13:48:36,408 INFO L226 Difference]: Without dead ends: 1498 [2025-03-17 13:48:36,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=594, Unknown=3, NotChecked=156, Total=870 [2025-03-17 13:48:36,409 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 1530 mSDsluCounter, 5597 mSDsCounter, 0 mSdLazyCounter, 6340 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 6580 SdHoareTripleChecker+Invalid, 6380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 6340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:36,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 6580 Invalid, 6380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 6340 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 13:48:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-03-17 13:48:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1486. [2025-03-17 13:48:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1011 states have (on average 1.6913946587537092) internal successors, (1710), 1475 states have internal predecessors, (1710), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1734 transitions. [2025-03-17 13:48:36,421 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1734 transitions. Word has length 86 [2025-03-17 13:48:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:36,422 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 1734 transitions. [2025-03-17 13:48:36,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.0) internal successors, (136), 20 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:48:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1734 transitions. [2025-03-17 13:48:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 13:48:36,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:36,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:36,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 13:48:36,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:48:36,624 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:36,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash 712837614, now seen corresponding path program 1 times [2025-03-17 13:48:36,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:36,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870182687] [2025-03-17 13:48:36,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:36,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 13:48:36,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 13:48:36,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:36,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:37,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:37,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870182687] [2025-03-17 13:48:37,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870182687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:37,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:37,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 13:48:37,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901133850] [2025-03-17 13:48:37,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:37,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:48:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:37,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:48:37,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:48:37,058 INFO L87 Difference]: Start difference. First operand 1486 states and 1734 transitions. Second operand has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:38,734 INFO L93 Difference]: Finished difference Result 1502 states and 1756 transitions. [2025-03-17 13:48:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:48:38,734 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-03-17 13:48:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:38,736 INFO L225 Difference]: With dead ends: 1502 [2025-03-17 13:48:38,736 INFO L226 Difference]: Without dead ends: 1502 [2025-03-17 13:48:38,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-03-17 13:48:38,739 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 1554 mSDsluCounter, 5740 mSDsCounter, 0 mSdLazyCounter, 4585 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 6717 SdHoareTripleChecker+Invalid, 4610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:38,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 6717 Invalid, 4610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4585 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 13:48:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-03-17 13:48:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1498. [2025-03-17 13:48:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1022 states have (on average 1.6859099804305284) internal successors, (1723), 1486 states have internal predecessors, (1723), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:48:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1748 transitions. [2025-03-17 13:48:38,750 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1748 transitions. Word has length 88 [2025-03-17 13:48:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:38,750 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1748 transitions. [2025-03-17 13:48:38,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1748 transitions. [2025-03-17 13:48:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 13:48:38,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:38,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:38,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 13:48:38,751 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:38,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:38,751 INFO L85 PathProgramCache]: Analyzing trace with hash 712837615, now seen corresponding path program 1 times [2025-03-17 13:48:38,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:38,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763402021] [2025-03-17 13:48:38,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:38,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:38,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 13:48:38,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 13:48:38,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:38,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:39,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763402021] [2025-03-17 13:48:39,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763402021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:39,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:39,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 13:48:39,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524516956] [2025-03-17 13:48:39,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:39,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 13:48:39,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:39,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 13:48:39,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 13:48:39,287 INFO L87 Difference]: Start difference. First operand 1498 states and 1748 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:42,321 INFO L93 Difference]: Finished difference Result 1501 states and 1755 transitions. [2025-03-17 13:48:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 13:48:42,321 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-03-17 13:48:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:42,325 INFO L225 Difference]: With dead ends: 1501 [2025-03-17 13:48:42,325 INFO L226 Difference]: Without dead ends: 1501 [2025-03-17 13:48:42,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-17 13:48:42,326 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 1533 mSDsluCounter, 7252 mSDsCounter, 0 mSdLazyCounter, 7815 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 8236 SdHoareTripleChecker+Invalid, 7839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:42,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 8236 Invalid, 7839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7815 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 13:48:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-03-17 13:48:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1498. [2025-03-17 13:48:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1022 states have (on average 1.6849315068493151) internal successors, (1722), 1486 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:48:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1747 transitions. [2025-03-17 13:48:42,336 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1747 transitions. Word has length 88 [2025-03-17 13:48:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:42,336 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1747 transitions. [2025-03-17 13:48:42,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:48:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1747 transitions. [2025-03-17 13:48:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:48:42,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:42,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:42,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 13:48:42,337 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:42,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1448376337, now seen corresponding path program 1 times [2025-03-17 13:48:42,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:42,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799452852] [2025-03-17 13:48:42,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:42,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:42,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:48:42,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:48:42,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:42,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:42,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799452852] [2025-03-17 13:48:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799452852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858595092] [2025-03-17 13:48:42,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:42,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:48:42,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:48:42,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:48:42,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 13:48:42,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:48:42,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:48:42,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:42,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:42,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 13:48:42,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:48:42,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:48:43,039 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:48:43,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:48:43,046 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 19 treesize of output 1 [2025-03-17 13:48:43,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:48:43,114 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:48:43,153 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:48:43,153 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:48:43,183 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:48:43,183 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:48:43,196 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 31 treesize of output 13 [2025-03-17 13:48:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:43,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:48:43,208 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1360 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1360) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-17 13:48:47,325 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-03-17 13:48:47,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2025-03-17 13:48:47,330 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1363 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1363))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1359)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1360)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-03-17 13:48:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858595092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:47,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:48:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-03-17 13:48:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608081554] [2025-03-17 13:48:47,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:48:47,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 13:48:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:47,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 13:48:47,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=368, Unknown=30, NotChecked=82, Total=552 [2025-03-17 13:48:47,332 INFO L87 Difference]: Start difference. First operand 1498 states and 1747 transitions. Second operand has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 19 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:48:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:49,904 INFO L93 Difference]: Finished difference Result 1500 states and 1754 transitions. [2025-03-17 13:48:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:48:49,904 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 19 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2025-03-17 13:48:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:49,906 INFO L225 Difference]: With dead ends: 1500 [2025-03-17 13:48:49,906 INFO L226 Difference]: Without dead ends: 1500 [2025-03-17 13:48:49,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=143, Invalid=700, Unknown=35, NotChecked=114, Total=992 [2025-03-17 13:48:49,907 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 1526 mSDsluCounter, 7613 mSDsCounter, 0 mSdLazyCounter, 5891 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 8590 SdHoareTripleChecker+Invalid, 5929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 5891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:49,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 8590 Invalid, 5929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 5891 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 13:48:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-03-17 13:48:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1497. [2025-03-17 13:48:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1022 states have (on average 1.6839530332681019) internal successors, (1721), 1485 states have internal predecessors, (1721), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:48:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1746 transitions. [2025-03-17 13:48:49,916 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1746 transitions. Word has length 89 [2025-03-17 13:48:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:49,916 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1746 transitions. [2025-03-17 13:48:49,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 19 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:48:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1746 transitions. [2025-03-17 13:48:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:48:49,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:49,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:49,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 13:48:50,122 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,SelfDestructingSolverStorable23 [2025-03-17 13:48:50,122 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:50,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1448376336, now seen corresponding path program 1 times [2025-03-17 13:48:50,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:50,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530589245] [2025-03-17 13:48:50,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:50,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:48:50,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:48:50,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:50,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:50,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:50,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530589245] [2025-03-17 13:48:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530589245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:50,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423863978] [2025-03-17 13:48:50,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:50,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:48:50,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:48:50,639 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:48:50,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 13:48:50,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:48:50,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:48:50,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:50,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:50,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 13:48:50,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:48:50,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:48:50,934 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:48:50,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:48:50,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-17 13:48:50,945 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 13 treesize of output 9 [2025-03-17 13:48:50,951 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 19 treesize of output 1 [2025-03-17 13:48:50,994 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 22 treesize of output 10 [2025-03-17 13:48:50,999 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 9 treesize of output 3 [2025-03-17 13:48:51,083 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:48:51,083 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 13:48:51,095 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 30 treesize of output 13 [2025-03-17 13:48:51,156 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-17 13:48:51,156 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 39 [2025-03-17 13:48:51,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 30 treesize of output 13 [2025-03-17 13:48:51,241 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-17 13:48:51,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2025-03-17 13:48:51,249 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 30 treesize of output 13 [2025-03-17 13:48:51,257 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 7 treesize of output 3 [2025-03-17 13:48:51,271 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 31 treesize of output 13 [2025-03-17 13:48:51,276 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 9 treesize of output 3 [2025-03-17 13:48:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:51,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:48:51,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1519 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-17 13:48:51,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base|))) (and (forall ((|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1517) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store .cse0 (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store .cse0 (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1517) .cse2 v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2025-03-17 13:48:51,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1526))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1525) .cse0 v_ArrVal_1517) (select (select (store .cse1 .cse0 (store (select .cse1 .cse0) (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1519))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1526))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1525) .cse3 v_ArrVal_1517) .cse4 v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-03-17 13:48:51,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423863978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:48:51,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:48:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 18 [2025-03-17 13:48:51,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305592589] [2025-03-17 13:48:51,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:48:51,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 13:48:51,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:51,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 13:48:51,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=412, Unknown=14, NotChecked=132, Total=650 [2025-03-17 13:48:51,542 INFO L87 Difference]: Start difference. First operand 1497 states and 1746 transitions. Second operand has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 19 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:48:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:48:56,846 INFO L93 Difference]: Finished difference Result 1499 states and 1753 transitions. [2025-03-17 13:48:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:48:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 19 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2025-03-17 13:48:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:48:56,848 INFO L225 Difference]: With dead ends: 1499 [2025-03-17 13:48:56,848 INFO L226 Difference]: Without dead ends: 1499 [2025-03-17 13:48:56,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=708, Unknown=15, NotChecked=174, Total=1056 [2025-03-17 13:48:56,849 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 1522 mSDsluCounter, 8744 mSDsCounter, 0 mSdLazyCounter, 9541 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 9726 SdHoareTripleChecker+Invalid, 9567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 9541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:48:56,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 9726 Invalid, 9567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 9541 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-17 13:48:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2025-03-17 13:48:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1484. [2025-03-17 13:48:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1011 states have (on average 1.6894164193867458) internal successors, (1708), 1473 states have internal predecessors, (1708), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:48:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1732 transitions. [2025-03-17 13:48:56,858 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1732 transitions. Word has length 89 [2025-03-17 13:48:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:48:56,859 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1732 transitions. [2025-03-17 13:48:56,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 19 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:48:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1732 transitions. [2025-03-17 13:48:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 13:48:56,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:48:56,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:48:56,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 13:48:57,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:48:57,060 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:48:57,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:48:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1828734258, now seen corresponding path program 1 times [2025-03-17 13:48:57,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:48:57,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631459231] [2025-03-17 13:48:57,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:48:57,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:48:57,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 13:48:57,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 13:48:57,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:48:57,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:48:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:48:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:48:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631459231] [2025-03-17 13:48:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631459231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:48:57,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:48:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 13:48:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051626425] [2025-03-17 13:48:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:48:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 13:48:57,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:48:57,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 13:48:57,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:48:57,453 INFO L87 Difference]: Start difference. First operand 1484 states and 1732 transitions. Second operand has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 15 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:00,208 INFO L93 Difference]: Finished difference Result 1503 states and 1757 transitions. [2025-03-17 13:49:00,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:49:00,210 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 15 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2025-03-17 13:49:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:00,212 INFO L225 Difference]: With dead ends: 1503 [2025-03-17 13:49:00,212 INFO L226 Difference]: Without dead ends: 1503 [2025-03-17 13:49:00,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-17 13:49:00,213 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 1553 mSDsluCounter, 8586 mSDsCounter, 0 mSdLazyCounter, 6550 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 9562 SdHoareTripleChecker+Invalid, 6575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:00,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 9562 Invalid, 6575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6550 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 13:49:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-03-17 13:49:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1499. [2025-03-17 13:49:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1025 states have (on average 1.681951219512195) internal successors, (1724), 1487 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:49:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1749 transitions. [2025-03-17 13:49:00,226 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1749 transitions. Word has length 91 [2025-03-17 13:49:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:00,226 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1749 transitions. [2025-03-17 13:49:00,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.357142857142857) internal successors, (89), 15 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1749 transitions. [2025-03-17 13:49:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 13:49:00,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:00,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:00,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 13:49:00,227 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:49:00,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:00,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1828734259, now seen corresponding path program 1 times [2025-03-17 13:49:00,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:00,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87082758] [2025-03-17 13:49:00,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:00,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 13:49:00,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 13:49:00,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:00,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:00,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87082758] [2025-03-17 13:49:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87082758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 13:49:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053001051] [2025-03-17 13:49:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:00,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:49:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:00,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:49:00,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:49:00,732 INFO L87 Difference]: Start difference. First operand 1499 states and 1749 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:04,079 INFO L93 Difference]: Finished difference Result 1502 states and 1756 transitions. [2025-03-17 13:49:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:49:04,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2025-03-17 13:49:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:04,082 INFO L225 Difference]: With dead ends: 1502 [2025-03-17 13:49:04,082 INFO L226 Difference]: Without dead ends: 1502 [2025-03-17 13:49:04,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-17 13:49:04,082 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 1551 mSDsluCounter, 6327 mSDsCounter, 0 mSdLazyCounter, 7157 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 7310 SdHoareTripleChecker+Invalid, 7181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:04,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 7310 Invalid, 7181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7157 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 13:49:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-03-17 13:49:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1499. [2025-03-17 13:49:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1025 states have (on average 1.6809756097560975) internal successors, (1723), 1487 states have internal predecessors, (1723), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:49:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1748 transitions. [2025-03-17 13:49:04,095 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1748 transitions. Word has length 91 [2025-03-17 13:49:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:04,095 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1748 transitions. [2025-03-17 13:49:04,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1748 transitions. [2025-03-17 13:49:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:49:04,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:04,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:04,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 13:49:04,096 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:49:04,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1336312943, now seen corresponding path program 1 times [2025-03-17 13:49:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:04,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385394129] [2025-03-17 13:49:04,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:04,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:04,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:49:04,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:49:04,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:04,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:04,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385394129] [2025-03-17 13:49:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385394129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115099116] [2025-03-17 13:49:04,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:04,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:04,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:04,543 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:04,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 13:49:04,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:49:04,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:49:04,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:04,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:04,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 13:49:04,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:04,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:49:04,848 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:04,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:49:04,856 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 19 treesize of output 1 [2025-03-17 13:49:04,915 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:04,915 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:49:04,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:04,952 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:49:04,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:04,986 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:49:05,021 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:05,021 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:49:05,030 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 31 treesize of output 13 [2025-03-17 13:49:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:05,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:05,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1833) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:49:05,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1832 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1832))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1833)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:49:05,081 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1832 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1832))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1833)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:49:05,088 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1831 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1831))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1832)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1833)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:49:05,154 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-03-17 13:49:05,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2025-03-17 13:49:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115099116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:05,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-03-17 13:49:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120424780] [2025-03-17 13:49:05,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:05,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 13:49:05,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:05,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 13:49:05,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=453, Unknown=27, NotChecked=188, Total=756 [2025-03-17 13:49:05,203 INFO L87 Difference]: Start difference. First operand 1499 states and 1748 transitions. Second operand has 21 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:49:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:08,355 INFO L93 Difference]: Finished difference Result 1501 states and 1755 transitions. [2025-03-17 13:49:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:49:08,355 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2025-03-17 13:49:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:08,358 INFO L225 Difference]: With dead ends: 1501 [2025-03-17 13:49:08,358 INFO L226 Difference]: Without dead ends: 1501 [2025-03-17 13:49:08,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=871, Unknown=34, NotChecked=260, Total=1332 [2025-03-17 13:49:08,358 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 1524 mSDsluCounter, 9526 mSDsCounter, 0 mSdLazyCounter, 7159 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 10502 SdHoareTripleChecker+Invalid, 7197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 7159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:08,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 10502 Invalid, 7197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 7159 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-17 13:49:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-03-17 13:49:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1498. [2025-03-17 13:49:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1025 states have (on average 1.68) internal successors, (1722), 1486 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:49:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1747 transitions. [2025-03-17 13:49:08,368 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1747 transitions. Word has length 92 [2025-03-17 13:49:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:08,369 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1747 transitions. [2025-03-17 13:49:08,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:49:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1747 transitions. [2025-03-17 13:49:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:49:08,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:08,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:08,377 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-17 13:49:08,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:08,570 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:49:08,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1336312942, now seen corresponding path program 1 times [2025-03-17 13:49:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:08,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562224803] [2025-03-17 13:49:08,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:08,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:49:08,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:49:08,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:08,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:09,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:09,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562224803] [2025-03-17 13:49:09,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562224803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:09,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789412859] [2025-03-17 13:49:09,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:09,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:09,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:09,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:09,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 13:49:09,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:49:09,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:49:09,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:09,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:09,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 13:49:09,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:09,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 13:49:09,463 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:09,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:49:09,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-17 13:49:09,476 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 19 treesize of output 1 [2025-03-17 13:49:09,482 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 13 treesize of output 9 [2025-03-17 13:49:09,516 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 22 treesize of output 10 [2025-03-17 13:49:09,520 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 9 treesize of output 3 [2025-03-17 13:49:09,597 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:09,597 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 13:49:09,600 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 30 treesize of output 13 [2025-03-17 13:49:09,645 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:09,646 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 13:49:09,653 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 30 treesize of output 13 [2025-03-17 13:49:09,690 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:09,690 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 13:49:09,694 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 30 treesize of output 13 [2025-03-17 13:49:09,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:09,741 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 13:49:09,748 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 30 treesize of output 13 [2025-03-17 13:49:09,759 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 31 treesize of output 13 [2025-03-17 13:49:09,763 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 9 treesize of output 3 [2025-03-17 13:49:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:09,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:09,816 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2004 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-03-17 13:49:09,824 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2004 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-17 13:49:09,835 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2002) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2003))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2002) .cse1 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-17 13:49:09,844 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2003))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 24 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2002) .cse1 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2002) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2025-03-17 13:49:09,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2001))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2003))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2000) .cse0 v_ArrVal_2002) .cse1 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2001))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2000) .cse5 v_ArrVal_2002) (select (select (store .cse6 .cse5 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2004))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-03-17 13:49:09,885 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2003))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2000) .cse1 v_ArrVal_2002) .cse2 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2001))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2000) .cse6 v_ArrVal_2002) (select (select (store .cse7 .cse6 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2004))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-03-17 13:49:09,932 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2011 (Array Int Int)) (v_ArrVal_2000 (Array Int Int)) (v_ArrVal_2010 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2011))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2003))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2010) .cse0 v_ArrVal_2000) .cse1 v_ArrVal_2002) .cse2 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2011 (Array Int Int)) (v_ArrVal_2000 (Array Int Int)) (v_ArrVal_2010 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2011))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2001))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2010) .cse7 v_ArrVal_2000) .cse8 v_ArrVal_2002) (select (select (store .cse9 .cse8 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2004))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-03-17 13:49:09,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789412859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:09,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:09,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2025-03-17 13:49:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271227908] [2025-03-17 13:49:09,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:09,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 13:49:09,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:09,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 13:49:09,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=394, Unknown=7, NotChecked=322, Total=812 [2025-03-17 13:49:09,936 INFO L87 Difference]: Start difference. First operand 1498 states and 1747 transitions. Second operand has 20 states, 18 states have (on average 7.666666666666667) internal successors, (138), 20 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:49:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:14,811 INFO L93 Difference]: Finished difference Result 1500 states and 1754 transitions. [2025-03-17 13:49:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:49:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.666666666666667) internal successors, (138), 20 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2025-03-17 13:49:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:14,813 INFO L225 Difference]: With dead ends: 1500 [2025-03-17 13:49:14,813 INFO L226 Difference]: Without dead ends: 1500 [2025-03-17 13:49:14,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=690, Unknown=7, NotChecked=420, Total=1260 [2025-03-17 13:49:14,814 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 1520 mSDsluCounter, 8737 mSDsCounter, 0 mSdLazyCounter, 9514 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 9718 SdHoareTripleChecker+Invalid, 9540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 9514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:14,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 9718 Invalid, 9540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 9514 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-17 13:49:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-03-17 13:49:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1482. [2025-03-17 13:49:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1011 states have (on average 1.6874381800197824) internal successors, (1706), 1471 states have internal predecessors, (1706), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 13:49:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1730 transitions. [2025-03-17 13:49:14,823 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1730 transitions. Word has length 92 [2025-03-17 13:49:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:14,823 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1730 transitions. [2025-03-17 13:49:14,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.666666666666667) internal successors, (138), 20 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:49:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1730 transitions. [2025-03-17 13:49:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:49:14,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:14,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:14,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 13:49:15,024 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,SelfDestructingSolverStorable28 [2025-03-17 13:49:15,024 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr597REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:49:15,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:15,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1087301780, now seen corresponding path program 1 times [2025-03-17 13:49:15,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:15,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206754729] [2025-03-17 13:49:15,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:15,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:15,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:49:15,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:49:15,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:15,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:15,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:15,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206754729] [2025-03-17 13:49:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206754729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:15,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:15,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 13:49:15,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355331599] [2025-03-17 13:49:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:15,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 13:49:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:15,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 13:49:15,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-17 13:49:15,515 INFO L87 Difference]: Start difference. First operand 1482 states and 1730 transitions. Second operand has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:17,849 INFO L93 Difference]: Finished difference Result 1505 states and 1759 transitions. [2025-03-17 13:49:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:49:17,850 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-03-17 13:49:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:17,852 INFO L225 Difference]: With dead ends: 1505 [2025-03-17 13:49:17,852 INFO L226 Difference]: Without dead ends: 1505 [2025-03-17 13:49:17,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-03-17 13:49:17,853 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 1559 mSDsluCounter, 6689 mSDsCounter, 0 mSdLazyCounter, 5259 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 7664 SdHoareTripleChecker+Invalid, 5287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:17,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 7664 Invalid, 5287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 5259 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 13:49:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-17 13:49:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1501. [2025-03-17 13:49:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1029 states have (on average 1.6773566569484937) internal successors, (1726), 1489 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 13:49:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1751 transitions. [2025-03-17 13:49:17,866 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1751 transitions. Word has length 95 [2025-03-17 13:49:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:17,866 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1751 transitions. [2025-03-17 13:49:17,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.2) internal successors, (93), 16 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1751 transitions. [2025-03-17 13:49:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:49:17,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:17,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:17,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 13:49:17,867 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-03-17 13:49:17,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:17,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1087301779, now seen corresponding path program 1 times [2025-03-17 13:49:17,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:17,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649624202] [2025-03-17 13:49:17,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:17,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:17,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:49:17,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:49:17,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:17,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:18,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:18,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649624202] [2025-03-17 13:49:18,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649624202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:18,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:18,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 13:49:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479030075] [2025-03-17 13:49:18,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:18,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 13:49:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:18,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 13:49:18,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-17 13:49:18,714 INFO L87 Difference]: Start difference. First operand 1501 states and 1751 transitions. Second operand has 18 states, 16 states have (on average 5.8125) internal successors, (93), 17 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)