./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:09:38,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:09:38,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:09:38,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:09:38,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:09:38,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:09:38,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:09:38,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:09:38,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:09:38,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:09:38,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:09:38,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:09:38,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:09:38,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:09:38,298 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:09:38,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:09:38,298 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:09:38,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:09:38,299 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:09:38,300 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:09:38,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:09:38,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:09:38,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:09:38,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:09:38,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:09:38,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:09:38,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:09:38,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:09:38,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:09:38,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:09:38,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:09:38,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:09:38,301 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-jdk21/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 -> df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c [2025-02-06 12:09:38,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:09:38,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:09:38,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:09:38,521 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:09:38,521 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:09:38,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2025-02-06 12:09:39,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f30a3d5f7/cbcc86331eda4fa4baac84bd2ceafcfc/FLAGa66131569 [2025-02-06 12:09:40,062 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:09:40,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2025-02-06 12:09:40,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f30a3d5f7/cbcc86331eda4fa4baac84bd2ceafcfc/FLAGa66131569 [2025-02-06 12:09:40,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f30a3d5f7/cbcc86331eda4fa4baac84bd2ceafcfc [2025-02-06 12:09:40,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:09:40,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:09:40,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:09:40,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:09:40,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:09:40,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2144bbaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40, skipping insertion in model container [2025-02-06 12:09:40,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:09:40,524 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,549 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,551 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,553 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,557 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,576 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,577 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,579 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,582 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,604 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,604 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,606 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,606 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:09:40,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:09:40,622 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:09:40,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:09:40,723 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:09:40,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40 WrapperNode [2025-02-06 12:09:40,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:09:40,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:09:40,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:09:40,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:09:40,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,821 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1990 [2025-02-06 12:09:40,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:09:40,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:09:40,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:09:40,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:09:40,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,923 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [323, 2, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 83 writes are split as follows [82, 0, 1]. [2025-02-06 12:09:40,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:40,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:41,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:09:41,012 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:09:41,012 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:09:41,012 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:09:41,013 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (1/1) ... [2025-02-06 12:09:41,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:09:41,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:09:41,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:09:41,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:09:41,078 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 12:09:41,081 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 12:09:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 12:09:41,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 12:09:41,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 12:09:41,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 12:09:41,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:09:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:09:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:09:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:09:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:09:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:09:41,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:09:41,276 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:09:41,278 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:09:43,623 INFO L1309 $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-02-06 12:09:43,790 INFO L? ?]: Removed 1734 outVars from TransFormulas that were not future-live. [2025-02-06 12:09:43,790 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:09:43,842 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:09:43,843 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 12:09:43,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:09:43 BoogieIcfgContainer [2025-02-06 12:09:43,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:09:43,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:09:43,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:09:43,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:09:43,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:09:40" (1/3) ... [2025-02-06 12:09:43,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0b564c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:09:43, skipping insertion in model container [2025-02-06 12:09:43,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:09:40" (2/3) ... [2025-02-06 12:09:43,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0b564c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:09:43, skipping insertion in model container [2025-02-06 12:09:43,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:09:43" (3/3) ... [2025-02-06 12:09:43,849 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-1.i [2025-02-06 12:09:43,858 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:09:43,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test5-1.i that has 6 procedures, 1757 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2025-02-06 12:09:43,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:09:43,907 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;@56c48c29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:09:43,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2025-02-06 12:09:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 1747 states, 1024 states have (on average 2.017578125) internal successors, (2066), 1737 states have internal predecessors, (2066), 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-02-06 12:09:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 12:09:43,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:43,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:09:43,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:43,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:43,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2088215325, now seen corresponding path program 1 times [2025-02-06 12:09:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:43,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983668146] [2025-02-06 12:09:43,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:43,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:43,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:09:43,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:09:43,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:43,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:44,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:44,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983668146] [2025-02-06 12:09:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983668146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:44,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:44,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:09:44,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058223047] [2025-02-06 12:09:44,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:44,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:09:44,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:44,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:09:44,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:09:44,055 INFO L87 Difference]: Start difference. First operand has 1747 states, 1024 states have (on average 2.017578125) internal successors, (2066), 1737 states have internal predecessors, (2066), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:09:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:44,342 INFO L93 Difference]: Finished difference Result 3435 states and 3955 transitions. [2025-02-06 12:09:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:09:44,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 12:09:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:44,370 INFO L225 Difference]: With dead ends: 3435 [2025-02-06 12:09:44,371 INFO L226 Difference]: Without dead ends: 3433 [2025-02-06 12:09:44,372 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-02-06 12:09:44,374 INFO L435 NwaCegarLoop]: 2171 mSDtfsCounter, 1943 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 4084 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:44,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 4084 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:09:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2025-02-06 12:09:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 1727. [2025-02-06 12:09:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1016 states have (on average 1.9320866141732282) internal successors, (1963), 1717 states have internal predecessors, (1963), 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-02-06 12:09:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 1987 transitions. [2025-02-06 12:09:44,511 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 1987 transitions. Word has length 5 [2025-02-06 12:09:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:44,512 INFO L471 AbstractCegarLoop]: Abstraction has 1727 states and 1987 transitions. [2025-02-06 12:09:44,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:09:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 1987 transitions. [2025-02-06 12:09:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 12:09:44,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:44,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:09:44,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:09:44,514 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-02-06 12:09:44,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2089896139, now seen corresponding path program 1 times [2025-02-06 12:09:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:44,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571631175] [2025-02-06 12:09:44,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:44,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:44,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:09:44,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:09:44,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:44,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:44,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:44,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571631175] [2025-02-06 12:09:44,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571631175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:44,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:44,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:09:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580718090] [2025-02-06 12:09:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:44,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:09:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:44,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:09:44,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:09:44,641 INFO L87 Difference]: Start difference. First operand 1727 states and 1987 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:09:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:45,547 INFO L93 Difference]: Finished difference Result 1635 states and 1895 transitions. [2025-02-06 12:09:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:09:45,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 12:09:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:45,553 INFO L225 Difference]: With dead ends: 1635 [2025-02-06 12:09:45,553 INFO L226 Difference]: Without dead ends: 1635 [2025-02-06 12:09:45,554 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-02-06 12:09:45,554 INFO L435 NwaCegarLoop]: 1130 mSDtfsCounter, 1746 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:45,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 1141 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 12:09:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2025-02-06 12:09:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2025-02-06 12:09:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1016 states have (on average 1.8415354330708662) internal successors, (1871), 1625 states have internal predecessors, (1871), 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-02-06 12:09:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1895 transitions. [2025-02-06 12:09:45,616 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1895 transitions. Word has length 5 [2025-02-06 12:09:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:45,617 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 1895 transitions. [2025-02-06 12:09:45,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:09:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1895 transitions. [2025-02-06 12:09:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 12:09:45,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:45,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:09:45,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:09:45,618 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-02-06 12:09:45,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2089896140, now seen corresponding path program 1 times [2025-02-06 12:09:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:45,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137901981] [2025-02-06 12:09:45,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:45,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:09:45,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:09:45,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:45,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:45,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:45,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137901981] [2025-02-06 12:09:45,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137901981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:45,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:45,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:09:45,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215934545] [2025-02-06 12:09:45,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:45,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:09:45,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:45,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:09:45,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:09:45,727 INFO L87 Difference]: Start difference. First operand 1635 states and 1895 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:09:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:46,759 INFO L93 Difference]: Finished difference Result 2379 states and 2803 transitions. [2025-02-06 12:09:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:09:46,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 12:09:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:46,768 INFO L225 Difference]: With dead ends: 2379 [2025-02-06 12:09:46,768 INFO L226 Difference]: Without dead ends: 2379 [2025-02-06 12:09:46,768 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-02-06 12:09:46,769 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 1224 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:46,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 2385 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 12:09:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-02-06 12:09:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1903. [2025-02-06 12:09:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1294 states have (on average 1.8160741885625966) internal successors, (2350), 1893 states have internal predecessors, (2350), 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-02-06 12:09:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2374 transitions. [2025-02-06 12:09:46,818 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2374 transitions. Word has length 5 [2025-02-06 12:09:46,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:46,818 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2374 transitions. [2025-02-06 12:09:46,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:09:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2374 transitions. [2025-02-06 12:09:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 12:09:46,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:46,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:09:46,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:09:46,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr705REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:46,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:46,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1495697316, now seen corresponding path program 1 times [2025-02-06 12:09:46,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:46,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390343950] [2025-02-06 12:09:46,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:46,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:46,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:09:46,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:09:46,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:46,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:46,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:46,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390343950] [2025-02-06 12:09:46,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390343950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:46,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:46,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:09:46,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232741257] [2025-02-06 12:09:46,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:46,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:09:46,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:46,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:09:46,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:09:46,915 INFO L87 Difference]: Start difference. First operand 1903 states and 2374 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:09:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:48,101 INFO L93 Difference]: Finished difference Result 1929 states and 2427 transitions. [2025-02-06 12:09:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:09:48,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 12:09:48,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:48,107 INFO L225 Difference]: With dead ends: 1929 [2025-02-06 12:09:48,107 INFO L226 Difference]: Without dead ends: 1929 [2025-02-06 12:09:48,108 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-02-06 12:09:48,110 INFO L435 NwaCegarLoop]: 1106 mSDtfsCounter, 2013 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2024 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:48,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2024 Valid, 2078 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:09:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2025-02-06 12:09:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1880. [2025-02-06 12:09:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1294 states have (on average 1.7982998454404946) internal successors, (2327), 1870 states have internal predecessors, (2327), 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-02-06 12:09:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2351 transitions. [2025-02-06 12:09:48,180 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2351 transitions. Word has length 11 [2025-02-06 12:09:48,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:48,180 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 2351 transitions. [2025-02-06 12:09:48,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:09:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2351 transitions. [2025-02-06 12:09:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 12:09:48,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:48,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:09:48,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:09:48,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr706REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:48,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1495697317, now seen corresponding path program 1 times [2025-02-06 12:09:48,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:48,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811094939] [2025-02-06 12:09:48,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:48,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:48,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:09:48,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:09:48,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811094939] [2025-02-06 12:09:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811094939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:48,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:09:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964956667] [2025-02-06 12:09:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:48,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:09:48,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:48,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:09:48,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:09:48,288 INFO L87 Difference]: Start difference. First operand 1880 states and 2351 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:09:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:48,481 INFO L93 Difference]: Finished difference Result 1805 states and 2248 transitions. [2025-02-06 12:09:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:09:48,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 12:09:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:48,487 INFO L225 Difference]: With dead ends: 1805 [2025-02-06 12:09:48,487 INFO L226 Difference]: Without dead ends: 1805 [2025-02-06 12:09:48,488 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-02-06 12:09:48,488 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 60 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3331 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.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:48,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3331 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:09:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2025-02-06 12:09:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2025-02-06 12:09:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1231 states have (on average 1.8066612510154345) internal successors, (2224), 1795 states have internal predecessors, (2224), 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-02-06 12:09:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2248 transitions. [2025-02-06 12:09:48,512 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2248 transitions. Word has length 11 [2025-02-06 12:09:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:48,513 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2248 transitions. [2025-02-06 12:09:48,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:09:48,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2248 transitions. [2025-02-06 12:09:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 12:09:48,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:48,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:09:48,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:09:48,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash -878146438, now seen corresponding path program 1 times [2025-02-06 12:09:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:48,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120639422] [2025-02-06 12:09:48,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:48,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:09:48,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:09:48,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:48,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:48,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120639422] [2025-02-06 12:09:48,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120639422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:48,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:48,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:09:48,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208602127] [2025-02-06 12:09:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:48,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:09:48,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:48,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:09:48,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:09:48,593 INFO L87 Difference]: Start difference. First operand 1805 states and 2248 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-06 12:09:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:48,750 INFO L93 Difference]: Finished difference Result 1787 states and 2223 transitions. [2025-02-06 12:09:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:09:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 12:09:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:48,754 INFO L225 Difference]: With dead ends: 1787 [2025-02-06 12:09:48,754 INFO L226 Difference]: Without dead ends: 1787 [2025-02-06 12:09:48,754 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-02-06 12:09:48,755 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 41 mSDsluCounter, 3286 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4943 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-02-06 12:09:48,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4943 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:09:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2025-02-06 12:09:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1784. [2025-02-06 12:09:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1217 states have (on average 1.8044371405094495) internal successors, (2196), 1774 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-02-06 12:09:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2220 transitions. [2025-02-06 12:09:48,772 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2220 transitions. Word has length 12 [2025-02-06 12:09:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:48,772 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2220 transitions. [2025-02-06 12:09:48,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-02-06 12:09:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2220 transitions. [2025-02-06 12:09:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 12:09:48,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:48,773 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] [2025-02-06 12:09:48,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:09:48,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr668REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:48,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:48,773 INFO L85 PathProgramCache]: Analyzing trace with hash -411732336, now seen corresponding path program 1 times [2025-02-06 12:09:48,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:48,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251917192] [2025-02-06 12:09:48,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:48,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:09:48,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:09:48,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:48,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:48,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251917192] [2025-02-06 12:09:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251917192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:48,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:09:48,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252187333] [2025-02-06 12:09:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:48,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:09:48,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:48,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:09:48,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:09:48,912 INFO L87 Difference]: Start difference. First operand 1784 states and 2220 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-02-06 12:09:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:50,025 INFO L93 Difference]: Finished difference Result 2305 states and 2721 transitions. [2025-02-06 12:09:50,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:09:50,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-02-06 12:09:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:50,032 INFO L225 Difference]: With dead ends: 2305 [2025-02-06 12:09:50,032 INFO L226 Difference]: Without dead ends: 2305 [2025-02-06 12:09:50,032 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-02-06 12:09:50,033 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1229 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:50,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 3259 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:09:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2025-02-06 12:09:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 1780. [2025-02-06 12:09:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1217 states have (on average 1.801150369761709) internal successors, (2192), 1770 states have internal predecessors, (2192), 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-02-06 12:09:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2216 transitions. [2025-02-06 12:09:50,070 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2216 transitions. Word has length 26 [2025-02-06 12:09:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:50,071 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2216 transitions. [2025-02-06 12:09:50,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-02-06 12:09:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2216 transitions. [2025-02-06 12:09:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 12:09:50,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:50,072 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] [2025-02-06 12:09:50,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:09:50,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:50,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:50,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2135049405, now seen corresponding path program 1 times [2025-02-06 12:09:50,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:50,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041108685] [2025-02-06 12:09:50,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:50,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:50,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 12:09:50,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 12:09:50,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:50,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:50,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:50,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041108685] [2025-02-06 12:09:50,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041108685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:50,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:50,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:09:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193610302] [2025-02-06 12:09:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:50,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:09:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:50,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:09:50,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:09:50,187 INFO L87 Difference]: Start difference. First operand 1780 states and 2216 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-02-06 12:09:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:50,312 INFO L93 Difference]: Finished difference Result 1780 states and 2212 transitions. [2025-02-06 12:09:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:09:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-02-06 12:09:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:50,317 INFO L225 Difference]: With dead ends: 1780 [2025-02-06 12:09:50,317 INFO L226 Difference]: Without dead ends: 1780 [2025-02-06 12:09:50,317 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-02-06 12:09:50,317 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 21 mSDsluCounter, 3273 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4925 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-02-06 12:09:50,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4925 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:09:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-02-06 12:09:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1780. [2025-02-06 12:09:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1217 states have (on average 1.7978635990139689) internal successors, (2188), 1770 states have internal predecessors, (2188), 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-02-06 12:09:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2212 transitions. [2025-02-06 12:09:50,338 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2212 transitions. Word has length 61 [2025-02-06 12:09:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:50,338 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2212 transitions. [2025-02-06 12:09:50,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-02-06 12:09:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2212 transitions. [2025-02-06 12:09:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 12:09:50,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:50,340 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-02-06 12:09:50,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:09:50,340 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-02-06 12:09:50,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:50,341 INFO L85 PathProgramCache]: Analyzing trace with hash -518919173, now seen corresponding path program 1 times [2025-02-06 12:09:50,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:50,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115786490] [2025-02-06 12:09:50,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:50,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 12:09:50,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 12:09:50,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:50,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:50,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115786490] [2025-02-06 12:09:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115786490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:50,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:50,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:09:50,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334281078] [2025-02-06 12:09:50,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:50,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:09:50,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:50,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:09:50,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:09:50,451 INFO L87 Difference]: Start difference. First operand 1780 states and 2212 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-02-06 12:09:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:50,562 INFO L93 Difference]: Finished difference Result 1872 states and 2331 transitions. [2025-02-06 12:09:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:09:50,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-02-06 12:09:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:50,568 INFO L225 Difference]: With dead ends: 1872 [2025-02-06 12:09:50,568 INFO L226 Difference]: Without dead ends: 1872 [2025-02-06 12:09:50,568 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-02-06 12:09:50,569 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 54 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3305 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-02-06 12:09:50,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3305 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:09:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-02-06 12:09:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1872. [2025-02-06 12:09:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1309 states have (on average 1.7624140565317037) internal successors, (2307), 1862 states have internal predecessors, (2307), 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-02-06 12:09:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2331 transitions. [2025-02-06 12:09:50,592 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2331 transitions. Word has length 69 [2025-02-06 12:09:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:50,592 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 2331 transitions. [2025-02-06 12:09:50,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-02-06 12:09:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2331 transitions. [2025-02-06 12:09:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 12:09:50,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:50,593 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] [2025-02-06 12:09:50,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:09:50,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:50,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1534366581, now seen corresponding path program 1 times [2025-02-06 12:09:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:50,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353796835] [2025-02-06 12:09:50,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:50,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:50,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 12:09:50,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 12:09:50,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:50,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:51,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:51,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353796835] [2025-02-06 12:09:51,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353796835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:51,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:51,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:09:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423069160] [2025-02-06 12:09:51,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:51,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:09:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:51,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:09:51,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:09:51,197 INFO L87 Difference]: Start difference. First operand 1872 states and 2331 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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-02-06 12:09:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:52,469 INFO L93 Difference]: Finished difference Result 1788 states and 2247 transitions. [2025-02-06 12:09:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:09:52,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-02-06 12:09:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:52,473 INFO L225 Difference]: With dead ends: 1788 [2025-02-06 12:09:52,473 INFO L226 Difference]: Without dead ends: 1788 [2025-02-06 12:09:52,474 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-02-06 12:09:52,474 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1560 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:52,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 1531 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 12:09:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2025-02-06 12:09:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1510. [2025-02-06 12:09:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1031 states have (on average 1.6818622696411252) internal successors, (1734), 1500 states have internal predecessors, (1734), 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-02-06 12:09:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1758 transitions. [2025-02-06 12:09:52,493 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1758 transitions. Word has length 72 [2025-02-06 12:09:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:52,493 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1758 transitions. [2025-02-06 12:09:52,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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-02-06 12:09:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1758 transitions. [2025-02-06 12:09:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:09:52,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:52,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] [2025-02-06 12:09:52,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:09:52,494 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr617REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:52,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash 346095238, now seen corresponding path program 1 times [2025-02-06 12:09:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:52,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316044010] [2025-02-06 12:09:52,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:52,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 12:09:52,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:09:52,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:52,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:52,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:52,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316044010] [2025-02-06 12:09:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316044010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:52,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:52,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:09:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568062327] [2025-02-06 12:09:52,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:52,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:09:52,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:52,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:09:52,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:09:52,674 INFO L87 Difference]: Start difference. First operand 1510 states and 1758 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-02-06 12:09:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:53,607 INFO L93 Difference]: Finished difference Result 1509 states and 1757 transitions. [2025-02-06 12:09:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:09:53,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-02-06 12:09:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:53,612 INFO L225 Difference]: With dead ends: 1509 [2025-02-06 12:09:53,613 INFO L226 Difference]: Without dead ends: 1509 [2025-02-06 12:09:53,613 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-02-06 12:09:53,614 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 2 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4598 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:53,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4598 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 12:09:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-02-06 12:09:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2025-02-06 12:09:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1031 states have (on average 1.6808923375363725) internal successors, (1733), 1499 states have internal predecessors, (1733), 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-02-06 12:09:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1757 transitions. [2025-02-06 12:09:53,656 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1757 transitions. Word has length 77 [2025-02-06 12:09:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:53,656 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1757 transitions. [2025-02-06 12:09:53,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-02-06 12:09:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1757 transitions. [2025-02-06 12:09:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:09:53,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:53,657 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] [2025-02-06 12:09:53,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:09:53,657 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr618REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:53,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash 346095239, now seen corresponding path program 1 times [2025-02-06 12:09:53,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:53,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531302219] [2025-02-06 12:09:53,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:53,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:53,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 12:09:53,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:09:53,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:53,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:54,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:54,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531302219] [2025-02-06 12:09:54,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531302219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:54,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:54,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:09:54,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678418272] [2025-02-06 12:09:54,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:54,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:09:54,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:54,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:09:54,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:09:54,105 INFO L87 Difference]: Start difference. First operand 1509 states and 1757 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-02-06 12:09:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:55,096 INFO L93 Difference]: Finished difference Result 1508 states and 1756 transitions. [2025-02-06 12:09:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:09:55,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-02-06 12:09:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:55,100 INFO L225 Difference]: With dead ends: 1508 [2025-02-06 12:09:55,100 INFO L226 Difference]: Without dead ends: 1508 [2025-02-06 12:09:55,100 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-02-06 12:09:55,101 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 1 mSDsluCounter, 3042 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4620 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:55,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4620 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 12:09:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-02-06 12:09:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2025-02-06 12:09:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1030 states have (on average 1.6815533980582524) internal successors, (1732), 1498 states have internal predecessors, (1732), 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-02-06 12:09:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1756 transitions. [2025-02-06 12:09:55,138 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1756 transitions. Word has length 77 [2025-02-06 12:09:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:55,139 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 1756 transitions. [2025-02-06 12:09:55,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-02-06 12:09:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1756 transitions. [2025-02-06 12:09:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 12:09:55,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:55,147 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-02-06 12:09:55,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:09:55,147 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:55,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash 262022851, now seen corresponding path program 1 times [2025-02-06 12:09:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:55,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705887584] [2025-02-06 12:09:55,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:55,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:55,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 12:09:55,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 12:09:55,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:55,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:55,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:55,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705887584] [2025-02-06 12:09:55,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705887584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:55,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:55,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:09:55,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743850123] [2025-02-06 12:09:55,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:55,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:09:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:55,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:09:55,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:09:55,319 INFO L87 Difference]: Start difference. First operand 1508 states and 1756 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 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-02-06 12:09:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:56,590 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2025-02-06 12:09:56,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:09:56,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 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-02-06 12:09:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:56,594 INFO L225 Difference]: With dead ends: 1520 [2025-02-06 12:09:56,594 INFO L226 Difference]: Without dead ends: 1520 [2025-02-06 12:09:56,595 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-02-06 12:09:56,595 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 13 mSDsluCounter, 5640 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7200 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:56,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7200 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 12:09:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-02-06 12:09:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1514. [2025-02-06 12:09:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1035 states have (on average 1.680193236714976) internal successors, (1739), 1503 states have internal predecessors, (1739), 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-02-06 12:09:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1769 transitions. [2025-02-06 12:09:56,609 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1769 transitions. Word has length 85 [2025-02-06 12:09:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:56,610 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1769 transitions. [2025-02-06 12:09:56,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 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-02-06 12:09:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1769 transitions. [2025-02-06 12:09:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 12:09:56,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:56,610 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-02-06 12:09:56,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:09:56,611 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:56,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:56,611 INFO L85 PathProgramCache]: Analyzing trace with hash 262022852, now seen corresponding path program 1 times [2025-02-06 12:09:56,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:56,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588123855] [2025-02-06 12:09:56,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:56,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:56,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 12:09:56,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 12:09:56,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:56,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:56,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588123855] [2025-02-06 12:09:56,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588123855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:09:56,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:09:56,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:09:56,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778816829] [2025-02-06 12:09:56,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:09:56,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:09:56,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:56,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:09:56,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:09:56,930 INFO L87 Difference]: Start difference. First operand 1514 states and 1769 transitions. Second operand has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 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-02-06 12:09:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:09:58,271 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2025-02-06 12:09:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:09:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 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-02-06 12:09:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:09:58,278 INFO L225 Difference]: With dead ends: 1514 [2025-02-06 12:09:58,278 INFO L226 Difference]: Without dead ends: 1514 [2025-02-06 12:09:58,279 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-02-06 12:09:58,279 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 8 mSDsluCounter, 4342 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5909 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:09:58,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5909 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:09:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2025-02-06 12:09:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2025-02-06 12:09:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1035 states have (on average 1.6792270531400966) internal successors, (1738), 1503 states have internal predecessors, (1738), 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-02-06 12:09:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1768 transitions. [2025-02-06 12:09:58,295 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1768 transitions. Word has length 85 [2025-02-06 12:09:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:09:58,296 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1768 transitions. [2025-02-06 12:09:58,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 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-02-06 12:09:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1768 transitions. [2025-02-06 12:09:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 12:09:58,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:09:58,296 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-02-06 12:09:58,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:09:58,297 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:09:58,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:09:58,297 INFO L85 PathProgramCache]: Analyzing trace with hash 857374555, now seen corresponding path program 1 times [2025-02-06 12:09:58,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:09:58,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332080732] [2025-02-06 12:09:58,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:58,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:09:58,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:09:58,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:09:58,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:58,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:09:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332080732] [2025-02-06 12:09:58,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332080732] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:09:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565698111] [2025-02-06 12:09:58,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:09:58,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:09:58,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:09:58,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:09:58,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:09:58,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:09:58,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:09:58,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:09:58,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:09:58,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 12:09:58,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:09:58,985 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:09:58,985 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-02-06 12:09:58,997 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-02-06 12:09:59,044 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:09:59,045 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-02-06 12:09:59,068 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-02-06 12:09:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:09:59,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:09:59,108 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-06 12:09:59,109 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-02-06 12:09:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565698111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:09:59,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:09:59,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2025-02-06 12:09:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276318758] [2025-02-06 12:09:59,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:09:59,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:09:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:09:59,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:09:59,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=165, Unknown=10, NotChecked=0, Total=210 [2025-02-06 12:09:59,135 INFO L87 Difference]: Start difference. First operand 1514 states and 1768 transitions. Second operand has 14 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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-02-06 12:10:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:01,687 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2025-02-06 12:10:01,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:10:01,688 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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 86 [2025-02-06 12:10:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:01,693 INFO L225 Difference]: With dead ends: 1513 [2025-02-06 12:10:01,693 INFO L226 Difference]: Without dead ends: 1513 [2025-02-06 12:10:01,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=366, Unknown=12, NotChecked=0, Total=462 [2025-02-06 12:10:01,695 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 1553 mSDsluCounter, 7808 mSDsCounter, 0 mSdLazyCounter, 5886 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 8808 SdHoareTripleChecker+Invalid, 5913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 5886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:01,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 8808 Invalid, 5913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 5886 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 12:10:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-02-06 12:10:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-02-06 12:10:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1035 states have (on average 1.6782608695652175) internal successors, (1737), 1502 states have internal predecessors, (1737), 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-02-06 12:10:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1767 transitions. [2025-02-06 12:10:01,716 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1767 transitions. Word has length 86 [2025-02-06 12:10:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:01,716 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1767 transitions. [2025-02-06 12:10:01,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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-02-06 12:10:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1767 transitions. [2025-02-06 12:10:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 12:10:01,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:01,717 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-02-06 12:10:01,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:10:01,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 12:10:01,918 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:01,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash 857374556, now seen corresponding path program 1 times [2025-02-06 12:10:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:01,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665863435] [2025-02-06 12:10:01,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:01,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:01,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:10:01,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:10:01,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:01,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:02,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665863435] [2025-02-06 12:10:02,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665863435] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510260015] [2025-02-06 12:10:02,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:02,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:10:02,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:10:02,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:10:02,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:10:02,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:10:02,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:10:02,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:02,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:02,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 12:10:02,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:10:02,656 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-02-06 12:10:02,664 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:10:02,664 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-02-06 12:10:02,672 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-02-06 12:10:02,676 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-02-06 12:10:02,722 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-02-06 12:10:02,725 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-02-06 12:10:02,809 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:02,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:10:02,817 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-02-06 12:10:02,843 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-02-06 12:10:02,846 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-02-06 12:10:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:02,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:10:02,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510260015] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:02,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:10:02,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-02-06 12:10:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107934320] [2025-02-06 12:10:02,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:10:02,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:10:02,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:02,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:10:02,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=249, Unknown=5, NotChecked=0, Total=306 [2025-02-06 12:10:02,983 INFO L87 Difference]: Start difference. First operand 1513 states and 1767 transitions. Second operand has 15 states, 12 states have (on average 8.75) internal successors, (105), 15 states have internal predecessors, (105), 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-02-06 12:10:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:06,340 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2025-02-06 12:10:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:10:06,341 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.75) internal successors, (105), 15 states have internal predecessors, (105), 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-02-06 12:10:06,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:06,343 INFO L225 Difference]: With dead ends: 1520 [2025-02-06 12:10:06,344 INFO L226 Difference]: Without dead ends: 1520 [2025-02-06 12:10:06,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=376, Unknown=5, NotChecked=0, Total=462 [2025-02-06 12:10:06,345 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 1566 mSDsluCounter, 6699 mSDsCounter, 0 mSdLazyCounter, 6947 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 7704 SdHoareTripleChecker+Invalid, 6976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:06,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 7704 Invalid, 6976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6947 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 12:10:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-02-06 12:10:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1511. [2025-02-06 12:10:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1034 states have (on average 1.6779497098646035) internal successors, (1735), 1500 states have internal predecessors, (1735), 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-02-06 12:10:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1759 transitions. [2025-02-06 12:10:06,360 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1759 transitions. Word has length 86 [2025-02-06 12:10:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:06,360 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1759 transitions. [2025-02-06 12:10:06,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.75) internal successors, (105), 15 states have internal predecessors, (105), 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-02-06 12:10:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1759 transitions. [2025-02-06 12:10:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 12:10:06,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:06,361 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-02-06 12:10:06,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:10:06,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 12:10:06,565 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:06,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:06,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1968895100, now seen corresponding path program 1 times [2025-02-06 12:10:06,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:06,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176832348] [2025-02-06 12:10:06,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:06,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:06,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 12:10:06,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 12:10:06,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:06,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:06,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:06,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176832348] [2025-02-06 12:10:06,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176832348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:10:06,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:10:06,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:10:06,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321820369] [2025-02-06 12:10:06,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:10:06,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:10:06,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:06,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:10:06,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:10:06,964 INFO L87 Difference]: Start difference. First operand 1511 states and 1759 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 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-02-06 12:10:09,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:09,113 INFO L93 Difference]: Finished difference Result 1524 states and 1778 transitions. [2025-02-06 12:10:09,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:10:09,114 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 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-02-06 12:10:09,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:09,119 INFO L225 Difference]: With dead ends: 1524 [2025-02-06 12:10:09,119 INFO L226 Difference]: Without dead ends: 1524 [2025-02-06 12:10:09,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:10:09,120 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 1559 mSDsluCounter, 7785 mSDsCounter, 0 mSdLazyCounter, 5883 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 8784 SdHoareTripleChecker+Invalid, 5909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:09,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 8784 Invalid, 5909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5883 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 12:10:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-02-06 12:10:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1520. [2025-02-06 12:10:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1042 states have (on average 1.6746641074856046) internal successors, (1745), 1508 states have internal predecessors, (1745), 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-02-06 12:10:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1770 transitions. [2025-02-06 12:10:09,137 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1770 transitions. Word has length 88 [2025-02-06 12:10:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:09,138 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1770 transitions. [2025-02-06 12:10:09,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 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-02-06 12:10:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1770 transitions. [2025-02-06 12:10:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 12:10:09,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:09,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, 1, 1, 1, 1, 1, 1] [2025-02-06 12:10:09,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:10:09,138 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:09,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1968895101, now seen corresponding path program 1 times [2025-02-06 12:10:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956553781] [2025-02-06 12:10:09,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:09,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 12:10:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 12:10:09,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:09,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:09,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956553781] [2025-02-06 12:10:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956553781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:10:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:10:09,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:10:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927569795] [2025-02-06 12:10:09,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:10:09,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:10:09,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:09,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:10:09,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:10:09,623 INFO L87 Difference]: Start difference. First operand 1520 states and 1770 transitions. Second operand has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 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-02-06 12:10:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:12,518 INFO L93 Difference]: Finished difference Result 1523 states and 1777 transitions. [2025-02-06 12:10:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:10:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 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-02-06 12:10:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:12,522 INFO L225 Difference]: With dead ends: 1523 [2025-02-06 12:10:12,522 INFO L226 Difference]: Without dead ends: 1523 [2025-02-06 12:10:12,522 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-02-06 12:10:12,522 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 1551 mSDsluCounter, 6681 mSDsCounter, 0 mSdLazyCounter, 6961 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 7687 SdHoareTripleChecker+Invalid, 6985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:12,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 7687 Invalid, 6985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6961 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-06 12:10:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-02-06 12:10:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1520. [2025-02-06 12:10:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1042 states have (on average 1.673704414587332) internal successors, (1744), 1508 states have internal predecessors, (1744), 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-02-06 12:10:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1769 transitions. [2025-02-06 12:10:12,543 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1769 transitions. Word has length 88 [2025-02-06 12:10:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:12,543 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1769 transitions. [2025-02-06 12:10:12,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 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-02-06 12:10:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1769 transitions. [2025-02-06 12:10:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 12:10:12,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:12,544 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-02-06 12:10:12,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:10:12,545 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:12,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash -123423516, now seen corresponding path program 1 times [2025-02-06 12:10:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:12,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105046582] [2025-02-06 12:10:12,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:12,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:10:12,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:10:12,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:12,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105046582] [2025-02-06 12:10:12,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105046582] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264424351] [2025-02-06 12:10:12,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:12,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:10:12,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:10:12,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:10:12,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:10:13,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:10:13,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:10:13,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:13,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:13,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 12:10:13,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:10:13,201 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:10:13,201 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-02-06 12:10:13,206 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-02-06 12:10:13,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:13,249 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-02-06 12:10:13,283 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:13,283 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-02-06 12:10:13,292 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-02-06 12:10:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:13,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:10:13,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-06 12:10:13,307 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:10:13,341 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-02-06 12:10:13,341 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-02-06 12:10:13,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_925 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_925))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-06 12:10:13,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264424351] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:13,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:10:13,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2025-02-06 12:10:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888657237] [2025-02-06 12:10:13,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:10:13,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 12:10:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:13,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 12:10:13,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342 [2025-02-06 12:10:13,347 INFO L87 Difference]: Start difference. First operand 1520 states and 1769 transitions. Second operand has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 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-02-06 12:10:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:16,226 INFO L93 Difference]: Finished difference Result 1522 states and 1776 transitions. [2025-02-06 12:10:16,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:10:16,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 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 89 [2025-02-06 12:10:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:16,229 INFO L225 Difference]: With dead ends: 1522 [2025-02-06 12:10:16,229 INFO L226 Difference]: Without dead ends: 1522 [2025-02-06 12:10:16,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2025-02-06 12:10:16,230 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 1562 mSDsluCounter, 9718 mSDsCounter, 0 mSdLazyCounter, 7146 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 10717 SdHoareTripleChecker+Invalid, 7172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:16,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 10717 Invalid, 7172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 7146 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-06 12:10:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-02-06 12:10:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1519. [2025-02-06 12:10:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1042 states have (on average 1.6727447216890594) internal successors, (1743), 1507 states have internal predecessors, (1743), 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-02-06 12:10:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1768 transitions. [2025-02-06 12:10:16,241 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1768 transitions. Word has length 89 [2025-02-06 12:10:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:16,241 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1768 transitions. [2025-02-06 12:10:16,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 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-02-06 12:10:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1768 transitions. [2025-02-06 12:10:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 12:10:16,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:16,242 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-02-06 12:10:16,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:10:16,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:10:16,442 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:16,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash -123423515, now seen corresponding path program 1 times [2025-02-06 12:10:16,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:16,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741083727] [2025-02-06 12:10:16,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:16,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:16,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:10:16,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:10:16,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:16,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741083727] [2025-02-06 12:10:16,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741083727] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795449141] [2025-02-06 12:10:16,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:16,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:10:16,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:10:16,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:10:16,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:10:17,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:10:17,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:10:17,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:17,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:17,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 12:10:17,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:10:17,187 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:10:17,187 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-02-06 12:10:17,192 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-02-06 12:10:17,198 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-02-06 12:10:17,202 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-02-06 12:10:17,238 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-02-06 12:10:17,241 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-02-06 12:10:17,316 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:17,317 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-02-06 12:10:17,322 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-02-06 12:10:17,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:17,376 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-02-06 12:10:17,381 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-02-06 12:10:17,396 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-02-06 12:10:17,400 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-02-06 12:10:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:17,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:10:17,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1066 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1065 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:10:17,461 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1065 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1066 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-02-06 12:10:17,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1071) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1072))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1071) .cse1 v_ArrVal_1066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:10:17,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795449141] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:17,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:10:17,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2025-02-06 12:10:17,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112526883] [2025-02-06 12:10:17,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:10:17,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 12:10:17,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:17,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 12:10:17,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2025-02-06 12:10:17,505 INFO L87 Difference]: Start difference. First operand 1519 states and 1768 transitions. Second operand has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 16 states have internal predecessors, (109), 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-02-06 12:10:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:19,940 INFO L93 Difference]: Finished difference Result 1521 states and 1775 transitions. [2025-02-06 12:10:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:10:19,940 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 16 states have internal predecessors, (109), 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-02-06 12:10:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:19,945 INFO L225 Difference]: With dead ends: 1521 [2025-02-06 12:10:19,945 INFO L226 Difference]: Without dead ends: 1521 [2025-02-06 12:10:19,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=3, NotChecked=132, Total=650 [2025-02-06 12:10:19,946 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 1554 mSDsluCounter, 5930 mSDsCounter, 0 mSdLazyCounter, 6125 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 6934 SdHoareTripleChecker+Invalid, 6165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 6125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:19,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 6934 Invalid, 6165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 6125 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 12:10:19,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-02-06 12:10:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1509. [2025-02-06 12:10:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1034 states have (on average 1.6760154738878144) internal successors, (1733), 1498 states have internal predecessors, (1733), 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-02-06 12:10:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1757 transitions. [2025-02-06 12:10:19,975 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1757 transitions. Word has length 89 [2025-02-06 12:10:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:19,975 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1757 transitions. [2025-02-06 12:10:19,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 16 states have internal predecessors, (109), 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-02-06 12:10:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1757 transitions. [2025-02-06 12:10:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 12:10:19,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:19,976 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-02-06 12:10:19,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:10:20,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:10:20,176 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:20,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1012726532, now seen corresponding path program 1 times [2025-02-06 12:10:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315217915] [2025-02-06 12:10:20,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:20,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 12:10:20,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 12:10:20,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:20,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:20,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-02-06 12:10:20,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:20,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315217915] [2025-02-06 12:10:20,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315217915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:10:20,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:10:20,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 12:10:20,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51679493] [2025-02-06 12:10:20,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:10:20,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:10:20,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:20,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:10:20,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:10:20,514 INFO L87 Difference]: Start difference. First operand 1509 states and 1757 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 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-02-06 12:10:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:23,396 INFO L93 Difference]: Finished difference Result 1525 states and 1779 transitions. [2025-02-06 12:10:23,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:10:23,396 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 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-02-06 12:10:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:23,398 INFO L225 Difference]: With dead ends: 1525 [2025-02-06 12:10:23,398 INFO L226 Difference]: Without dead ends: 1525 [2025-02-06 12:10:23,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:10:23,399 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1558 mSDsluCounter, 8754 mSDsCounter, 0 mSdLazyCounter, 6545 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 9752 SdHoareTripleChecker+Invalid, 6571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:23,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 9752 Invalid, 6571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6545 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-06 12:10:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2025-02-06 12:10:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1521. [2025-02-06 12:10:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1045 states have (on average 1.6708133971291865) internal successors, (1746), 1509 states have internal predecessors, (1746), 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-02-06 12:10:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1771 transitions. [2025-02-06 12:10:23,408 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1771 transitions. Word has length 91 [2025-02-06 12:10:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:23,409 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 1771 transitions. [2025-02-06 12:10:23,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 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-02-06 12:10:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1771 transitions. [2025-02-06 12:10:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 12:10:23,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:23,409 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-02-06 12:10:23,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:10:23,409 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:23,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1012726531, now seen corresponding path program 1 times [2025-02-06 12:10:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:23,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553065765] [2025-02-06 12:10:23,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:23,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:23,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 12:10:23,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 12:10:23,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:23,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:23,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:23,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553065765] [2025-02-06 12:10:23,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553065765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:10:23,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:10:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 12:10:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440742555] [2025-02-06 12:10:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:10:23,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:10:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:23,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:10:23,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:10:23,876 INFO L87 Difference]: Start difference. First operand 1521 states and 1771 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 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-02-06 12:10:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:27,092 INFO L93 Difference]: Finished difference Result 1524 states and 1778 transitions. [2025-02-06 12:10:27,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:10:27,092 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 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-02-06 12:10:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:27,095 INFO L225 Difference]: With dead ends: 1524 [2025-02-06 12:10:27,095 INFO L226 Difference]: Without dead ends: 1524 [2025-02-06 12:10:27,095 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-02-06 12:10:27,096 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 1552 mSDsluCounter, 6486 mSDsCounter, 0 mSdLazyCounter, 7168 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 7491 SdHoareTripleChecker+Invalid, 7192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:27,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 7491 Invalid, 7192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7168 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-06 12:10:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-02-06 12:10:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1521. [2025-02-06 12:10:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1045 states have (on average 1.6698564593301435) internal successors, (1745), 1509 states have internal predecessors, (1745), 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-02-06 12:10:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1770 transitions. [2025-02-06 12:10:27,127 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1770 transitions. Word has length 91 [2025-02-06 12:10:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:27,127 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 1770 transitions. [2025-02-06 12:10:27,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 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-02-06 12:10:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1770 transitions. [2025-02-06 12:10:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 12:10:27,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:27,128 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-02-06 12:10:27,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:10:27,128 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:27,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -416248940, now seen corresponding path program 1 times [2025-02-06 12:10:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:27,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766365668] [2025-02-06 12:10:27,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:27,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:10:27,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:10:27,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:27,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:27,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:27,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766365668] [2025-02-06 12:10:27,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766365668] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:27,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610258738] [2025-02-06 12:10:27,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:27,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:10:27,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:10:27,710 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:10:27,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:10:27,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:10:27,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:10:27,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:27,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:27,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 12:10:27,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:10:28,001 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:10:28,002 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-02-06 12:10:28,007 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-02-06 12:10:28,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:28,067 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-02-06 12:10:28,103 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:28,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 42 treesize of output 41 [2025-02-06 12:10:28,158 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:28,158 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-02-06 12:10:28,165 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-02-06 12:10:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:28,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:10:28,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1353 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1353) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:10:28,293 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-02-06 12:10:28,294 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-02-06 12:10:28,298 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1353 (Array Int Int)) (v_ArrVal_1352 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1356))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1352)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1353)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-06 12:10:28,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610258738] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:28,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:10:28,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2025-02-06 12:10:28,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199785045] [2025-02-06 12:10:28,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:10:28,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:10:28,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:28,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:10:28,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=373, Unknown=26, NotChecked=82, Total=552 [2025-02-06 12:10:28,301 INFO L87 Difference]: Start difference. First operand 1521 states and 1770 transitions. Second operand has 19 states, 17 states have (on average 6.764705882352941) internal successors, (115), 19 states have internal predecessors, (115), 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-02-06 12:10:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:30,767 INFO L93 Difference]: Finished difference Result 1523 states and 1777 transitions. [2025-02-06 12:10:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:10:30,768 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.764705882352941) internal successors, (115), 19 states have internal predecessors, (115), 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-02-06 12:10:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:30,770 INFO L225 Difference]: With dead ends: 1523 [2025-02-06 12:10:30,773 INFO L226 Difference]: Without dead ends: 1523 [2025-02-06 12:10:30,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=710, Unknown=30, NotChecked=114, Total=992 [2025-02-06 12:10:30,774 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1547 mSDsluCounter, 9733 mSDsCounter, 0 mSdLazyCounter, 7175 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 10731 SdHoareTripleChecker+Invalid, 7202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:30,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 10731 Invalid, 7202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 7175 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 12:10:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-02-06 12:10:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1520. [2025-02-06 12:10:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1045 states have (on average 1.6688995215311004) internal successors, (1744), 1508 states have internal predecessors, (1744), 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-02-06 12:10:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1769 transitions. [2025-02-06 12:10:30,788 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1769 transitions. Word has length 92 [2025-02-06 12:10:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:30,788 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1769 transitions. [2025-02-06 12:10:30,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.764705882352941) internal successors, (115), 19 states have internal predecessors, (115), 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-02-06 12:10:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1769 transitions. [2025-02-06 12:10:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 12:10:30,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:30,789 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-02-06 12:10:30,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:10:30,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 12:10:30,990 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:30,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash -416248939, now seen corresponding path program 1 times [2025-02-06 12:10:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447057957] [2025-02-06 12:10:30,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:31,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:10:31,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:10:31,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:31,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:31,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:31,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447057957] [2025-02-06 12:10:31,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447057957] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:31,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185607381] [2025-02-06 12:10:31,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:31,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:10:31,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:10:31,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:10:31,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:10:31,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:10:31,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:10:31,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:31,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:31,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 12:10:31,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:10:31,930 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-02-06 12:10:31,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:10:31,939 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-02-06 12:10:31,959 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-02-06 12:10:31,961 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-02-06 12:10:32,017 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-02-06 12:10:32,020 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-02-06 12:10:32,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:32,088 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-02-06 12:10:32,092 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-02-06 12:10:32,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:32,143 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-02-06 12:10:32,146 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-02-06 12:10:32,186 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:32,186 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-02-06 12:10:32,190 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-02-06 12:10:32,201 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-02-06 12:10:32,205 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-02-06 12:10:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:32,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:10:32,343 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1511 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1510 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-06 12:10:32,355 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1508 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1509) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1508 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1508))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1509) .cse1 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:10:32,364 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1508 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1509) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1508 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1508))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1509) .cse2 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-02-06 12:10:32,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1508 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1517))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1508))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1516) .cse0 v_ArrVal_1509) .cse1 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1508 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1517))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1516) .cse5 v_ArrVal_1509) (select (select (store .cse6 .cse5 v_ArrVal_1508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1511))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-02-06 12:10:32,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185607381] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:32,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:10:32,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2025-02-06 12:10:32,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466501963] [2025-02-06 12:10:32,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:10:32,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:10:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:32,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:10:32,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=507, Unknown=19, NotChecked=196, Total=812 [2025-02-06 12:10:32,408 INFO L87 Difference]: Start difference. First operand 1520 states and 1769 transitions. Second operand has 22 states, 19 states have (on average 6.473684210526316) internal successors, (123), 22 states have internal predecessors, (123), 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-02-06 12:10:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:37,202 INFO L93 Difference]: Finished difference Result 1522 states and 1776 transitions. [2025-02-06 12:10:37,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:10:37,203 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.473684210526316) internal successors, (123), 22 states have internal predecessors, (123), 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 92 [2025-02-06 12:10:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:37,205 INFO L225 Difference]: With dead ends: 1522 [2025-02-06 12:10:37,205 INFO L226 Difference]: Without dead ends: 1522 [2025-02-06 12:10:37,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=780, Unknown=22, NotChecked=244, Total=1190 [2025-02-06 12:10:37,206 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 1564 mSDsluCounter, 8972 mSDsCounter, 0 mSdLazyCounter, 9562 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 9975 SdHoareTripleChecker+Invalid, 9590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:37,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 9975 Invalid, 9590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9562 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-06 12:10:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-02-06 12:10:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1507. [2025-02-06 12:10:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1034 states have (on average 1.6740812379110253) internal successors, (1731), 1496 states have internal predecessors, (1731), 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-02-06 12:10:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1755 transitions. [2025-02-06 12:10:37,217 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1755 transitions. Word has length 92 [2025-02-06 12:10:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:37,217 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1755 transitions. [2025-02-06 12:10:37,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.473684210526316) internal successors, (123), 22 states have internal predecessors, (123), 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-02-06 12:10:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1755 transitions. [2025-02-06 12:10:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:10:37,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:37,218 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] [2025-02-06 12:10:37,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 12:10:37,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 12:10:37,419 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:37,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2010843477, now seen corresponding path program 1 times [2025-02-06 12:10:37,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:37,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959908197] [2025-02-06 12:10:37,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:37,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:10:37,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:10:37,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:37,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:37,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:37,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959908197] [2025-02-06 12:10:37,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959908197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:10:37,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:10:37,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 12:10:37,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51744497] [2025-02-06 12:10:37,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:10:37,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 12:10:37,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:37,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 12:10:37,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:10:37,856 INFO L87 Difference]: Start difference. First operand 1507 states and 1755 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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-02-06 12:10:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:40,302 INFO L93 Difference]: Finished difference Result 1526 states and 1780 transitions. [2025-02-06 12:10:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:10:40,302 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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 94 [2025-02-06 12:10:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:40,308 INFO L225 Difference]: With dead ends: 1526 [2025-02-06 12:10:40,308 INFO L226 Difference]: Without dead ends: 1526 [2025-02-06 12:10:40,308 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-02-06 12:10:40,310 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 1576 mSDsluCounter, 7778 mSDsCounter, 0 mSdLazyCounter, 5879 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 8775 SdHoareTripleChecker+Invalid, 5905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:40,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 8775 Invalid, 5905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5879 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 12:10:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2025-02-06 12:10:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1522. [2025-02-06 12:10:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1048 states have (on average 1.6669847328244274) internal successors, (1747), 1510 states have internal predecessors, (1747), 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-02-06 12:10:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 1772 transitions. [2025-02-06 12:10:40,322 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 1772 transitions. Word has length 94 [2025-02-06 12:10:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:40,323 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 1772 transitions. [2025-02-06 12:10:40,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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-02-06 12:10:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1772 transitions. [2025-02-06 12:10:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:10:40,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:40,324 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] [2025-02-06 12:10:40,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 12:10:40,324 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:40,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2010843478, now seen corresponding path program 1 times [2025-02-06 12:10:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:40,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375465482] [2025-02-06 12:10:40,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:40,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:10:40,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:10:40,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:40,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:40,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375465482] [2025-02-06 12:10:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375465482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:10:40,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:10:40,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:10:40,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163937251] [2025-02-06 12:10:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:10:40,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:10:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:40,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:10:40,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:10:40,836 INFO L87 Difference]: Start difference. First operand 1522 states and 1772 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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-02-06 12:10:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:43,755 INFO L93 Difference]: Finished difference Result 1525 states and 1779 transitions. [2025-02-06 12:10:43,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:10:43,755 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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 94 [2025-02-06 12:10:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:43,757 INFO L225 Difference]: With dead ends: 1525 [2025-02-06 12:10:43,757 INFO L226 Difference]: Without dead ends: 1525 [2025-02-06 12:10:43,757 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-02-06 12:10:43,758 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 1554 mSDsluCounter, 5734 mSDsCounter, 0 mSdLazyCounter, 6294 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 6738 SdHoareTripleChecker+Invalid, 6318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:43,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 6738 Invalid, 6318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6294 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-06 12:10:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2025-02-06 12:10:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1522. [2025-02-06 12:10:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1048 states have (on average 1.666030534351145) internal successors, (1746), 1510 states have internal predecessors, (1746), 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-02-06 12:10:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 1771 transitions. [2025-02-06 12:10:43,767 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 1771 transitions. Word has length 94 [2025-02-06 12:10:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:43,767 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 1771 transitions. [2025-02-06 12:10:43,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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-02-06 12:10:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1771 transitions. [2025-02-06 12:10:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:10:43,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:43,768 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-02-06 12:10:43,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 12:10:43,768 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:43,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:43,769 INFO L85 PathProgramCache]: Analyzing trace with hash -899884099, now seen corresponding path program 1 times [2025-02-06 12:10:43,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:43,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500196060] [2025-02-06 12:10:43,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:43,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:43,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:10:43,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:10:43,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:43,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:44,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500196060] [2025-02-06 12:10:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500196060] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:44,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68603899] [2025-02-06 12:10:44,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:44,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:10:44,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:10:44,183 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:10:44,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:10:44,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:10:44,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:10:44,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:44,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:44,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 12:10:44,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:10:44,456 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:10:44,456 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-02-06 12:10:44,459 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-02-06 12:10:44,527 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:44,527 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-02-06 12:10:44,554 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:44,554 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-02-06 12:10:44,580 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:44,580 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-02-06 12:10:44,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:44,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 42 treesize of output 41 [2025-02-06 12:10:44,616 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-02-06 12:10:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:44,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:10:44,627 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1823 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1823) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-06 12:10:44,651 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1823 (Array Int Int)) (v_ArrVal_1822 (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$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1822))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1823)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:10:44,655 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1823 (Array Int Int)) (v_ArrVal_1822 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1822))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1823)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:10:44,661 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1823 (Array Int Int)) (v_ArrVal_1822 (Array Int Int)) (v_ArrVal_1821 (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$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1821))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1822)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1823)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:10:44,712 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-02-06 12:10:44,712 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-02-06 12:10:44,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1823 (Array Int Int)) (v_ArrVal_1822 (Array Int Int)) (v_ArrVal_1821 (Array Int Int)) (v_ArrVal_1826 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1826))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1821)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1822)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1823)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-02-06 12:10:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68603899] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:44,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:10:44,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 20 [2025-02-06 12:10:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443501457] [2025-02-06 12:10:44,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:10:44,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 12:10:44,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:44,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 12:10:44,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=424, Unknown=12, NotChecked=230, Total=756 [2025-02-06 12:10:44,718 INFO L87 Difference]: Start difference. First operand 1522 states and 1771 transitions. Second operand has 21 states, 19 states have (on average 6.315789473684211) internal successors, (120), 21 states have internal predecessors, (120), 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-02-06 12:10:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:48,124 INFO L93 Difference]: Finished difference Result 1524 states and 1778 transitions. [2025-02-06 12:10:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:10:48,124 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.315789473684211) internal successors, (120), 21 states have internal predecessors, (120), 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 95 [2025-02-06 12:10:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:48,126 INFO L225 Difference]: With dead ends: 1524 [2025-02-06 12:10:48,126 INFO L226 Difference]: Without dead ends: 1524 [2025-02-06 12:10:48,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=828, Unknown=12, NotChecked=320, Total=1332 [2025-02-06 12:10:48,127 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 1560 mSDsluCounter, 12640 mSDsCounter, 0 mSdLazyCounter, 9046 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 13637 SdHoareTripleChecker+Invalid, 9072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 9046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:48,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 13637 Invalid, 9072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 9046 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 12:10:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-02-06 12:10:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1521. [2025-02-06 12:10:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1048 states have (on average 1.6650763358778626) internal successors, (1745), 1509 states have internal predecessors, (1745), 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-02-06 12:10:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1770 transitions. [2025-02-06 12:10:48,136 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1770 transitions. Word has length 95 [2025-02-06 12:10:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:48,136 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 1770 transitions. [2025-02-06 12:10:48,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.315789473684211) internal successors, (120), 21 states have internal predecessors, (120), 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-02-06 12:10:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1770 transitions. [2025-02-06 12:10:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:10:48,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:48,137 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-02-06 12:10:48,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:10:48,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:10:48,338 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:48,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash -899884098, now seen corresponding path program 1 times [2025-02-06 12:10:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:48,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672800107] [2025-02-06 12:10:48,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:48,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:48,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:10:48,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:10:48,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:48,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:48,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:48,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672800107] [2025-02-06 12:10:48,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672800107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:48,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755873723] [2025-02-06 12:10:48,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:48,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:10:48,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:10:48,840 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:10:48,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:10:49,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:10:49,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:10:49,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:49,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:49,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 12:10:49,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:10:49,107 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-02-06 12:10:49,112 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:10:49,112 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-02-06 12:10:49,127 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-02-06 12:10:49,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:10:49,198 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-02-06 12:10:49,201 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-02-06 12:10:49,313 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:49,313 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-02-06 12:10:49,317 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-02-06 12:10:49,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:49,382 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-02-06 12:10:49,388 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-02-06 12:10:49,439 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:49,439 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-02-06 12:10:49,446 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-02-06 12:10:49,480 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:10:49,480 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-02-06 12:10:49,484 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-02-06 12:10:49,493 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-02-06 12:10:49,496 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-02-06 12:10:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:49,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:10:49,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1994 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1995 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-02-06 12:10:49,552 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1994 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1995 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2025-02-06 12:10:49,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1993) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1992))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1993) .cse1 v_ArrVal_1995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:10:49,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1990))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1992))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1991) .cse0 v_ArrVal_1993) .cse1 v_ArrVal_1995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1990))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1991) .cse5 v_ArrVal_1993) (select (select (store .cse6 .cse5 v_ArrVal_1992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1995))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-02-06 12:10:49,664 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1990))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1992))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1991) .cse1 v_ArrVal_1993) .cse2 v_ArrVal_1995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1990))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1991) .cse6 v_ArrVal_1993) (select (select (store .cse7 .cse6 v_ArrVal_1992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1995))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-02-06 12:10:49,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_1990 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2001))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1990))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2000) .cse0 v_ArrVal_1991) .cse1 v_ArrVal_1993) (select (select (store .cse2 .cse1 v_ArrVal_1992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1995))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_1990 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2001))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1990))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1992))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2000) .cse5 v_ArrVal_1991) .cse6 v_ArrVal_1993) .cse7 v_ArrVal_1995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1994) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2025-02-06 12:10:49,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755873723] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:10:49,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:10:49,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2025-02-06 12:10:49,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402465987] [2025-02-06 12:10:49,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:10:49,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:10:49,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:49,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:10:49,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=606, Unknown=9, NotChecked=330, Total=1056 [2025-02-06 12:10:49,729 INFO L87 Difference]: Start difference. First operand 1521 states and 1770 transitions. Second operand has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 24 states have internal predecessors, (129), 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-02-06 12:10:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:54,374 INFO L93 Difference]: Finished difference Result 1523 states and 1777 transitions. [2025-02-06 12:10:54,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:10:54,375 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 24 states have internal predecessors, (129), 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 95 [2025-02-06 12:10:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:54,377 INFO L225 Difference]: With dead ends: 1523 [2025-02-06 12:10:54,377 INFO L226 Difference]: Without dead ends: 1523 [2025-02-06 12:10:54,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=957, Unknown=9, NotChecked=414, Total=1560 [2025-02-06 12:10:54,377 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 1563 mSDsluCounter, 11436 mSDsCounter, 0 mSdLazyCounter, 11913 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 12438 SdHoareTripleChecker+Invalid, 11944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 11913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:54,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 12438 Invalid, 11944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 11913 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-06 12:10:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-02-06 12:10:54,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1505. [2025-02-06 12:10:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1034 states have (on average 1.672147001934236) internal successors, (1729), 1494 states have internal predecessors, (1729), 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-02-06 12:10:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1753 transitions. [2025-02-06 12:10:54,388 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1753 transitions. Word has length 95 [2025-02-06 12:10:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:54,388 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1753 transitions. [2025-02-06 12:10:54,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 24 states have internal predecessors, (129), 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-02-06 12:10:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1753 transitions. [2025-02-06 12:10:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:10:54,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:54,389 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, 1, 1, 1] [2025-02-06 12:10:54,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:10:54,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 12:10:54,590 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr597REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:54,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1728115121, now seen corresponding path program 1 times [2025-02-06 12:10:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:54,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362488809] [2025-02-06 12:10:54,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:54,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:10:54,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:10:54,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:54,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:55,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:55,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362488809] [2025-02-06 12:10:55,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362488809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:10:55,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:10:55,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 12:10:55,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478718160] [2025-02-06 12:10:55,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:10:55,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 12:10:55,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:55,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 12:10:55,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-06 12:10:55,075 INFO L87 Difference]: Start difference. First operand 1505 states and 1753 transitions. Second operand has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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-02-06 12:10:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:10:57,528 INFO L93 Difference]: Finished difference Result 1528 states and 1782 transitions. [2025-02-06 12:10:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:10:57,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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 98 [2025-02-06 12:10:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:10:57,530 INFO L225 Difference]: With dead ends: 1528 [2025-02-06 12:10:57,530 INFO L226 Difference]: Without dead ends: 1528 [2025-02-06 12:10:57,531 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-02-06 12:10:57,531 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1561 mSDsluCounter, 8783 mSDsCounter, 0 mSdLazyCounter, 6537 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 9779 SdHoareTripleChecker+Invalid, 6565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 6537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:10:57,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 9779 Invalid, 6565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 6537 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 12:10:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-02-06 12:10:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1524. [2025-02-06 12:10:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1052 states have (on average 1.6625475285171103) internal successors, (1749), 1512 states have internal predecessors, (1749), 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-02-06 12:10:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1774 transitions. [2025-02-06 12:10:57,560 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1774 transitions. Word has length 98 [2025-02-06 12:10:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:10:57,561 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 1774 transitions. [2025-02-06 12:10:57,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 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-02-06 12:10:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1774 transitions. [2025-02-06 12:10:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:10:57,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:10:57,561 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, 1, 1, 1] [2025-02-06 12:10:57,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 12:10:57,561 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:10:57,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:10:57,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1728115120, now seen corresponding path program 1 times [2025-02-06 12:10:57,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:10:57,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947496027] [2025-02-06 12:10:57,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:10:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:10:57,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:10:57,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:10:57,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:10:57,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:10:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:10:58,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:10:58,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947496027] [2025-02-06 12:10:58,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947496027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:10:58,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:10:58,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 12:10:58,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335014613] [2025-02-06 12:10:58,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:10:58,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:10:58,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:10:58,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:10:58,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-06 12:10:58,407 INFO L87 Difference]: Start difference. First operand 1524 states and 1774 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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-02-06 12:11:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:01,807 INFO L93 Difference]: Finished difference Result 1527 states and 1781 transitions. [2025-02-06 12:11:01,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:11:01,808 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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 98 [2025-02-06 12:11:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:01,810 INFO L225 Difference]: With dead ends: 1527 [2025-02-06 12:11:01,810 INFO L226 Difference]: Without dead ends: 1527 [2025-02-06 12:11:01,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:11:01,811 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 1555 mSDsluCounter, 6690 mSDsCounter, 0 mSdLazyCounter, 6998 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 7687 SdHoareTripleChecker+Invalid, 7027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:01,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 7687 Invalid, 7027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6998 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 12:11:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-02-06 12:11:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1524. [2025-02-06 12:11:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1052 states have (on average 1.661596958174905) internal successors, (1748), 1512 states have internal predecessors, (1748), 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-02-06 12:11:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1773 transitions. [2025-02-06 12:11:01,823 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1773 transitions. Word has length 98 [2025-02-06 12:11:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:01,823 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 1773 transitions. [2025-02-06 12:11:01,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 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-02-06 12:11:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1773 transitions. [2025-02-06 12:11:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:11:01,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:01,824 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, 1, 1, 1, 1] [2025-02-06 12:11:01,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 12:11:01,824 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr597REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:11:01,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1476488375, now seen corresponding path program 1 times [2025-02-06 12:11:01,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652862096] [2025-02-06 12:11:01,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:01,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:11:01,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:11:01,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:01,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:02,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652862096] [2025-02-06 12:11:02,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652862096] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:02,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503186355] [2025-02-06 12:11:02,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:02,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:02,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:11:02,329 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:11:02,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:11:02,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:11:02,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:11:02,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:02,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:02,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 12:11:02,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:11:02,621 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:11:02,622 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-02-06 12:11:02,625 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-02-06 12:11:02,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:02,658 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-02-06 12:11:02,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:02,674 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-02-06 12:11:02,705 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:02,706 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-02-06 12:11:02,737 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:02,737 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-02-06 12:11:02,768 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:02,769 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-02-06 12:11:02,775 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-02-06 12:11:02,787 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 12:11:02,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:11:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:02,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:11:03,223 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-02-06 12:11:03,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2025-02-06 12:11:03,236 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2339 (Array Int Int)) (v_ArrVal_2338 (Array Int Int)) (v_ArrVal_2337 (Array Int Int)) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2340 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2344))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2337)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2338)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2339)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2340)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-06 12:11:03,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503186355] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:03,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:11:03,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 20 [2025-02-06 12:11:03,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343459119] [2025-02-06 12:11:03,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:11:03,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 12:11:03,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:11:03,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 12:11:03,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=752, Unknown=47, NotChecked=58, Total=992 [2025-02-06 12:11:03,239 INFO L87 Difference]: Start difference. First operand 1524 states and 1773 transitions. Second operand has 21 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 20 states have internal predecessors, (118), 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-02-06 12:11:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:11:05,731 INFO L93 Difference]: Finished difference Result 1526 states and 1780 transitions. [2025-02-06 12:11:05,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 12:11:05,731 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 20 states have internal predecessors, (118), 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 99 [2025-02-06 12:11:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:11:05,733 INFO L225 Difference]: With dead ends: 1526 [2025-02-06 12:11:05,733 INFO L226 Difference]: Without dead ends: 1526 [2025-02-06 12:11:05,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=1343, Unknown=47, NotChecked=78, Total=1722 [2025-02-06 12:11:05,733 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1546 mSDsluCounter, 7777 mSDsCounter, 0 mSdLazyCounter, 5908 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 8773 SdHoareTripleChecker+Invalid, 5936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:11:05,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 8773 Invalid, 5936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 5908 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 12:11:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2025-02-06 12:11:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1523. [2025-02-06 12:11:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1052 states have (on average 1.6606463878326996) internal successors, (1747), 1511 states have internal predecessors, (1747), 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-02-06 12:11:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1772 transitions. [2025-02-06 12:11:05,767 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1772 transitions. Word has length 99 [2025-02-06 12:11:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:11:05,771 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 1772 transitions. [2025-02-06 12:11:05,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 20 states have internal predecessors, (118), 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-02-06 12:11:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1772 transitions. [2025-02-06 12:11:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:11:05,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:11:05,771 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, 1, 1, 1, 1] [2025-02-06 12:11:05,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 12:11:05,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:05,972 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:11:05,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:11:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1476488376, now seen corresponding path program 1 times [2025-02-06 12:11:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:11:05,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891400813] [2025-02-06 12:11:05,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:05,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:11:06,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:11:06,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:11:06,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:06,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:11:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891400813] [2025-02-06 12:11:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891400813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:11:06,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456502135] [2025-02-06 12:11:06,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:11:06,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:11:06,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:11:06,788 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:11:06,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:11:06,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:11:07,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:11:07,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:11:07,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:11:07,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-06 12:11:07,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:11:07,149 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-02-06 12:11:07,178 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:11:07,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:11:07,250 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-02-06 12:11:07,256 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-02-06 12:11:07,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-02-06 12:11:07,398 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-02-06 12:11:07,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:07,556 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 73 treesize of output 66 [2025-02-06 12:11:07,560 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-02-06 12:11:07,663 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:07,663 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 73 treesize of output 66 [2025-02-06 12:11:07,669 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-02-06 12:11:07,731 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:07,732 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 73 treesize of output 66 [2025-02-06 12:11:07,737 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-02-06 12:11:07,805 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:07,805 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 73 treesize of output 66 [2025-02-06 12:11:07,811 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-02-06 12:11:07,870 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:11:07,870 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 73 treesize of output 66 [2025-02-06 12:11:07,876 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-02-06 12:11:07,891 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 42 treesize of output 18 [2025-02-06 12:11:07,895 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-02-06 12:11:07,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:11:07,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:11:07,943 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-06 12:11:07,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-06 12:11:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:11:07,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:11:09,561 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2531 (Array Int Int)) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2525))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2527))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2526) .cse1 v_ArrVal_2528) .cse2 v_ArrVal_2530) (select (select (store .cse3 .cse2 v_ArrVal_2529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2531))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2532 (Array Int Int)) (v_ArrVal_2531 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2530 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2533 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2525))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2527))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2529))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2526) .cse6 v_ArrVal_2528) .cse7 v_ArrVal_2530) .cse8 v_ArrVal_2531) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2533) (select (select (store .cse9 .cse8 v_ArrVal_2532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false