./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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_SAX_nondet_test2-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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:01:00,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:01:00,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:01:00,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:01:00,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:01:00,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:01:00,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:01:00,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:01:00,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:01:00,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:01:00,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:01:00,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:01:00,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:01:00,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:01:00,169 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:01:00,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:01:00,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:01:00,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:01:00,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:01:00,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:01:00,170 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:01:00,170 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:01:00,170 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:01:00,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:01:00,171 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:01:00,171 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:01:00,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:01:00,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:01:00,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:01:00,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:01:00,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:01:00,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:01:00,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:01:00,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:01:00,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:01:00,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:01:00,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:01:00,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:01:00,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:01:00,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:01:00,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:01:00,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:01:00,173 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-02-08 08:01:00,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:01:00,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:01:00,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:01:00,453 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:01:00,454 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:01:00,455 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_SAX_nondet_test2-1.i [2025-02-08 08:01:01,828 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d5613543/cc21974306f24001a52e05dc554e8296/FLAG37eb64d05 [2025-02-08 08:01:02,239 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:01:02,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2025-02-08 08:01:02,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d5613543/cc21974306f24001a52e05dc554e8296/FLAG37eb64d05 [2025-02-08 08:01:02,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d5613543/cc21974306f24001a52e05dc554e8296 [2025-02-08 08:01:02,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:01:02,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:01:02,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:01:02,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:01:02,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:01:02,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:02,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd67ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02, skipping insertion in model container [2025-02-08 08:01:02,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:02,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:01:02,690 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-08 08:01:02,727 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-08 08:01:02,731 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-08 08:01:02,739 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-08 08:01:02,751 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-08 08:01:02,780 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-08 08:01:02,781 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-08 08:01:02,783 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-08 08:01:02,783 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-08 08:01:02,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:01:02,809 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:01:02,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:01:02,970 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:01:02,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02 WrapperNode [2025-02-08 08:01:02,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:01:02,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:01:02,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:01:02,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:01:02,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,051 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1251 [2025-02-08 08:01:03,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:01:03,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:01:03,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:01:03,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:01:03,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,144 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-02-08 08:01:03,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:01:03,204 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:01:03,204 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:01:03,204 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:01:03,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (1/1) ... [2025-02-08 08:01:03,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:01:03,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:03,235 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-08 08:01:03,237 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-08 08:01:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 08:01:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 08:01:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 08:01:03,259 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 08:01:03,259 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 08:01:03,259 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 08:01:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:01:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:01:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:01:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:01:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:01:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:01:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:01:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:01:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:01:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:01:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:01:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:01:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:01:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:01:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:01:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:01:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:01:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:01:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:01:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:01:03,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:01:03,460 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:01:03,462 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:01:05,179 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 08:01:05,285 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2025-02-08 08:01:05,286 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:01:05,366 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:01:05,366 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 08:01:05,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:01:05 BoogieIcfgContainer [2025-02-08 08:01:05,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:01:05,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:01:05,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:01:05,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:01:05,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:01:02" (1/3) ... [2025-02-08 08:01:05,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410cb03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:01:05, skipping insertion in model container [2025-02-08 08:01:05,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:02" (2/3) ... [2025-02-08 08:01:05,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410cb03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:01:05, skipping insertion in model container [2025-02-08 08:01:05,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:01:05" (3/3) ... [2025-02-08 08:01:05,384 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-1.i [2025-02-08 08:01:05,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:01:05,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test2-1.i that has 4 procedures, 1071 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2025-02-08 08:01:05,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:01:05,463 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;@425ec9f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:01:05,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2025-02-08 08:01:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 1061 states, 639 states have (on average 1.9953051643192488) internal successors, (1275), 1056 states have internal predecessors, (1275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 08:01:05,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:05,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 08:01:05,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:05,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1351089, now seen corresponding path program 1 times [2025-02-08 08:01:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:05,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944643001] [2025-02-08 08:01:05,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:05,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:05,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:01:05,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:01:05,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:05,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:01:05,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:05,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944643001] [2025-02-08 08:01:05,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944643001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:05,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:05,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:01:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844993428] [2025-02-08 08:01:05,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:05,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:05,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:05,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:05,744 INFO L87 Difference]: Start difference. First operand has 1061 states, 639 states have (on average 1.9953051643192488) internal successors, (1275), 1056 states have internal predecessors, (1275), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-08 08:01:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:06,807 INFO L93 Difference]: Finished difference Result 1362 states and 1615 transitions. [2025-02-08 08:01:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:01:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-08 08:01:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:06,827 INFO L225 Difference]: With dead ends: 1362 [2025-02-08 08:01:06,827 INFO L226 Difference]: Without dead ends: 1358 [2025-02-08 08:01:06,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:06,834 INFO L435 NwaCegarLoop]: 1065 mSDtfsCounter, 387 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:06,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2551 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 08:01:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-02-08 08:01:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1273. [2025-02-08 08:01:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 857 states have (on average 1.868144690781797) internal successors, (1601), 1268 states have internal predecessors, (1601), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1607 transitions. [2025-02-08 08:01:06,963 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1607 transitions. Word has length 3 [2025-02-08 08:01:06,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:06,965 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1607 transitions. [2025-02-08 08:01:06,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-08 08:01:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1607 transitions. [2025-02-08 08:01:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 08:01:06,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:06,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 08:01:06,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:01:06,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:06,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:06,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1352432, now seen corresponding path program 1 times [2025-02-08 08:01:06,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:06,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090063318] [2025-02-08 08:01:06,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:06,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:06,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:01:06,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:01:06,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:06,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:07,062 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-08 08:01:07,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:07,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090063318] [2025-02-08 08:01:07,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090063318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:07,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:07,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:01:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466069242] [2025-02-08 08:01:07,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:07,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:07,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:07,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:07,065 INFO L87 Difference]: Start difference. First operand 1273 states and 1607 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-08 08:01:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:07,834 INFO L93 Difference]: Finished difference Result 1357 states and 1602 transitions. [2025-02-08 08:01:07,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:07,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-08 08:01:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:07,840 INFO L225 Difference]: With dead ends: 1357 [2025-02-08 08:01:07,840 INFO L226 Difference]: Without dead ends: 1357 [2025-02-08 08:01:07,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:07,841 INFO L435 NwaCegarLoop]: 1071 mSDtfsCounter, 385 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:07,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1813 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 08:01:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-02-08 08:01:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1272. [2025-02-08 08:01:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 857 states have (on average 1.8599766627771295) internal successors, (1594), 1267 states have internal predecessors, (1594), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1600 transitions. [2025-02-08 08:01:07,898 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1600 transitions. Word has length 3 [2025-02-08 08:01:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:07,901 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1600 transitions. [2025-02-08 08:01:07,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-08 08:01:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1600 transitions. [2025-02-08 08:01:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 08:01:07,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:07,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 08:01:07,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:01:07,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:07,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1352431, now seen corresponding path program 1 times [2025-02-08 08:01:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630863432] [2025-02-08 08:01:07,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:07,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:01:07,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:01:07,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:07,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:07,942 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-08 08:01:07,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:07,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630863432] [2025-02-08 08:01:07,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630863432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:07,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:07,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:01:07,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346066795] [2025-02-08 08:01:07,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:07,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:07,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:07,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:07,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:07,944 INFO L87 Difference]: Start difference. First operand 1272 states and 1600 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-08 08:01:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:08,522 INFO L93 Difference]: Finished difference Result 1269 states and 1592 transitions. [2025-02-08 08:01:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:08,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-08 08:01:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:08,530 INFO L225 Difference]: With dead ends: 1269 [2025-02-08 08:01:08,530 INFO L226 Difference]: Without dead ends: 1269 [2025-02-08 08:01:08,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:08,531 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1095 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:08,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 828 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 08:01:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-02-08 08:01:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1269. [2025-02-08 08:01:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 865 states have (on average 1.8335260115606937) internal successors, (1586), 1264 states have internal predecessors, (1586), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1592 transitions. [2025-02-08 08:01:08,564 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1592 transitions. Word has length 3 [2025-02-08 08:01:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:08,564 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1592 transitions. [2025-02-08 08:01:08,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-08 08:01:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1592 transitions. [2025-02-08 08:01:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:01:08,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:08,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:08,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:01:08,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:08,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1055919835, now seen corresponding path program 1 times [2025-02-08 08:01:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702778662] [2025-02-08 08:01:08,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:08,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:01:08,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:01:08,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:08,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:08,812 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-08 08:01:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:08,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702778662] [2025-02-08 08:01:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702778662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:08,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:08,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:01:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898752017] [2025-02-08 08:01:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:08,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:01:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:08,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:01:08,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:01:08,815 INFO L87 Difference]: Start difference. First operand 1269 states and 1592 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:09,979 INFO L93 Difference]: Finished difference Result 1343 states and 1582 transitions. [2025-02-08 08:01:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:01:09,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 08:01:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:09,985 INFO L225 Difference]: With dead ends: 1343 [2025-02-08 08:01:09,985 INFO L226 Difference]: Without dead ends: 1343 [2025-02-08 08:01:09,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:01:09,986 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 3346 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3346 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:09,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3346 Valid, 1049 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 08:01:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-02-08 08:01:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1258. [2025-02-08 08:01:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 865 states have (on average 1.8196531791907515) internal successors, (1574), 1253 states have internal predecessors, (1574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1580 transitions. [2025-02-08 08:01:10,010 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1580 transitions. Word has length 8 [2025-02-08 08:01:10,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:10,010 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1580 transitions. [2025-02-08 08:01:10,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1580 transitions. [2025-02-08 08:01:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 08:01:10,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:10,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:10,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:01:10,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr412REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:10,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:10,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1626222235, now seen corresponding path program 1 times [2025-02-08 08:01:10,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:10,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443457661] [2025-02-08 08:01:10,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:10,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:10,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:01:10,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:01:10,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:10,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:10,060 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-08 08:01:10,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:10,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443457661] [2025-02-08 08:01:10,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443457661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:10,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:10,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:01:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794642087] [2025-02-08 08:01:10,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:10,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:10,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:10,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:10,062 INFO L87 Difference]: Start difference. First operand 1258 states and 1580 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:10,728 INFO L93 Difference]: Finished difference Result 1296 states and 1535 transitions. [2025-02-08 08:01:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:10,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 08:01:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:10,735 INFO L225 Difference]: With dead ends: 1296 [2025-02-08 08:01:10,735 INFO L226 Difference]: Without dead ends: 1296 [2025-02-08 08:01:10,735 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-08 08:01:10,737 INFO L435 NwaCegarLoop]: 1064 mSDtfsCounter, 1069 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:10,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1346 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:01:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-02-08 08:01:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1211. [2025-02-08 08:01:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 865 states have (on average 1.7653179190751445) internal successors, (1527), 1206 states have internal predecessors, (1527), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1533 transitions. [2025-02-08 08:01:10,767 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1533 transitions. Word has length 9 [2025-02-08 08:01:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:10,767 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1533 transitions. [2025-02-08 08:01:10,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1533 transitions. [2025-02-08 08:01:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 08:01:10,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:10,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:10,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:01:10,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr413REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:10,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1626222234, now seen corresponding path program 1 times [2025-02-08 08:01:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:10,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635396978] [2025-02-08 08:01:10,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:10,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:01:10,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:01:10,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:10,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:10,858 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-08 08:01:10,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:10,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635396978] [2025-02-08 08:01:10,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635396978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:10,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:10,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:01:10,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163170228] [2025-02-08 08:01:10,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:10,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:10,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:10,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:10,860 INFO L87 Difference]: Start difference. First operand 1211 states and 1533 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:11,519 INFO L93 Difference]: Finished difference Result 1501 states and 1899 transitions. [2025-02-08 08:01:11,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:11,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 08:01:11,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:11,525 INFO L225 Difference]: With dead ends: 1501 [2025-02-08 08:01:11,525 INFO L226 Difference]: Without dead ends: 1501 [2025-02-08 08:01:11,525 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-08 08:01:11,527 INFO L435 NwaCegarLoop]: 1197 mSDtfsCounter, 860 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:11,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1595 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:01:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-02-08 08:01:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1186. [2025-02-08 08:01:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 865 states have (on average 1.7364161849710982) internal successors, (1502), 1181 states have internal predecessors, (1502), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1508 transitions. [2025-02-08 08:01:11,555 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1508 transitions. Word has length 9 [2025-02-08 08:01:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:11,555 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1508 transitions. [2025-02-08 08:01:11,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1508 transitions. [2025-02-08 08:01:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:01:11,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:11,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:11,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:01:11,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:11,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash -280159072, now seen corresponding path program 1 times [2025-02-08 08:01:11,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:11,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320597165] [2025-02-08 08:01:11,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:11,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:11,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:01:11,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:01:11,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:11,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:11,626 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-08 08:01:11,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:11,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320597165] [2025-02-08 08:01:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320597165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:11,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:11,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:01:11,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816027324] [2025-02-08 08:01:11,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:11,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:11,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:11,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:11,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:11,628 INFO L87 Difference]: Start difference. First operand 1186 states and 1508 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-08 08:01:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:12,240 INFO L93 Difference]: Finished difference Result 1261 states and 1614 transitions. [2025-02-08 08:01:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:01:12,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-02-08 08:01:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:12,245 INFO L225 Difference]: With dead ends: 1261 [2025-02-08 08:01:12,245 INFO L226 Difference]: Without dead ends: 1261 [2025-02-08 08:01:12,245 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-08 08:01:12,246 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 1292 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:12,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 1343 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:01:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-02-08 08:01:12,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1163. [2025-02-08 08:01:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 865 states have (on average 1.6832369942196532) internal successors, (1456), 1158 states have internal predecessors, (1456), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1462 transitions. [2025-02-08 08:01:12,268 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1462 transitions. Word has length 15 [2025-02-08 08:01:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:12,268 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1462 transitions. [2025-02-08 08:01:12,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-08 08:01:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1462 transitions. [2025-02-08 08:01:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:01:12,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:12,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:12,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:01:12,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:12,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash -280159071, now seen corresponding path program 1 times [2025-02-08 08:01:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:12,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658034979] [2025-02-08 08:01:12,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:12,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:12,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:01:12,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:01:12,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:12,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:12,336 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-08 08:01:12,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:12,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658034979] [2025-02-08 08:01:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658034979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:12,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:01:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612769026] [2025-02-08 08:01:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:12,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:12,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:12,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:12,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:12,337 INFO L87 Difference]: Start difference. First operand 1163 states and 1462 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-08 08:01:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:12,409 INFO L93 Difference]: Finished difference Result 1025 states and 1256 transitions. [2025-02-08 08:01:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:12,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-02-08 08:01:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:12,413 INFO L225 Difference]: With dead ends: 1025 [2025-02-08 08:01:12,414 INFO L226 Difference]: Without dead ends: 1025 [2025-02-08 08:01:12,414 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-08 08:01:12,414 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 60 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:12,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1843 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:01:12,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-02-08 08:01:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2025-02-08 08:01:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 739 states have (on average 1.6914749661705006) internal successors, (1250), 1020 states have internal predecessors, (1250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1256 transitions. [2025-02-08 08:01:12,431 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1256 transitions. Word has length 15 [2025-02-08 08:01:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:12,431 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1256 transitions. [2025-02-08 08:01:12,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-08 08:01:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1256 transitions. [2025-02-08 08:01:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 08:01:12,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:12,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:12,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:01:12,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:12,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash -95121322, now seen corresponding path program 1 times [2025-02-08 08:01:12,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:12,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193020862] [2025-02-08 08:01:12,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:12,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:01:12,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:01:12,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:12,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:12,485 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-08 08:01:12,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:12,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193020862] [2025-02-08 08:01:12,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193020862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:12,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:12,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:01:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455690046] [2025-02-08 08:01:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:12,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:12,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:12,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:12,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:12,487 INFO L87 Difference]: Start difference. First operand 1025 states and 1256 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:12,598 INFO L93 Difference]: Finished difference Result 996 states and 1206 transitions. [2025-02-08 08:01:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:01:12,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-08 08:01:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:12,601 INFO L225 Difference]: With dead ends: 996 [2025-02-08 08:01:12,602 INFO L226 Difference]: Without dead ends: 996 [2025-02-08 08:01:12,602 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-08 08:01:12,605 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 41 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:12,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2711 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:01:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-02-08 08:01:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 990. [2025-02-08 08:01:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 711 states have (on average 1.6793248945147679) internal successors, (1194), 985 states have internal predecessors, (1194), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1200 transitions. [2025-02-08 08:01:12,625 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1200 transitions. Word has length 16 [2025-02-08 08:01:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:12,625 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1200 transitions. [2025-02-08 08:01:12,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1200 transitions. [2025-02-08 08:01:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:01:12,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:12,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:12,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:01:12,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:12,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1162885816, now seen corresponding path program 1 times [2025-02-08 08:01:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:12,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784658165] [2025-02-08 08:01:12,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:12,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:12,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:01:12,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:01:12,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:12,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:12,695 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-08 08:01:12,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:12,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784658165] [2025-02-08 08:01:12,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784658165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:12,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:12,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:01:12,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143964072] [2025-02-08 08:01:12,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:12,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:12,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:12,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:12,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:12,697 INFO L87 Difference]: Start difference. First operand 990 states and 1200 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:13,286 INFO L93 Difference]: Finished difference Result 1059 states and 1255 transitions. [2025-02-08 08:01:13,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:01:13,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 08:01:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:13,289 INFO L225 Difference]: With dead ends: 1059 [2025-02-08 08:01:13,289 INFO L226 Difference]: Without dead ends: 1059 [2025-02-08 08:01:13,290 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-08 08:01:13,290 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 1179 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:13,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1591 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:01:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-02-08 08:01:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 967. [2025-02-08 08:01:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 711 states have (on average 1.6469760900140646) internal successors, (1171), 962 states have internal predecessors, (1171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1177 transitions. [2025-02-08 08:01:13,306 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1177 transitions. Word has length 19 [2025-02-08 08:01:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:13,306 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1177 transitions. [2025-02-08 08:01:13,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1177 transitions. [2025-02-08 08:01:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:01:13,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:13,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:13,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:01:13,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr405REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:13,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1162885817, now seen corresponding path program 1 times [2025-02-08 08:01:13,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:13,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38594320] [2025-02-08 08:01:13,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:13,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:01:13,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:01:13,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:13,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:13,374 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-08 08:01:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38594320] [2025-02-08 08:01:13,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38594320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:13,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:13,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:01:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511678134] [2025-02-08 08:01:13,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:13,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:13,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:13,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:13,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:13,376 INFO L87 Difference]: Start difference. First operand 967 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:13,432 INFO L93 Difference]: Finished difference Result 892 states and 1074 transitions. [2025-02-08 08:01:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:13,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 08:01:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:13,435 INFO L225 Difference]: With dead ends: 892 [2025-02-08 08:01:13,435 INFO L226 Difference]: Without dead ends: 892 [2025-02-08 08:01:13,436 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-08 08:01:13,436 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 60 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:13,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1553 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:01:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-02-08 08:01:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2025-02-08 08:01:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 648 states have (on average 1.6481481481481481) internal successors, (1068), 887 states have internal predecessors, (1068), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1074 transitions. [2025-02-08 08:01:13,452 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1074 transitions. Word has length 19 [2025-02-08 08:01:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:13,452 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1074 transitions. [2025-02-08 08:01:13,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1074 transitions. [2025-02-08 08:01:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:01:13,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:13,454 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] [2025-02-08 08:01:13,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:01:13,454 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:13,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1689598098, now seen corresponding path program 1 times [2025-02-08 08:01:13,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:13,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677768195] [2025-02-08 08:01:13,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:13,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:13,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:01:13,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:01:13,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:13,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:13,522 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-08 08:01:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677768195] [2025-02-08 08:01:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677768195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:01:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773911914] [2025-02-08 08:01:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:13,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:13,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:13,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:13,524 INFO L87 Difference]: Start difference. First operand 892 states and 1074 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-08 08:01:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:13,624 INFO L93 Difference]: Finished difference Result 877 states and 1052 transitions. [2025-02-08 08:01:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:01:13,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-08 08:01:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:13,627 INFO L225 Difference]: With dead ends: 877 [2025-02-08 08:01:13,627 INFO L226 Difference]: Without dead ends: 877 [2025-02-08 08:01:13,627 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-08 08:01:13,627 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 45 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:13,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2272 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:01:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-02-08 08:01:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2025-02-08 08:01:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 640 states have (on average 1.634375) internal successors, (1046), 872 states have internal predecessors, (1046), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1052 transitions. [2025-02-08 08:01:13,657 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1052 transitions. Word has length 20 [2025-02-08 08:01:13,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:13,657 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1052 transitions. [2025-02-08 08:01:13,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-08 08:01:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1052 transitions. [2025-02-08 08:01:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 08:01:13,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:13,658 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] [2025-02-08 08:01:13,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:01:13,658 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:13,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:13,659 INFO L85 PathProgramCache]: Analyzing trace with hash 980678252, now seen corresponding path program 1 times [2025-02-08 08:01:13,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:13,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278568355] [2025-02-08 08:01:13,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:13,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:01:13,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:01:13,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:13,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:13,768 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-08 08:01:13,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:13,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278568355] [2025-02-08 08:01:13,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278568355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:13,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:13,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:01:13,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849744621] [2025-02-08 08:01:13,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:13,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:13,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:13,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:13,770 INFO L87 Difference]: Start difference. First operand 877 states and 1052 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:14,372 INFO L93 Difference]: Finished difference Result 965 states and 1126 transitions. [2025-02-08 08:01:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:01:14,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-08 08:01:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:14,376 INFO L225 Difference]: With dead ends: 965 [2025-02-08 08:01:14,376 INFO L226 Difference]: Without dead ends: 965 [2025-02-08 08:01:14,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-08 08:01:14,376 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 384 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:14,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1700 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:01:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2025-02-08 08:01:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 877. [2025-02-08 08:01:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 640 states have (on average 1.628125) internal successors, (1042), 872 states have internal predecessors, (1042), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1048 transitions. [2025-02-08 08:01:14,391 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1048 transitions. Word has length 30 [2025-02-08 08:01:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:14,391 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1048 transitions. [2025-02-08 08:01:14,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:01:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1048 transitions. [2025-02-08 08:01:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 08:01:14,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:14,394 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] [2025-02-08 08:01:14,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:01:14,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr367REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:14,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash -826716376, now seen corresponding path program 1 times [2025-02-08 08:01:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:14,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097359251] [2025-02-08 08:01:14,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:14,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 08:01:14,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 08:01:14,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:14,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:14,585 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-08 08:01:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097359251] [2025-02-08 08:01:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097359251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:14,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:01:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649410792] [2025-02-08 08:01:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:14,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:14,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:14,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:14,587 INFO L87 Difference]: Start difference. First operand 877 states and 1048 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-08 08:01:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:15,248 INFO L93 Difference]: Finished difference Result 1118 states and 1357 transitions. [2025-02-08 08:01:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:01:15,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-08 08:01:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:15,252 INFO L225 Difference]: With dead ends: 1118 [2025-02-08 08:01:15,252 INFO L226 Difference]: Without dead ends: 1118 [2025-02-08 08:01:15,252 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-08 08:01:15,253 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 707 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:15,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1744 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:01:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-02-08 08:01:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 873. [2025-02-08 08:01:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 640 states have (on average 1.621875) internal successors, (1038), 868 states have internal predecessors, (1038), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1044 transitions. [2025-02-08 08:01:15,272 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1044 transitions. Word has length 34 [2025-02-08 08:01:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:15,273 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1044 transitions. [2025-02-08 08:01:15,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-08 08:01:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1044 transitions. [2025-02-08 08:01:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 08:01:15,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:15,276 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] [2025-02-08 08:01:15,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:01:15,277 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:15,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1539815428, now seen corresponding path program 1 times [2025-02-08 08:01:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:15,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656308639] [2025-02-08 08:01:15,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:15,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:15,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 08:01:15,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 08:01:15,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:15,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:15,392 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-08 08:01:15,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:15,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656308639] [2025-02-08 08:01:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656308639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:15,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:01:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374822446] [2025-02-08 08:01:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:15,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:15,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:15,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:15,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:15,394 INFO L87 Difference]: Start difference. First operand 873 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-08 08:01:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:15,492 INFO L93 Difference]: Finished difference Result 873 states and 1036 transitions. [2025-02-08 08:01:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:01:15,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-02-08 08:01:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:15,495 INFO L225 Difference]: With dead ends: 873 [2025-02-08 08:01:15,495 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 08:01:15,495 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-08 08:01:15,495 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 27 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:15,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2252 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:01:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 08:01:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-02-08 08:01:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 640 states have (on average 1.609375) internal successors, (1030), 868 states have internal predecessors, (1030), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1036 transitions. [2025-02-08 08:01:15,507 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1036 transitions. Word has length 63 [2025-02-08 08:01:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:15,507 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1036 transitions. [2025-02-08 08:01:15,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-08 08:01:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1036 transitions. [2025-02-08 08:01:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 08:01:15,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:15,509 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-08 08:01:15,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:01:15,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr352REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:15,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:15,510 INFO L85 PathProgramCache]: Analyzing trace with hash 199498455, now seen corresponding path program 1 times [2025-02-08 08:01:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:15,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344699524] [2025-02-08 08:01:15,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:15,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 08:01:15,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 08:01:15,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:15,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:15,624 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-08 08:01:15,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:15,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344699524] [2025-02-08 08:01:15,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344699524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:15,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:15,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:01:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125450742] [2025-02-08 08:01:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:15,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:15,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:15,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:15,625 INFO L87 Difference]: Start difference. First operand 873 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-08 08:01:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:15,713 INFO L93 Difference]: Finished difference Result 867 states and 1026 transitions. [2025-02-08 08:01:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:01:15,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-08 08:01:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:15,716 INFO L225 Difference]: With dead ends: 867 [2025-02-08 08:01:15,716 INFO L226 Difference]: Without dead ends: 867 [2025-02-08 08:01:15,716 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-08 08:01:15,717 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 21 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:15,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2246 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:01:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-02-08 08:01:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2025-02-08 08:01:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 634 states have (on average 1.608832807570978) internal successors, (1020), 862 states have internal predecessors, (1020), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1026 transitions. [2025-02-08 08:01:15,729 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1026 transitions. Word has length 69 [2025-02-08 08:01:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:15,730 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1026 transitions. [2025-02-08 08:01:15,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-08 08:01:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1026 transitions. [2025-02-08 08:01:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 08:01:15,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:15,731 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] [2025-02-08 08:01:15,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:01:15,731 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:15,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1253169476, now seen corresponding path program 1 times [2025-02-08 08:01:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:15,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246146602] [2025-02-08 08:01:15,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:15,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 08:01:15,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 08:01:15,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:15,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:15,855 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-08 08:01:15,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:15,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246146602] [2025-02-08 08:01:15,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246146602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:15,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:15,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:01:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051258652] [2025-02-08 08:01:15,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:15,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:15,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:15,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:15,856 INFO L87 Difference]: Start difference. First operand 867 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 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-08 08:01:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:15,960 INFO L93 Difference]: Finished difference Result 1027 states and 1195 transitions. [2025-02-08 08:01:15,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:15,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-02-08 08:01:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:15,963 INFO L225 Difference]: With dead ends: 1027 [2025-02-08 08:01:15,964 INFO L226 Difference]: Without dead ends: 1027 [2025-02-08 08:01:15,964 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-08 08:01:15,964 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 198 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:15,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1506 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:01:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-02-08 08:01:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1017. [2025-02-08 08:01:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 784 states have (on average 1.5114795918367347) internal successors, (1185), 1012 states have internal predecessors, (1185), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1191 transitions. [2025-02-08 08:01:15,979 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1191 transitions. Word has length 71 [2025-02-08 08:01:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:15,979 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1191 transitions. [2025-02-08 08:01:15,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 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-08 08:01:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1191 transitions. [2025-02-08 08:01:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 08:01:15,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:15,980 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] [2025-02-08 08:01:15,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:01:15,980 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:15,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:15,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1714428252, now seen corresponding path program 1 times [2025-02-08 08:01:15,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:15,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747101041] [2025-02-08 08:01:15,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:15,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 08:01:16,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 08:01:16,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:16,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:16,383 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-08 08:01:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747101041] [2025-02-08 08:01:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747101041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:16,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:16,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:01:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146824698] [2025-02-08 08:01:16,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:16,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:01:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:16,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:01:16,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:01:16,384 INFO L87 Difference]: Start difference. First operand 1017 states and 1191 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-08 08:01:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:16,571 INFO L93 Difference]: Finished difference Result 1497 states and 1701 transitions. [2025-02-08 08:01:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:01:16,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-08 08:01:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:16,576 INFO L225 Difference]: With dead ends: 1497 [2025-02-08 08:01:16,576 INFO L226 Difference]: Without dead ends: 1493 [2025-02-08 08:01:16,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:01:16,576 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 734 mSDsluCounter, 2707 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:16,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 3687 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:01:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2025-02-08 08:01:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 918. [2025-02-08 08:01:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 685 states have (on average 1.543065693430657) internal successors, (1057), 913 states have internal predecessors, (1057), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1063 transitions. [2025-02-08 08:01:16,593 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1063 transitions. Word has length 76 [2025-02-08 08:01:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:16,593 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1063 transitions. [2025-02-08 08:01:16,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-08 08:01:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1063 transitions. [2025-02-08 08:01:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 08:01:16,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:16,594 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-08 08:01:16,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 08:01:16,594 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:16,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1293164006, now seen corresponding path program 1 times [2025-02-08 08:01:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984507828] [2025-02-08 08:01:16,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:16,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 08:01:16,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 08:01:16,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:16,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:16,845 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-08 08:01:16,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:16,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984507828] [2025-02-08 08:01:16,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984507828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:16,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:16,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:01:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783674505] [2025-02-08 08:01:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:16,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:01:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:16,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:01:16,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:01:16,847 INFO L87 Difference]: Start difference. First operand 918 states and 1063 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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-08 08:01:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:17,465 INFO L93 Difference]: Finished difference Result 917 states and 1062 transitions. [2025-02-08 08:01:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:01:17,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-02-08 08:01:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:17,469 INFO L225 Difference]: With dead ends: 917 [2025-02-08 08:01:17,469 INFO L226 Difference]: Without dead ends: 917 [2025-02-08 08:01:17,469 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-08 08:01:17,469 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 2 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:17,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2226 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:01:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2025-02-08 08:01:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2025-02-08 08:01:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 685 states have (on average 1.5416058394160583) internal successors, (1056), 912 states have internal predecessors, (1056), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1062 transitions. [2025-02-08 08:01:17,482 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1062 transitions. Word has length 85 [2025-02-08 08:01:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:17,482 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1062 transitions. [2025-02-08 08:01:17,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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-08 08:01:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1062 transitions. [2025-02-08 08:01:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 08:01:17,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:17,483 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-08 08:01:17,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:01:17,483 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:17,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1293164005, now seen corresponding path program 1 times [2025-02-08 08:01:17,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:17,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633008511] [2025-02-08 08:01:17,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:17,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:17,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 08:01:17,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 08:01:17,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:17,961 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-08 08:01:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633008511] [2025-02-08 08:01:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633008511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:17,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:17,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:01:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553346771] [2025-02-08 08:01:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:17,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:01:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:17,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:01:17,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:01:17,963 INFO L87 Difference]: Start difference. First operand 917 states and 1062 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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-08 08:01:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:18,720 INFO L93 Difference]: Finished difference Result 916 states and 1061 transitions. [2025-02-08 08:01:18,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:01:18,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-02-08 08:01:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:18,723 INFO L225 Difference]: With dead ends: 916 [2025-02-08 08:01:18,723 INFO L226 Difference]: Without dead ends: 916 [2025-02-08 08:01:18,723 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-08 08:01:18,724 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 1 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:18,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2185 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 08:01:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-02-08 08:01:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2025-02-08 08:01:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 684 states have (on average 1.5423976608187135) internal successors, (1055), 911 states have internal predecessors, (1055), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1061 transitions. [2025-02-08 08:01:18,736 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1061 transitions. Word has length 85 [2025-02-08 08:01:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:18,736 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1061 transitions. [2025-02-08 08:01:18,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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-08 08:01:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1061 transitions. [2025-02-08 08:01:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 08:01:18,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:18,737 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] [2025-02-08 08:01:18,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:01:18,737 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:18,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1130699593, now seen corresponding path program 1 times [2025-02-08 08:01:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146681801] [2025-02-08 08:01:18,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:18,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:01:18,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:01:18,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:18,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:18,976 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-08 08:01:18,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:18,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146681801] [2025-02-08 08:01:18,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146681801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:18,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:18,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:01:18,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733353555] [2025-02-08 08:01:18,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:18,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:01:18,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:18,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:01:18,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:01:18,977 INFO L87 Difference]: Start difference. First operand 916 states and 1061 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-08 08:01:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:19,822 INFO L93 Difference]: Finished difference Result 928 states and 1076 transitions. [2025-02-08 08:01:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:01:19,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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 93 [2025-02-08 08:01:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:19,827 INFO L225 Difference]: With dead ends: 928 [2025-02-08 08:01:19,827 INFO L226 Difference]: Without dead ends: 928 [2025-02-08 08:01:19,827 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-08 08:01:19,828 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 6 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:19,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3483 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 08:01:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-02-08 08:01:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 922. [2025-02-08 08:01:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 689 states have (on average 1.5413642960812772) internal successors, (1062), 916 states have internal predecessors, (1062), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:01:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1071 transitions. [2025-02-08 08:01:19,842 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1071 transitions. Word has length 93 [2025-02-08 08:01:19,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:19,843 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1071 transitions. [2025-02-08 08:01:19,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-08 08:01:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1071 transitions. [2025-02-08 08:01:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 08:01:19,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:19,844 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] [2025-02-08 08:01:19,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 08:01:19,844 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:19,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1130699592, now seen corresponding path program 1 times [2025-02-08 08:01:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:19,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164315225] [2025-02-08 08:01:19,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:19,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:19,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:01:19,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:01:19,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:19,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:20,352 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-08 08:01:20,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164315225] [2025-02-08 08:01:20,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164315225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:20,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:20,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:01:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721299930] [2025-02-08 08:01:20,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:20,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:01:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:20,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:01:20,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:01:20,354 INFO L87 Difference]: Start difference. First operand 922 states and 1071 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-08 08:01:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:21,206 INFO L93 Difference]: Finished difference Result 922 states and 1070 transitions. [2025-02-08 08:01:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:01:21,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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 93 [2025-02-08 08:01:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:21,212 INFO L225 Difference]: With dead ends: 922 [2025-02-08 08:01:21,212 INFO L226 Difference]: Without dead ends: 922 [2025-02-08 08:01:21,213 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-08 08:01:21,215 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 1 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2830 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:21,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2830 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 08:01:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-02-08 08:01:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2025-02-08 08:01:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 689 states have (on average 1.5399129172714079) internal successors, (1061), 916 states have internal predecessors, (1061), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 08:01:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1070 transitions. [2025-02-08 08:01:21,234 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1070 transitions. Word has length 93 [2025-02-08 08:01:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:21,235 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1070 transitions. [2025-02-08 08:01:21,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-08 08:01:21,235 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1070 transitions. [2025-02-08 08:01:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 08:01:21,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:21,236 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-08 08:01:21,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 08:01:21,236 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:21,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1418597061, now seen corresponding path program 1 times [2025-02-08 08:01:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:21,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345435696] [2025-02-08 08:01:21,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:21,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:21,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 08:01:21,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 08:01:21,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:21,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:21,738 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-08 08:01:21,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345435696] [2025-02-08 08:01:21,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345435696] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234916792] [2025-02-08 08:01:21,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:21,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:21,742 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-08 08:01:21,743 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-08 08:01:21,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 08:01:21,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 08:01:21,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:21,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:21,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 08:01:21,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:21,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:01:22,180 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:01:22,181 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-08 08:01:22,222 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-08 08:01:22,312 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-08 08:01:22,491 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:22,491 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-08 08:01:22,547 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-08 08:01:22,581 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-08 08:01:22,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:22,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_642 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_642) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 08:01:22,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234916792] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:22,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:22,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-02-08 08:01:22,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972668855] [2025-02-08 08:01:22,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:22,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 08:01:22,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:22,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 08:01:22,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-02-08 08:01:22,619 INFO L87 Difference]: Start difference. First operand 922 states and 1070 transitions. Second operand has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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-08 08:01:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:24,832 INFO L93 Difference]: Finished difference Result 929 states and 1077 transitions. [2025-02-08 08:01:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:01:24,833 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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 94 [2025-02-08 08:01:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:24,837 INFO L225 Difference]: With dead ends: 929 [2025-02-08 08:01:24,837 INFO L226 Difference]: Without dead ends: 929 [2025-02-08 08:01:24,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-02-08 08:01:24,838 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 700 mSDsluCounter, 5099 mSDsCounter, 0 mSdLazyCounter, 3958 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 5574 SdHoareTripleChecker+Invalid, 3974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:24,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 5574 Invalid, 3974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3958 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 08:01:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-02-08 08:01:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 926. [2025-02-08 08:01:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 693 states have (on average 1.5367965367965368) internal successors, (1065), 919 states have internal predecessors, (1065), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1072 transitions. [2025-02-08 08:01:24,854 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1072 transitions. Word has length 94 [2025-02-08 08:01:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:24,854 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1072 transitions. [2025-02-08 08:01:24,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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-08 08:01:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1072 transitions. [2025-02-08 08:01:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 08:01:24,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:24,855 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-08 08:01:24,865 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-08 08:01:25,056 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,SelfDestructingSolverStorable22 [2025-02-08 08:01:25,056 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:25,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:25,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1418597062, now seen corresponding path program 1 times [2025-02-08 08:01:25,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:25,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093217523] [2025-02-08 08:01:25,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:25,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:25,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 08:01:25,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 08:01:25,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:25,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:25,773 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-08 08:01:25,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:25,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093217523] [2025-02-08 08:01:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093217523] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744869881] [2025-02-08 08:01:25,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:25,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:25,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:25,776 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-08 08:01:25,779 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-08 08:01:25,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 08:01:25,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 08:01:25,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:25,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:25,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 08:01:25,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:25,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:01:26,115 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-08 08:01:26,124 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:01:26,124 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-08 08:01:26,159 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-08 08:01:26,164 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-08 08:01:26,242 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-08 08:01:26,246 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-08 08:01:26,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:26,344 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-08 08:01:26,352 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-08 08:01:26,385 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-08 08:01:26,389 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-08 08:01:26,410 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-08 08:01:26,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:26,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744869881] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:26,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:26,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-02-08 08:01:26,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127648201] [2025-02-08 08:01:26,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:26,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:01:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:26,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:01:26,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=353, Unknown=6, NotChecked=0, Total=420 [2025-02-08 08:01:26,547 INFO L87 Difference]: Start difference. First operand 926 states and 1072 transitions. Second operand has 18 states, 15 states have (on average 9.8) internal successors, (147), 18 states have internal predecessors, (147), 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-08 08:01:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:28,916 INFO L93 Difference]: Finished difference Result 928 states and 1076 transitions. [2025-02-08 08:01:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:01:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 18 states have internal predecessors, (147), 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 94 [2025-02-08 08:01:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:28,921 INFO L225 Difference]: With dead ends: 928 [2025-02-08 08:01:28,921 INFO L226 Difference]: Without dead ends: 928 [2025-02-08 08:01:28,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=499, Unknown=6, NotChecked=0, Total=600 [2025-02-08 08:01:28,922 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 702 mSDsluCounter, 4376 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 4854 SdHoareTripleChecker+Invalid, 4668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:28,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 4854 Invalid, 4668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 08:01:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-02-08 08:01:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 919. [2025-02-08 08:01:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 688 states have (on average 1.5377906976744187) internal successors, (1058), 913 states have internal predecessors, (1058), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1064 transitions. [2025-02-08 08:01:28,947 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1064 transitions. Word has length 94 [2025-02-08 08:01:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:28,947 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1064 transitions. [2025-02-08 08:01:28,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 18 states have internal predecessors, (147), 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-08 08:01:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1064 transitions. [2025-02-08 08:01:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 08:01:28,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:28,949 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] [2025-02-08 08:01:28,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:01:29,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:29,153 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:29,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash 757799220, now seen corresponding path program 1 times [2025-02-08 08:01:29,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:29,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679607232] [2025-02-08 08:01:29,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:29,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:29,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 08:01:29,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 08:01:29,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:29,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:29,639 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-08 08:01:29,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:29,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679607232] [2025-02-08 08:01:29,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679607232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:29,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:29,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 08:01:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30827878] [2025-02-08 08:01:29,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:29,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:01:29,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:29,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:01:29,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:01:29,642 INFO L87 Difference]: Start difference. First operand 919 states and 1064 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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-08 08:01:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:30,981 INFO L93 Difference]: Finished difference Result 932 states and 1080 transitions. [2025-02-08 08:01:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:01:30,982 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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 96 [2025-02-08 08:01:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:30,985 INFO L225 Difference]: With dead ends: 932 [2025-02-08 08:01:30,985 INFO L226 Difference]: Without dead ends: 932 [2025-02-08 08:01:30,985 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-08 08:01:30,986 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 729 mSDsluCounter, 3715 mSDsCounter, 0 mSdLazyCounter, 2982 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 4190 SdHoareTripleChecker+Invalid, 2994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:30,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 4190 Invalid, 2994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2982 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 08:01:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-08 08:01:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 928. [2025-02-08 08:01:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 696 states have (on average 1.5344827586206897) internal successors, (1068), 921 states have internal predecessors, (1068), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1075 transitions. [2025-02-08 08:01:31,001 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1075 transitions. Word has length 96 [2025-02-08 08:01:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:31,001 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1075 transitions. [2025-02-08 08:01:31,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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-08 08:01:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1075 transitions. [2025-02-08 08:01:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 08:01:31,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:31,002 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] [2025-02-08 08:01:31,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 08:01:31,003 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:31,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash 757799221, now seen corresponding path program 1 times [2025-02-08 08:01:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:31,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978533450] [2025-02-08 08:01:31,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:31,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 08:01:31,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 08:01:31,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:31,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:31,624 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-08 08:01:31,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:31,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978533450] [2025-02-08 08:01:31,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978533450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:31,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:31,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:01:31,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679820930] [2025-02-08 08:01:31,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:31,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:01:31,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:31,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:01:31,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:01:31,628 INFO L87 Difference]: Start difference. First operand 928 states and 1075 transitions. Second operand has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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-08 08:01:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:32,862 INFO L93 Difference]: Finished difference Result 931 states and 1079 transitions. [2025-02-08 08:01:32,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:01:32,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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 96 [2025-02-08 08:01:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:32,865 INFO L225 Difference]: With dead ends: 931 [2025-02-08 08:01:32,865 INFO L226 Difference]: Without dead ends: 931 [2025-02-08 08:01:32,865 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-08 08:01:32,866 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 728 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:32,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 2859 Invalid, 2724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 08:01:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-08 08:01:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 928. [2025-02-08 08:01:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 696 states have (on average 1.5330459770114941) internal successors, (1067), 921 states have internal predecessors, (1067), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1074 transitions. [2025-02-08 08:01:32,878 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1074 transitions. Word has length 96 [2025-02-08 08:01:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:32,878 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1074 transitions. [2025-02-08 08:01:32,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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-08 08:01:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1074 transitions. [2025-02-08 08:01:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 08:01:32,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:32,880 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] [2025-02-08 08:01:32,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 08:01:32,880 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:32,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:32,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1052276634, now seen corresponding path program 1 times [2025-02-08 08:01:32,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:32,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112406967] [2025-02-08 08:01:32,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:32,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:32,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 08:01:32,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 08:01:32,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:32,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:33,353 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-08 08:01:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112406967] [2025-02-08 08:01:33,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112406967] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786241507] [2025-02-08 08:01:33,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:33,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:33,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:33,357 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-08 08:01:33,359 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-08 08:01:33,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 08:01:33,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 08:01:33,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:33,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:33,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 08:01:33,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:33,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:01:33,720 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:01:33,720 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-08 08:01:33,755 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-08 08:01:33,833 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-08 08:01:33,957 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:33,958 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-08 08:01:34,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:34,037 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-08 08:01:34,049 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-08 08:01:34,073 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-08 08:01:34,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:34,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 08:01:34,093 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-08 08:01:34,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786241507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:34,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:34,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-02-08 08:01:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590714451] [2025-02-08 08:01:34,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:34,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 08:01:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:34,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 08:01:34,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=422, Unknown=15, NotChecked=86, Total=600 [2025-02-08 08:01:34,155 INFO L87 Difference]: Start difference. First operand 928 states and 1074 transitions. Second operand has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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-08 08:01:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:35,976 INFO L93 Difference]: Finished difference Result 930 states and 1078 transitions. [2025-02-08 08:01:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:01:35,976 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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 97 [2025-02-08 08:01:35,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:35,978 INFO L225 Difference]: With dead ends: 930 [2025-02-08 08:01:35,979 INFO L226 Difference]: Without dead ends: 930 [2025-02-08 08:01:35,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=544, Unknown=16, NotChecked=98, Total=756 [2025-02-08 08:01:35,979 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 693 mSDsluCounter, 5066 mSDsCounter, 0 mSdLazyCounter, 3973 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 5540 SdHoareTripleChecker+Invalid, 3986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:35,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 5540 Invalid, 3986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3973 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 08:01:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-08 08:01:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 927. [2025-02-08 08:01:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 696 states have (on average 1.5316091954022988) internal successors, (1066), 920 states have internal predecessors, (1066), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1073 transitions. [2025-02-08 08:01:35,990 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1073 transitions. Word has length 97 [2025-02-08 08:01:35,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:35,991 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1073 transitions. [2025-02-08 08:01:35,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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-08 08:01:35,991 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1073 transitions. [2025-02-08 08:01:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 08:01:35,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:35,992 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] [2025-02-08 08:01:36,001 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-08 08:01:36,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:36,192 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:36,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1052276633, now seen corresponding path program 1 times [2025-02-08 08:01:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:36,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841203062] [2025-02-08 08:01:36,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:36,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:36,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 08:01:36,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 08:01:36,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:36,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:36,867 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-08 08:01:36,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:36,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841203062] [2025-02-08 08:01:36,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841203062] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:36,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623904726] [2025-02-08 08:01:36,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:36,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:36,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:36,870 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-08 08:01:36,873 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-08 08:01:37,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 08:01:37,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 08:01:37,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:37,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:37,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 08:01:37,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:37,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:01:37,208 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-08 08:01:37,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:01:37,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:01:37,243 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-08 08:01:37,252 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-08 08:01:37,328 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-08 08:01:37,335 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-08 08:01:37,431 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:37,432 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-08 08:01:37,437 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-08 08:01:37,493 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:37,493 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-08 08:01:37,501 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-08 08:01:37,513 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-08 08:01:37,519 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-08 08:01:37,537 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-08 08:01:37,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:37,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1227))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1228) .cse0 v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1228) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-02-08 08:01:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623904726] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:37,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:37,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-08 08:01:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385190532] [2025-02-08 08:01:37,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:37,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:01:37,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:37,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:01:37,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=455, Unknown=21, NotChecked=44, Total=600 [2025-02-08 08:01:37,723 INFO L87 Difference]: Start difference. First operand 927 states and 1073 transitions. Second operand has 20 states, 17 states have (on average 9.0) internal successors, (153), 20 states have internal predecessors, (153), 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-08 08:01:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:39,473 INFO L93 Difference]: Finished difference Result 929 states and 1077 transitions. [2025-02-08 08:01:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:01:39,474 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.0) internal successors, (153), 20 states have internal predecessors, (153), 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 97 [2025-02-08 08:01:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:39,476 INFO L225 Difference]: With dead ends: 929 [2025-02-08 08:01:39,476 INFO L226 Difference]: Without dead ends: 929 [2025-02-08 08:01:39,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=667, Unknown=21, NotChecked=54, Total=870 [2025-02-08 08:01:39,479 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 698 mSDsluCounter, 3478 mSDsCounter, 0 mSdLazyCounter, 4002 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 3955 SdHoareTripleChecker+Invalid, 4021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:39,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 3955 Invalid, 4021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4002 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 08:01:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-02-08 08:01:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 917. [2025-02-08 08:01:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 688 states have (on average 1.5348837209302326) internal successors, (1056), 911 states have internal predecessors, (1056), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1062 transitions. [2025-02-08 08:01:39,490 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1062 transitions. Word has length 97 [2025-02-08 08:01:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:39,491 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1062 transitions. [2025-02-08 08:01:39,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.0) internal successors, (153), 20 states have internal predecessors, (153), 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-08 08:01:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1062 transitions. [2025-02-08 08:01:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 08:01:39,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:39,492 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-08 08:01:39,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:01:39,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 08:01:39,693 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:39,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:39,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1249320048, now seen corresponding path program 1 times [2025-02-08 08:01:39,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:39,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174758107] [2025-02-08 08:01:39,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:39,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:39,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 08:01:39,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 08:01:39,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:39,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:40,092 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-08 08:01:40,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:40,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174758107] [2025-02-08 08:01:40,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174758107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:40,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:40,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:01:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794206666] [2025-02-08 08:01:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:40,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:01:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:40,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:01:40,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:01:40,095 INFO L87 Difference]: Start difference. First operand 917 states and 1062 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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-08 08:01:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:41,499 INFO L93 Difference]: Finished difference Result 933 states and 1081 transitions. [2025-02-08 08:01:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:01:41,500 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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-08 08:01:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:41,502 INFO L225 Difference]: With dead ends: 933 [2025-02-08 08:01:41,502 INFO L226 Difference]: Without dead ends: 933 [2025-02-08 08:01:41,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-08 08:01:41,503 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 716 mSDsluCounter, 3718 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 4195 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:41,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 4195 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 08:01:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-08 08:01:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 929. [2025-02-08 08:01:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 699 states have (on average 1.5293276108726752) internal successors, (1069), 922 states have internal predecessors, (1069), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1076 transitions. [2025-02-08 08:01:41,513 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1076 transitions. Word has length 99 [2025-02-08 08:01:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:41,514 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1076 transitions. [2025-02-08 08:01:41,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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-08 08:01:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1076 transitions. [2025-02-08 08:01:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 08:01:41,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:41,515 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-08 08:01:41,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 08:01:41,515 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1249320049, now seen corresponding path program 1 times [2025-02-08 08:01:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659769966] [2025-02-08 08:01:41,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:41,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 08:01:41,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 08:01:41,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:41,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:42,274 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-08 08:01:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:42,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659769966] [2025-02-08 08:01:42,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659769966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:42,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:42,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:01:42,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546065295] [2025-02-08 08:01:42,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:42,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:01:42,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:42,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:01:42,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:01:42,278 INFO L87 Difference]: Start difference. First operand 929 states and 1076 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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-08 08:01:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:43,876 INFO L93 Difference]: Finished difference Result 932 states and 1080 transitions. [2025-02-08 08:01:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:01:43,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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-08 08:01:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:43,878 INFO L225 Difference]: With dead ends: 932 [2025-02-08 08:01:43,878 INFO L226 Difference]: Without dead ends: 932 [2025-02-08 08:01:43,878 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-08 08:01:43,879 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 712 mSDsluCounter, 3180 mSDsCounter, 0 mSdLazyCounter, 3459 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:43,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 3658 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3459 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 08:01:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-08 08:01:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 929. [2025-02-08 08:01:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 699 states have (on average 1.5278969957081545) internal successors, (1068), 922 states have internal predecessors, (1068), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1075 transitions. [2025-02-08 08:01:43,888 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1075 transitions. Word has length 99 [2025-02-08 08:01:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:43,888 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1075 transitions. [2025-02-08 08:01:43,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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-08 08:01:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1075 transitions. [2025-02-08 08:01:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 08:01:43,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:43,889 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, 1] [2025-02-08 08:01:43,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 08:01:43,889 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:43,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash 593954814, now seen corresponding path program 1 times [2025-02-08 08:01:43,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:43,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14764736] [2025-02-08 08:01:43,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:43,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:43,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 08:01:43,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 08:01:43,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:43,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:44,444 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-08 08:01:44,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:44,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14764736] [2025-02-08 08:01:44,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14764736] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:44,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009432257] [2025-02-08 08:01:44,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:44,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:44,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:44,448 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-08 08:01:44,449 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-08 08:01:44,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 08:01:44,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 08:01:44,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:44,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:44,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 08:01:44,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:44,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:01:44,809 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:01:44,809 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-08 08:01:44,840 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-08 08:01:44,917 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-08 08:01:45,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:45,042 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-08 08:01:45,116 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:45,116 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-08 08:01:45,163 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:45,163 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-08 08:01:45,175 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-08 08:01:45,201 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-08 08:01:45,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:45,209 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1534) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 08:01:45,212 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1534) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-08 08:01:45,220 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1533 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1533))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1534)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 08:01:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009432257] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:45,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:45,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-02-08 08:01:45,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31927938] [2025-02-08 08:01:45,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:45,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 08:01:45,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:45,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 08:01:45,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=545, Unknown=17, NotChecked=150, Total=812 [2025-02-08 08:01:45,315 INFO L87 Difference]: Start difference. First operand 929 states and 1075 transitions. Second operand has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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-08 08:01:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:46,912 INFO L93 Difference]: Finished difference Result 931 states and 1079 transitions. [2025-02-08 08:01:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:01:46,912 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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 100 [2025-02-08 08:01:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:46,914 INFO L225 Difference]: With dead ends: 931 [2025-02-08 08:01:46,914 INFO L226 Difference]: Without dead ends: 931 [2025-02-08 08:01:46,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=685, Unknown=17, NotChecked=168, Total=992 [2025-02-08 08:01:46,915 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 688 mSDsluCounter, 4602 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 5075 SdHoareTripleChecker+Invalid, 3622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:46,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 5075 Invalid, 3622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 08:01:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-08 08:01:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 928. [2025-02-08 08:01:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 699 states have (on average 1.5264663805436338) internal successors, (1067), 921 states have internal predecessors, (1067), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1074 transitions. [2025-02-08 08:01:46,923 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1074 transitions. Word has length 100 [2025-02-08 08:01:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:46,924 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1074 transitions. [2025-02-08 08:01:46,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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-08 08:01:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1074 transitions. [2025-02-08 08:01:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 08:01:46,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:46,925 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, 1] [2025-02-08 08:01:46,932 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-08 08:01:47,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:47,126 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:47,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:47,126 INFO L85 PathProgramCache]: Analyzing trace with hash 593954815, now seen corresponding path program 1 times [2025-02-08 08:01:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:47,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833348392] [2025-02-08 08:01:47,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:47,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 08:01:47,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 08:01:47,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:47,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:47,700 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-08 08:01:47,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833348392] [2025-02-08 08:01:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833348392] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:47,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859628405] [2025-02-08 08:01:47,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:47,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:47,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:47,702 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-08 08:01:47,703 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-08 08:01:47,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 08:01:47,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 08:01:47,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:47,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:47,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 08:01:47,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:47,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:01:47,988 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:01:47,988 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-08 08:01:47,991 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-08 08:01:48,009 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 19 treesize of output 1 [2025-02-08 08:01:48,014 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-08 08:01:48,066 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-08 08:01:48,068 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-08 08:01:48,133 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:48,133 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-08 08:01:48,144 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-08 08:01:48,195 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:48,196 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-08 08:01:48,200 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-08 08:01:48,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:48,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 62 treesize of output 57 [2025-02-08 08:01:48,256 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 41 treesize of output 22 [2025-02-08 08:01:48,300 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 30 treesize of output 12 [2025-02-08 08:01:48,302 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-08 08:01:48,328 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-08 08:01:48,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:48,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1700 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_1700))) (or (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_1701))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store .cse0 .cse1 v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))) (forall ((v_ArrVal_1700 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| .cse4 v_ArrVal_1700))) (or (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0) (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#2.base| .cse4 v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 08:01:48,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1708))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1709) .cse2 v_ArrVal_1700))) (or (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) 0)))))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1708))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1709) .cse8 v_ArrVal_1700))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) 0) (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1701))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 12 (select (select (store .cse4 .cse5 v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1703) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2025-02-08 08:01:48,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859628405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:48,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:48,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2025-02-08 08:01:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600354434] [2025-02-08 08:01:48,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:48,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 08:01:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:48,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 08:01:48,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=652, Unknown=10, NotChecked=106, Total=870 [2025-02-08 08:01:48,682 INFO L87 Difference]: Start difference. First operand 928 states and 1074 transitions. Second operand has 23 states, 20 states have (on average 7.95) internal successors, (159), 23 states have internal predecessors, (159), 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-08 08:01:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:50,931 INFO L93 Difference]: Finished difference Result 930 states and 1078 transitions. [2025-02-08 08:01:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:01:50,932 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.95) internal successors, (159), 23 states have internal predecessors, (159), 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 100 [2025-02-08 08:01:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:50,933 INFO L225 Difference]: With dead ends: 930 [2025-02-08 08:01:50,933 INFO L226 Difference]: Without dead ends: 930 [2025-02-08 08:01:50,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=953, Unknown=10, NotChecked=130, Total=1260 [2025-02-08 08:01:50,934 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 697 mSDsluCounter, 4274 mSDsCounter, 0 mSdLazyCounter, 4737 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 4756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:50,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 4750 Invalid, 4756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4737 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 08:01:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-08 08:01:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 915. [2025-02-08 08:01:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 688 states have (on average 1.5319767441860466) internal successors, (1054), 909 states have internal predecessors, (1054), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:01:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1060 transitions. [2025-02-08 08:01:50,945 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1060 transitions. Word has length 100 [2025-02-08 08:01:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:50,946 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1060 transitions. [2025-02-08 08:01:50,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.95) internal successors, (159), 23 states have internal predecessors, (159), 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-08 08:01:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1060 transitions. [2025-02-08 08:01:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 08:01:50,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:50,947 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, 1, 1, 1] [2025-02-08 08:01:50,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:01:51,147 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,SelfDestructingSolverStorable31 [2025-02-08 08:01:51,147 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:51,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:51,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1692179315, now seen corresponding path program 1 times [2025-02-08 08:01:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:51,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581021671] [2025-02-08 08:01:51,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:51,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:51,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 08:01:51,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 08:01:51,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:51,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:51,595 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-08 08:01:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581021671] [2025-02-08 08:01:51,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581021671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:51,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:51,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 08:01:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982497447] [2025-02-08 08:01:51,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:51,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:01:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:51,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:01:51,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:01:51,596 INFO L87 Difference]: Start difference. First operand 915 states and 1060 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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-08 08:01:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:52,793 INFO L93 Difference]: Finished difference Result 934 states and 1082 transitions. [2025-02-08 08:01:52,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:01:52,793 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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 102 [2025-02-08 08:01:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:52,795 INFO L225 Difference]: With dead ends: 934 [2025-02-08 08:01:52,795 INFO L226 Difference]: Without dead ends: 934 [2025-02-08 08:01:52,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:01:52,796 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 736 mSDsluCounter, 3715 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:52,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 4191 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 08:01:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-08 08:01:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 930. [2025-02-08 08:01:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 702 states have (on average 1.5242165242165242) internal successors, (1070), 923 states have internal predecessors, (1070), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1077 transitions. [2025-02-08 08:01:52,805 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1077 transitions. Word has length 102 [2025-02-08 08:01:52,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:52,805 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1077 transitions. [2025-02-08 08:01:52,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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-08 08:01:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1077 transitions. [2025-02-08 08:01:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 08:01:52,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:52,806 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, 1, 1, 1] [2025-02-08 08:01:52,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 08:01:52,807 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:52,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:52,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1692179314, now seen corresponding path program 1 times [2025-02-08 08:01:52,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:52,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964980772] [2025-02-08 08:01:52,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:52,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 08:01:52,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 08:01:52,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:52,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:01:53,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:53,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964980772] [2025-02-08 08:01:53,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964980772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:53,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:53,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 08:01:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829124915] [2025-02-08 08:01:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:53,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:01:53,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:53,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:01:53,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:01:53,517 INFO L87 Difference]: Start difference. First operand 930 states and 1077 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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-08 08:01:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:54,930 INFO L93 Difference]: Finished difference Result 933 states and 1081 transitions. [2025-02-08 08:01:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:01:54,931 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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 102 [2025-02-08 08:01:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:54,933 INFO L225 Difference]: With dead ends: 933 [2025-02-08 08:01:54,933 INFO L226 Difference]: Without dead ends: 933 [2025-02-08 08:01:54,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-02-08 08:01:54,934 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 713 mSDsluCounter, 2823 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:54,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 3300 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 08:01:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-08 08:01:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 930. [2025-02-08 08:01:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 702 states have (on average 1.5227920227920229) internal successors, (1069), 923 states have internal predecessors, (1069), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1076 transitions. [2025-02-08 08:01:54,946 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1076 transitions. Word has length 102 [2025-02-08 08:01:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:54,946 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1076 transitions. [2025-02-08 08:01:54,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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-08 08:01:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1076 transitions. [2025-02-08 08:01:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 08:01:54,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:54,948 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, 1, 1, 1, 1] [2025-02-08 08:01:54,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 08:01:54,948 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:54,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:54,948 INFO L85 PathProgramCache]: Analyzing trace with hash -756537793, now seen corresponding path program 1 times [2025-02-08 08:01:54,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:54,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485957906] [2025-02-08 08:01:54,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:54,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:54,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 08:01:54,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 08:01:54,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:54,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:55,441 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-08 08:01:55,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:55,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485957906] [2025-02-08 08:01:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485957906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:55,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54175632] [2025-02-08 08:01:55,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:55,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:55,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:55,444 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-08 08:01:55,445 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-08 08:01:55,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 08:01:55,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 08:01:55,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:55,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:55,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 08:01:55,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:55,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:01:55,756 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:01:55,756 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-08 08:01:55,785 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-08 08:01:55,862 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-08 08:01:55,977 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:55,978 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-08 08:01:56,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:56,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-08 08:01:56,103 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:56,103 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-08 08:01:56,162 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:56,162 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-08 08:01:56,176 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-08 08:01:56,200 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-08 08:01:56,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:56,208 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2040 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2040) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 08:01:56,236 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2039))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2040)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 08:01:56,267 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2038))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2040)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 08:01:56,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2038))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2040)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 08:01:56,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54175632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:56,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-02-08 08:01:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750317309] [2025-02-08 08:01:56,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:56,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 08:01:56,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:56,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 08:01:56,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=667, Unknown=34, NotChecked=228, Total=1056 [2025-02-08 08:01:56,355 INFO L87 Difference]: Start difference. First operand 930 states and 1076 transitions. Second operand has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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-08 08:01:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:58,120 INFO L93 Difference]: Finished difference Result 932 states and 1080 transitions. [2025-02-08 08:01:58,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 08:01:58,121 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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 103 [2025-02-08 08:01:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:58,122 INFO L225 Difference]: With dead ends: 932 [2025-02-08 08:01:58,122 INFO L226 Difference]: Without dead ends: 932 [2025-02-08 08:01:58,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=822, Unknown=36, NotChecked=252, Total=1260 [2025-02-08 08:01:58,123 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 683 mSDsluCounter, 5535 mSDsCounter, 0 mSdLazyCounter, 4247 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 6007 SdHoareTripleChecker+Invalid, 4261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:58,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 6007 Invalid, 4261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4247 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 08:01:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-08 08:01:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 929. [2025-02-08 08:01:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 702 states have (on average 1.5213675213675213) internal successors, (1068), 922 states have internal predecessors, (1068), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:01:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1075 transitions. [2025-02-08 08:01:58,131 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1075 transitions. Word has length 103 [2025-02-08 08:01:58,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:58,132 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1075 transitions. [2025-02-08 08:01:58,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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-08 08:01:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1075 transitions. [2025-02-08 08:01:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 08:01:58,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:58,132 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, 1, 1, 1, 1] [2025-02-08 08:01:58,143 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-08 08:01:58,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:58,333 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:01:58,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:58,333 INFO L85 PathProgramCache]: Analyzing trace with hash -756537792, now seen corresponding path program 1 times [2025-02-08 08:01:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:58,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810781121] [2025-02-08 08:01:58,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:58,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:58,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 08:01:58,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 08:01:58,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:58,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:58,948 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-08 08:01:58,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:58,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810781121] [2025-02-08 08:01:58,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810781121] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:58,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493654909] [2025-02-08 08:01:58,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:58,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:01:58,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:58,951 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-08 08:01:58,952 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-08 08:01:59,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 08:01:59,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 08:01:59,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:59,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:59,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 08:01:59,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:01:59,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:01:59,259 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-08 08:01:59,265 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:01:59,265 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-08 08:01:59,274 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-08 08:01:59,278 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-08 08:01:59,331 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-08 08:01:59,335 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-08 08:01:59,428 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:59,428 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-08 08:01:59,432 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-08 08:01:59,498 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:59,498 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-08 08:01:59,507 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-08 08:01:59,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:59,547 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-08 08:01:59,551 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-08 08:01:59,594 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:01:59,594 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-08 08:01:59,599 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-08 08:01:59,610 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-08 08:01:59,612 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-08 08:01:59,615 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-08 08:01:59,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:01:59,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 08:01:59,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int))) (<= (+ 24 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2222 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 08:01:59,683 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2220) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2221))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2220) .cse1 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 08:01:59,697 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2220) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2221))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2220) .cse2 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-02-08 08:01:59,720 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2219))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2218) .cse0 v_ArrVal_2220) (select (select (store .cse1 .cse0 v_ArrVal_2221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2222))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2219))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2221))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 24 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2218) .cse3 v_ArrVal_2220) .cse4 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 08:01:59,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2219))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2218) .cse1 v_ArrVal_2220) (select (select (store .cse2 .cse1 v_ArrVal_2221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2222))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2219))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2221))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2218) .cse4 v_ArrVal_2220) .cse5 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2025-02-08 08:01:59,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2229))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2219))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2221))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2228) .cse0 v_ArrVal_2218) .cse1 v_ArrVal_2220) .cse2 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2229))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2219))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2228) .cse7 v_ArrVal_2218) .cse8 v_ArrVal_2220) (select (select (store .cse9 .cse8 v_ArrVal_2221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2222))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2025-02-08 08:01:59,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493654909] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:01:59,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:01:59,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2025-02-08 08:01:59,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172264443] [2025-02-08 08:01:59,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:01:59,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 08:01:59,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:59,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 08:01:59,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=432, Unknown=7, NotChecked=336, Total=870 [2025-02-08 08:01:59,826 INFO L87 Difference]: Start difference. First operand 929 states and 1075 transitions. Second operand has 21 states, 18 states have (on average 8.666666666666666) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:02:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:02,018 INFO L93 Difference]: Finished difference Result 931 states and 1079 transitions. [2025-02-08 08:02:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:02:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.666666666666666) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2025-02-08 08:02:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:02,020 INFO L225 Difference]: With dead ends: 931 [2025-02-08 08:02:02,020 INFO L226 Difference]: Without dead ends: 931 [2025-02-08 08:02:02,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=741, Unknown=7, NotChecked=434, Total=1332 [2025-02-08 08:02:02,021 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 690 mSDsluCounter, 4380 mSDsCounter, 0 mSdLazyCounter, 4602 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 4616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:02,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 4855 Invalid, 4616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4602 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 08:02:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-08 08:02:02,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 913. [2025-02-08 08:02:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 688 states have (on average 1.5290697674418605) internal successors, (1052), 907 states have internal predecessors, (1052), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:02:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1058 transitions. [2025-02-08 08:02:02,027 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1058 transitions. Word has length 103 [2025-02-08 08:02:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:02,027 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1058 transitions. [2025-02-08 08:02:02,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.666666666666666) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:02:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1058 transitions. [2025-02-08 08:02:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-08 08:02:02,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:02,028 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:02:02,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:02:02,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:02,228 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:02:02,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash -601433977, now seen corresponding path program 1 times [2025-02-08 08:02:02,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:02,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828110568] [2025-02-08 08:02:02,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:02,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 08:02:02,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 08:02:02,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:02,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:02,788 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-08 08:02:02,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:02,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828110568] [2025-02-08 08:02:02,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828110568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:02,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:02,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 08:02:02,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8501116] [2025-02-08 08:02:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:02,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 08:02:02,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:02,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 08:02:02,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-08 08:02:02,789 INFO L87 Difference]: Start difference. First operand 913 states and 1058 transitions. Second operand has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 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-08 08:02:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:04,447 INFO L93 Difference]: Finished difference Result 936 states and 1084 transitions. [2025-02-08 08:02:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 08:02:04,447 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 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 106 [2025-02-08 08:02:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:04,449 INFO L225 Difference]: With dead ends: 936 [2025-02-08 08:02:04,449 INFO L226 Difference]: Without dead ends: 936 [2025-02-08 08:02:04,449 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-08 08:02:04,449 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 737 mSDsluCounter, 5072 mSDsCounter, 0 mSdLazyCounter, 3954 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 5544 SdHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:04,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 5544 Invalid, 3969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3954 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 08:02:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-02-08 08:02:04,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 932. [2025-02-08 08:02:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 706 states have (on average 1.518413597733711) internal successors, (1072), 925 states have internal predecessors, (1072), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:02:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1079 transitions. [2025-02-08 08:02:04,456 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1079 transitions. Word has length 106 [2025-02-08 08:02:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:04,457 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1079 transitions. [2025-02-08 08:02:04,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 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-08 08:02:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1079 transitions. [2025-02-08 08:02:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-08 08:02:04,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:04,458 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:02:04,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 08:02:04,458 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:02:04,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash -601433976, now seen corresponding path program 1 times [2025-02-08 08:02:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107189820] [2025-02-08 08:02:04,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:04,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:04,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 08:02:04,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 08:02:04,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:04,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:05,234 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-08 08:02:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:05,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107189820] [2025-02-08 08:02:05,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107189820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:05,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:05,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 08:02:05,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783041313] [2025-02-08 08:02:05,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:05,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:02:05,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:05,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:02:05,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-08 08:02:05,236 INFO L87 Difference]: Start difference. First operand 932 states and 1079 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 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-08 08:02:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:07,505 INFO L93 Difference]: Finished difference Result 935 states and 1083 transitions. [2025-02-08 08:02:07,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 08:02:07,505 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 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 106 [2025-02-08 08:02:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:07,506 INFO L225 Difference]: With dead ends: 935 [2025-02-08 08:02:07,506 INFO L226 Difference]: Without dead ends: 935 [2025-02-08 08:02:07,507 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-08 08:02:07,507 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 717 mSDsluCounter, 4246 mSDsCounter, 0 mSdLazyCounter, 4749 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 4719 SdHoareTripleChecker+Invalid, 4767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:07,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 4719 Invalid, 4767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4749 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 08:02:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-02-08 08:02:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 932. [2025-02-08 08:02:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 706 states have (on average 1.5169971671388103) internal successors, (1071), 925 states have internal predecessors, (1071), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:02:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1078 transitions. [2025-02-08 08:02:07,513 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1078 transitions. Word has length 106 [2025-02-08 08:02:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:07,513 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1078 transitions. [2025-02-08 08:02:07,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 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-08 08:02:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1078 transitions. [2025-02-08 08:02:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 08:02:07,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:07,514 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:02:07,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 08:02:07,515 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:02:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash 997159225, now seen corresponding path program 1 times [2025-02-08 08:02:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16446986] [2025-02-08 08:02:07,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:07,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:07,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 08:02:07,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 08:02:07,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:07,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:08,100 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-08 08:02:08,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:08,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16446986] [2025-02-08 08:02:08,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16446986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:08,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175697770] [2025-02-08 08:02:08,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:08,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:08,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:08,103 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-08 08:02:08,104 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-08 08:02:08,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 08:02:08,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 08:02:08,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:08,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:08,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 08:02:08,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:08,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:02:08,451 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:02:08,452 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-08 08:02:08,484 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-08 08:02:08,539 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-08 08:02:08,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:08,638 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-08 08:02:08,709 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:08,709 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-08 08:02:08,769 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:08,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-08 08:02:08,814 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:08,815 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-08 08:02:08,860 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:08,860 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-08 08:02:08,869 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-08 08:02:08,918 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-02-08 08:02:08,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-02-08 08:02:08,923 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-08 08:02:08,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175697770] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:09,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:09,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2025-02-08 08:02:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008694802] [2025-02-08 08:02:09,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:09,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 08:02:09,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:09,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 08:02:09,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1231, Unknown=56, NotChecked=0, Total=1482 [2025-02-08 08:02:09,507 INFO L87 Difference]: Start difference. First operand 932 states and 1078 transitions. Second operand has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 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-08 08:02:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:11,061 INFO L93 Difference]: Finished difference Result 934 states and 1082 transitions. [2025-02-08 08:02:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 08:02:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 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 107 [2025-02-08 08:02:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:11,063 INFO L225 Difference]: With dead ends: 934 [2025-02-08 08:02:11,063 INFO L226 Difference]: Without dead ends: 934 [2025-02-08 08:02:11,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=1444, Unknown=56, NotChecked=0, Total=1722 [2025-02-08 08:02:11,064 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 679 mSDsluCounter, 4143 mSDsCounter, 0 mSdLazyCounter, 3348 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 3365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:11,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 4614 Invalid, 3365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3348 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 08:02:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-08 08:02:11,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 931. [2025-02-08 08:02:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 706 states have (on average 1.5155807365439093) internal successors, (1070), 924 states have internal predecessors, (1070), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:02:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1077 transitions. [2025-02-08 08:02:11,072 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1077 transitions. Word has length 107 [2025-02-08 08:02:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:11,072 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1077 transitions. [2025-02-08 08:02:11,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 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-08 08:02:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1077 transitions. [2025-02-08 08:02:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 08:02:11,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:11,073 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:02:11,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 08:02:11,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:11,273 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-02-08 08:02:11,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash 997159226, now seen corresponding path program 1 times [2025-02-08 08:02:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:11,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599201201] [2025-02-08 08:02:11,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:11,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 08:02:11,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 08:02:11,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:11,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:12,066 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-08 08:02:12,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599201201] [2025-02-08 08:02:12,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599201201] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607707202] [2025-02-08 08:02:12,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:12,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:12,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:12,068 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-08 08:02:12,069 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-08 08:02:12,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 08:02:12,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 08:02:12,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:12,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:12,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-08 08:02:12,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:12,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:02:12,399 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-08 08:02:12,417 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:02:12,417 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-08 08:02:12,460 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-08 08:02:12,464 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-08 08:02:12,544 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-08 08:02:12,547 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-08 08:02:12,677 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:12,677 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-08 08:02:12,684 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-08 08:02:12,804 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:12,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-08 08:02:12,813 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-08 08:02:12,898 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:12,898 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-08 08:02:12,906 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-08 08:02:12,992 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:12,992 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-08 08:02:12,997 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-08 08:02:13,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:13,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 73 treesize of output 66 [2025-02-08 08:02:13,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-08 08:02:13,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-02-08 08:02:13,125 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-08 08:02:13,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:02:13,180 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-08 08:02:13,194 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 08:02:13,195 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-08 08:02:13,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-08 08:02:13,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:14,008 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2789))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2792))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2790) .cse0 v_ArrVal_2791) .cse1 v_ArrVal_2794) (select (select (store .cse2 .cse1 v_ArrVal_2793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2796))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2789 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2797 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2789))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2792))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2793))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2790) .cse5 v_ArrVal_2791) .cse6 v_ArrVal_2794) .cse7 v_ArrVal_2796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2797) (select (select (store .cse8 .cse7 v_ArrVal_2795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false