./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-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 ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:20:12,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:20:12,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:20:12,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:20:12,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:20:12,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:20:12,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:20:12,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:20:12,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:20:12,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:20:12,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:20:12,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:20:12,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:20:12,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:20:12,850 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:20:12,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:20:12,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:20:12,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:20:12,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:20:12,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:20:12,851 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:20:12,851 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:20:12,852 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:20:12,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:20:12,853 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:20:12,853 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:20:12,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:20:12,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:20:12,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:20:12,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:20:12,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:20:12,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:20:12,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:20:12,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:20:12,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:20:12,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:20:12,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:20:12,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:20:12,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:20:12,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:20:12,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:20:12,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:20:12,854 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 -> ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 [2025-02-06 12:20:13,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:20:13,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:20:13,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:20:13,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:20:13,135 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:20:13,136 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_OAT_test1-1.i [2025-02-06 12:20:14,431 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0df2e8f74/6cb0132f66ee4c309efd5f10c1e97473/FLAG098032abc [2025-02-06 12:20:14,778 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:20:14,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2025-02-06 12:20:14,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0df2e8f74/6cb0132f66ee4c309efd5f10c1e97473/FLAG098032abc [2025-02-06 12:20:14,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0df2e8f74/6cb0132f66ee4c309efd5f10c1e97473 [2025-02-06 12:20:14,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:20:14,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:20:14,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:20:14,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:20:14,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:20:14,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:20:14" (1/1) ... [2025-02-06 12:20:14,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6798beae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:14, skipping insertion in model container [2025-02-06 12:20:14,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:20:14" (1/1) ... [2025-02-06 12:20:14,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:20:15,232 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:20:15,273 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:20:15,276 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:20:15,281 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:20:15,287 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:20:15,299 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:20:15,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:20:15,317 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:20:15,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:20:15,428 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:20:15,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15 WrapperNode [2025-02-06 12:20:15,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:20:15,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:20:15,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:20:15,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:20:15,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,495 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 823 [2025-02-06 12:20:15,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:20:15,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:20:15,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:20:15,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:20:15,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,577 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-02-06 12:20:15,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:20:15,632 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:20:15,632 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:20:15,632 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:20:15,633 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (1/1) ... [2025-02-06 12:20:15,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:20:15,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:20:15,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:20:15,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:20:15,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 12:20:15,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 12:20:15,688 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 12:20:15,688 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:20:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:20:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:20:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:20:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:20:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:20:15,840 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:20:15,842 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:20:17,480 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2025-02-06 12:20:17,480 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:20:17,548 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:20:17,548 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 12:20:17,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:20:17 BoogieIcfgContainer [2025-02-06 12:20:17,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:20:17,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:20:17,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:20:17,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:20:17,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:20:14" (1/3) ... [2025-02-06 12:20:17,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645314d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:20:17, skipping insertion in model container [2025-02-06 12:20:17,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:20:15" (2/3) ... [2025-02-06 12:20:17,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645314d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:20:17, skipping insertion in model container [2025-02-06 12:20:17,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:20:17" (3/3) ... [2025-02-06 12:20:17,560 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test1-1.i [2025-02-06 12:20:17,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:20:17,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test1-1.i that has 4 procedures, 765 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2025-02-06 12:20:17,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:20:17,648 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;@ef73d20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:20:17,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2025-02-06 12:20:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 760 states, 427 states have (on average 2.0468384074941453) internal successors, (874), 754 states have internal predecessors, (874), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 12:20:17,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:17,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:20:17,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:17,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash 918009568, now seen corresponding path program 1 times [2025-02-06 12:20:17,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:17,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062082575] [2025-02-06 12:20:17,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:17,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:17,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:20:17,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:20:17,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:17,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:17,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:17,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062082575] [2025-02-06 12:20:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062082575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:17,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:17,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:20:17,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397088975] [2025-02-06 12:20:17,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:17,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:20:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:17,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:20:17,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:20:17,811 INFO L87 Difference]: Start difference. First operand has 760 states, 427 states have (on average 2.0468384074941453) internal successors, (874), 754 states have internal predecessors, (874), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:17,917 INFO L93 Difference]: Finished difference Result 750 states and 857 transitions. [2025-02-06 12:20:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:20:17,919 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 12:20:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:17,935 INFO L225 Difference]: With dead ends: 750 [2025-02-06 12:20:17,936 INFO L226 Difference]: Without dead ends: 748 [2025-02-06 12:20:17,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:20:17,939 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:17,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 835 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:20:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-02-06 12:20:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2025-02-06 12:20:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 421 states have (on average 1.9691211401425177) internal successors, (829), 742 states have internal predecessors, (829), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 855 transitions. [2025-02-06 12:20:18,015 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 855 transitions. Word has length 5 [2025-02-06 12:20:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:18,015 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 855 transitions. [2025-02-06 12:20:18,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 855 transitions. [2025-02-06 12:20:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 12:20:18,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:18,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:20:18,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:20:18,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:18,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash 918009599, now seen corresponding path program 1 times [2025-02-06 12:20:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:18,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191560495] [2025-02-06 12:20:18,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:18,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:20:18,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:20:18,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:18,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:18,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:18,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191560495] [2025-02-06 12:20:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191560495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:18,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:18,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:20:18,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969657063] [2025-02-06 12:20:18,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:18,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:20:18,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:18,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:20:18,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:20:18,117 INFO L87 Difference]: Start difference. First operand 748 states and 855 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:18,683 INFO L93 Difference]: Finished difference Result 700 states and 808 transitions. [2025-02-06 12:20:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:20:18,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 12:20:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:18,687 INFO L225 Difference]: With dead ends: 700 [2025-02-06 12:20:18,687 INFO L226 Difference]: Without dead ends: 700 [2025-02-06 12:20:18,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:20:18,688 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 700 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:18,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 484 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:20:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-02-06 12:20:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 699. [2025-02-06 12:20:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 421 states have (on average 1.852731591448931) internal successors, (780), 693 states have internal predecessors, (780), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 806 transitions. [2025-02-06 12:20:18,723 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 806 transitions. Word has length 5 [2025-02-06 12:20:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:18,723 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 806 transitions. [2025-02-06 12:20:18,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 806 transitions. [2025-02-06 12:20:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 12:20:18,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:18,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:20:18,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:20:18,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:18,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash 918009600, now seen corresponding path program 1 times [2025-02-06 12:20:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:18,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571142195] [2025-02-06 12:20:18,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:18,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:20:18,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:20:18,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:18,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:18,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:18,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571142195] [2025-02-06 12:20:18,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571142195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:18,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:18,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:20:18,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679501223] [2025-02-06 12:20:18,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:18,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:20:18,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:18,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:20:18,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:20:18,825 INFO L87 Difference]: Start difference. First operand 699 states and 806 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:19,292 INFO L93 Difference]: Finished difference Result 778 states and 891 transitions. [2025-02-06 12:20:19,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:20:19,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 12:20:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:19,296 INFO L225 Difference]: With dead ends: 778 [2025-02-06 12:20:19,296 INFO L226 Difference]: Without dead ends: 778 [2025-02-06 12:20:19,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:20:19,300 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 414 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:19,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 889 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:20:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-02-06 12:20:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 731. [2025-02-06 12:20:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 463 states have (on average 1.838012958963283) internal successors, (851), 725 states have internal predecessors, (851), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 877 transitions. [2025-02-06 12:20:19,316 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 877 transitions. Word has length 5 [2025-02-06 12:20:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:19,317 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 877 transitions. [2025-02-06 12:20:19,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 877 transitions. [2025-02-06 12:20:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 12:20:19,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:19,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:20:19,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:20:19,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:19,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:19,318 INFO L85 PathProgramCache]: Analyzing trace with hash 917171508, now seen corresponding path program 1 times [2025-02-06 12:20:19,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:19,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344421430] [2025-02-06 12:20:19,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:19,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:19,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:20:19,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:20:19,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:19,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:19,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344421430] [2025-02-06 12:20:19,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344421430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:19,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:19,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:20:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112079623] [2025-02-06 12:20:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:19,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:20:19,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:19,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:20:19,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:20:19,352 INFO L87 Difference]: Start difference. First operand 731 states and 877 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:19,434 INFO L93 Difference]: Finished difference Result 1414 states and 1686 transitions. [2025-02-06 12:20:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:20:19,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 12:20:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:19,440 INFO L225 Difference]: With dead ends: 1414 [2025-02-06 12:20:19,440 INFO L226 Difference]: Without dead ends: 1414 [2025-02-06 12:20:19,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:20:19,441 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 721 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:19,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1764 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:20:19,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-02-06 12:20:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 732. [2025-02-06 12:20:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 464 states have (on average 1.8362068965517242) internal successors, (852), 726 states have internal predecessors, (852), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 878 transitions. [2025-02-06 12:20:19,463 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 878 transitions. Word has length 5 [2025-02-06 12:20:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:19,463 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 878 transitions. [2025-02-06 12:20:19,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 878 transitions. [2025-02-06 12:20:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 12:20:19,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:19,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:19,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:20:19,464 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:19,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1783770536, now seen corresponding path program 1 times [2025-02-06 12:20:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652275952] [2025-02-06 12:20:19,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:19,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:20:19,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:20:19,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:19,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652275952] [2025-02-06 12:20:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652275952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:19,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:19,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:20:19,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883135722] [2025-02-06 12:20:19,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:19,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:20:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:19,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:20:19,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:20:19,556 INFO L87 Difference]: Start difference. First operand 732 states and 878 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:20,147 INFO L93 Difference]: Finished difference Result 758 states and 931 transitions. [2025-02-06 12:20:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:20:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 12:20:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:20,151 INFO L225 Difference]: With dead ends: 758 [2025-02-06 12:20:20,151 INFO L226 Difference]: Without dead ends: 758 [2025-02-06 12:20:20,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:20:20,152 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 967 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:20,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 760 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:20:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-02-06 12:20:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 709. [2025-02-06 12:20:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 464 states have (on average 1.7866379310344827) internal successors, (829), 703 states have internal predecessors, (829), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 855 transitions. [2025-02-06 12:20:20,167 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 855 transitions. Word has length 11 [2025-02-06 12:20:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:20,167 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 855 transitions. [2025-02-06 12:20:20,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 855 transitions. [2025-02-06 12:20:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 12:20:20,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:20,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:20,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:20:20,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:20,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1783770535, now seen corresponding path program 1 times [2025-02-06 12:20:20,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:20,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869802104] [2025-02-06 12:20:20,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:20,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:20,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:20:20,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:20:20,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:20,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869802104] [2025-02-06 12:20:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869802104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:20:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301346443] [2025-02-06 12:20:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:20,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:20:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:20,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:20:20,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:20:20,268 INFO L87 Difference]: Start difference. First operand 709 states and 855 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:20,313 INFO L93 Difference]: Finished difference Result 634 states and 752 transitions. [2025-02-06 12:20:20,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:20:20,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 12:20:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:20,316 INFO L225 Difference]: With dead ends: 634 [2025-02-06 12:20:20,316 INFO L226 Difference]: Without dead ends: 634 [2025-02-06 12:20:20,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:20:20,317 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 60 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:20,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1239 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:20:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-02-06 12:20:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2025-02-06 12:20:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 401 states have (on average 1.8104738154613467) internal successors, (726), 628 states have internal predecessors, (726), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 752 transitions. [2025-02-06 12:20:20,329 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 752 transitions. Word has length 11 [2025-02-06 12:20:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:20,330 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 752 transitions. [2025-02-06 12:20:20,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 752 transitions. [2025-02-06 12:20:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 12:20:20,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:20,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:20,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:20:20,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr290REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:20,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash 537564026, now seen corresponding path program 1 times [2025-02-06 12:20:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:20,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049690167] [2025-02-06 12:20:20,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:20,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:20:20,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:20:20,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:20,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049690167] [2025-02-06 12:20:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049690167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:20,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:20:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399905819] [2025-02-06 12:20:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:20,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:20:20,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:20,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:20:20,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:20:20,410 INFO L87 Difference]: Start difference. First operand 634 states and 752 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:20,503 INFO L93 Difference]: Finished difference Result 616 states and 727 transitions. [2025-02-06 12:20:20,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:20:20,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 12:20:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:20,507 INFO L225 Difference]: With dead ends: 616 [2025-02-06 12:20:20,507 INFO L226 Difference]: Without dead ends: 616 [2025-02-06 12:20:20,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:20:20,507 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 41 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:20,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1805 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:20:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-02-06 12:20:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2025-02-06 12:20:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 387 states have (on average 1.8036175710594315) internal successors, (698), 607 states have internal predecessors, (698), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 724 transitions. [2025-02-06 12:20:20,523 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 724 transitions. Word has length 12 [2025-02-06 12:20:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:20,523 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 724 transitions. [2025-02-06 12:20:20,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 724 transitions. [2025-02-06 12:20:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 12:20:20,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:20,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:20,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:20:20,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr276REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1405424880, now seen corresponding path program 1 times [2025-02-06 12:20:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:20,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425881555] [2025-02-06 12:20:20,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:20,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:20:20,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:20:20,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:20,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:20,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-06 12:20:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:20,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425881555] [2025-02-06 12:20:20,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425881555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:20,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:20,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:20:20,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663107053] [2025-02-06 12:20:20,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:20,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:20:20,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:20,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:20:20,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:20:20,715 INFO L87 Difference]: Start difference. First operand 613 states and 724 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:21,310 INFO L93 Difference]: Finished difference Result 705 states and 810 transitions. [2025-02-06 12:20:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:20:21,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 12:20:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:21,313 INFO L225 Difference]: With dead ends: 705 [2025-02-06 12:20:21,313 INFO L226 Difference]: Without dead ends: 705 [2025-02-06 12:20:21,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:20:21,314 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 419 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:21,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1112 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:20:21,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-06 12:20:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 609. [2025-02-06 12:20:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 387 states have (on average 1.79328165374677) internal successors, (694), 603 states have internal predecessors, (694), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 720 transitions. [2025-02-06 12:20:21,330 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 720 transitions. Word has length 26 [2025-02-06 12:20:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:21,330 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 720 transitions. [2025-02-06 12:20:21,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 720 transitions. [2025-02-06 12:20:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 12:20:21,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:21,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:21,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:20:21,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr262REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:21,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash -575605896, now seen corresponding path program 1 times [2025-02-06 12:20:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:21,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235185478] [2025-02-06 12:20:21,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:21,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:21,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 12:20:21,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 12:20:21,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:21,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:21,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235185478] [2025-02-06 12:20:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235185478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:21,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:21,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:20:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074824872] [2025-02-06 12:20:21,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:21,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:20:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:21,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:20:21,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:20:21,456 INFO L87 Difference]: Start difference. First operand 609 states and 720 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:21,531 INFO L93 Difference]: Finished difference Result 609 states and 716 transitions. [2025-02-06 12:20:21,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:20:21,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-06 12:20:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:21,535 INFO L225 Difference]: With dead ends: 609 [2025-02-06 12:20:21,535 INFO L226 Difference]: Without dead ends: 609 [2025-02-06 12:20:21,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:20:21,536 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 21 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:21,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1787 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:20:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-02-06 12:20:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2025-02-06 12:20:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 387 states have (on average 1.7829457364341086) internal successors, (690), 603 states have internal predecessors, (690), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 716 transitions. [2025-02-06 12:20:21,550 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 716 transitions. Word has length 61 [2025-02-06 12:20:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:21,550 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 716 transitions. [2025-02-06 12:20:21,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 716 transitions. [2025-02-06 12:20:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 12:20:21,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:21,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:21,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:20:21,553 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr262REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:21,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash 794004016, now seen corresponding path program 1 times [2025-02-06 12:20:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:21,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137868175] [2025-02-06 12:20:21,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:21,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 12:20:21,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 12:20:21,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:21,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:21,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:21,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137868175] [2025-02-06 12:20:21,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137868175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:21,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:21,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:20:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442099524] [2025-02-06 12:20:21,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:21,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:20:21,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:21,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:20:21,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:20:21,701 INFO L87 Difference]: Start difference. First operand 609 states and 716 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:21,777 INFO L93 Difference]: Finished difference Result 701 states and 835 transitions. [2025-02-06 12:20:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:20:21,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-06 12:20:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:21,780 INFO L225 Difference]: With dead ends: 701 [2025-02-06 12:20:21,780 INFO L226 Difference]: Without dead ends: 701 [2025-02-06 12:20:21,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:20:21,781 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 54 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:21,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1212 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:20:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-02-06 12:20:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2025-02-06 12:20:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 479 states have (on average 1.6889352818371608) internal successors, (809), 695 states have internal predecessors, (809), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 835 transitions. [2025-02-06 12:20:21,796 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 835 transitions. Word has length 69 [2025-02-06 12:20:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:21,796 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 835 transitions. [2025-02-06 12:20:21,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 835 transitions. [2025-02-06 12:20:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 12:20:21,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:21,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:21,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:20:21,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr232REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:21,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:21,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1786910347, now seen corresponding path program 1 times [2025-02-06 12:20:21,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:21,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159850104] [2025-02-06 12:20:21,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:21,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:21,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 12:20:21,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 12:20:21,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:21,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159850104] [2025-02-06 12:20:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159850104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:22,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:22,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:20:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645432607] [2025-02-06 12:20:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:22,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:20:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:22,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:20:22,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:20:22,371 INFO L87 Difference]: Start difference. First operand 701 states and 835 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:22,953 INFO L93 Difference]: Finished difference Result 663 states and 797 transitions. [2025-02-06 12:20:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:20:22,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 12:20:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:22,956 INFO L225 Difference]: With dead ends: 663 [2025-02-06 12:20:22,956 INFO L226 Difference]: Without dead ends: 663 [2025-02-06 12:20:22,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:20:22,957 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 919 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:22,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 517 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:20:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-02-06 12:20:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 621. [2025-02-06 12:20:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 437 states have (on average 1.5789473684210527) internal successors, (690), 615 states have internal predecessors, (690), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 716 transitions. [2025-02-06 12:20:22,969 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 716 transitions. Word has length 72 [2025-02-06 12:20:22,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:22,970 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 716 transitions. [2025-02-06 12:20:22,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 716 transitions. [2025-02-06 12:20:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:20:22,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:22,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:22,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:20:22,972 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:22,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:22,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1785397946, now seen corresponding path program 1 times [2025-02-06 12:20:22,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:22,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444024507] [2025-02-06 12:20:22,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:22,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:22,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 12:20:23,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:20:23,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:23,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:23,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:23,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444024507] [2025-02-06 12:20:23,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444024507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:23,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:23,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:20:23,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032574713] [2025-02-06 12:20:23,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:23,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:20:23,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:23,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:20:23,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:20:23,227 INFO L87 Difference]: Start difference. First operand 621 states and 716 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:23,750 INFO L93 Difference]: Finished difference Result 620 states and 715 transitions. [2025-02-06 12:20:23,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:20:23,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-06 12:20:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:23,753 INFO L225 Difference]: With dead ends: 620 [2025-02-06 12:20:23,753 INFO L226 Difference]: Without dead ends: 620 [2025-02-06 12:20:23,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:20:23,755 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 2 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:23,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1625 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:20:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-02-06 12:20:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2025-02-06 12:20:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 437 states have (on average 1.5766590389016018) internal successors, (689), 614 states have internal predecessors, (689), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2025-02-06 12:20:23,766 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 77 [2025-02-06 12:20:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:23,767 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2025-02-06 12:20:23,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2025-02-06 12:20:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:20:23,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:23,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:23,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:20:23,769 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr226REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:23,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1785397947, now seen corresponding path program 1 times [2025-02-06 12:20:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:23,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995964082] [2025-02-06 12:20:23,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:23,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:23,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 12:20:23,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:20:23,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:23,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995964082] [2025-02-06 12:20:24,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995964082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:24,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:24,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:20:24,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113432924] [2025-02-06 12:20:24,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:24,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:20:24,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:24,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:20:24,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:20:24,228 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:24,780 INFO L93 Difference]: Finished difference Result 619 states and 714 transitions. [2025-02-06 12:20:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:20:24,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-06 12:20:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:24,782 INFO L225 Difference]: With dead ends: 619 [2025-02-06 12:20:24,782 INFO L226 Difference]: Without dead ends: 619 [2025-02-06 12:20:24,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:20:24,783 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 1 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:24,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1632 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:20:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-02-06 12:20:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2025-02-06 12:20:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 436 states have (on average 1.5779816513761469) internal successors, (688), 613 states have internal predecessors, (688), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 714 transitions. [2025-02-06 12:20:24,794 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 714 transitions. Word has length 77 [2025-02-06 12:20:24,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:24,794 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 714 transitions. [2025-02-06 12:20:24,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:20:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 714 transitions. [2025-02-06 12:20:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 12:20:24,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:24,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:24,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:20:24,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:24,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1895810487, now seen corresponding path program 1 times [2025-02-06 12:20:24,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:24,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472388792] [2025-02-06 12:20:24,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:24,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 12:20:24,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 12:20:24,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:24,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:25,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472388792] [2025-02-06 12:20:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472388792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:25,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:25,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:20:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955476682] [2025-02-06 12:20:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:25,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:20:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:25,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:20:25,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:20:25,011 INFO L87 Difference]: Start difference. First operand 619 states and 714 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:25,765 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2025-02-06 12:20:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:20:25,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-02-06 12:20:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:25,769 INFO L225 Difference]: With dead ends: 631 [2025-02-06 12:20:25,770 INFO L226 Difference]: Without dead ends: 631 [2025-02-06 12:20:25,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:20:25,771 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 12 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:25,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2429 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:20:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-06 12:20:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 625. [2025-02-06 12:20:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 441 states have (on average 1.5759637188208617) internal successors, (695), 618 states have internal predecessors, (695), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2025-02-06 12:20:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 724 transitions. [2025-02-06 12:20:25,805 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 724 transitions. Word has length 85 [2025-02-06 12:20:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:25,806 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 724 transitions. [2025-02-06 12:20:25,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 724 transitions. [2025-02-06 12:20:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 12:20:25,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:25,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:25,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:20:25,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr222REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:25,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1895810488, now seen corresponding path program 1 times [2025-02-06 12:20:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:25,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867512170] [2025-02-06 12:20:25,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:25,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 12:20:25,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 12:20:25,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:25,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:26,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:26,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867512170] [2025-02-06 12:20:26,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867512170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:26,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:26,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:20:26,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363200056] [2025-02-06 12:20:26,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:26,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:20:26,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:26,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:20:26,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:20:26,318 INFO L87 Difference]: Start difference. First operand 625 states and 724 transitions. Second operand has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:27,023 INFO L93 Difference]: Finished difference Result 625 states and 723 transitions. [2025-02-06 12:20:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:20:27,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-02-06 12:20:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:27,025 INFO L225 Difference]: With dead ends: 625 [2025-02-06 12:20:27,025 INFO L226 Difference]: Without dead ends: 625 [2025-02-06 12:20:27,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:20:27,025 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 7 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:27,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2017 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:20:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-02-06 12:20:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2025-02-06 12:20:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 441 states have (on average 1.5736961451247165) internal successors, (694), 618 states have internal predecessors, (694), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2025-02-06 12:20:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 723 transitions. [2025-02-06 12:20:27,038 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 723 transitions. Word has length 85 [2025-02-06 12:20:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:27,038 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 723 transitions. [2025-02-06 12:20:27,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 723 transitions. [2025-02-06 12:20:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 12:20:27,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:27,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:27,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:20:27,039 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:27,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:27,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1084668689, now seen corresponding path program 1 times [2025-02-06 12:20:27,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:27,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960753188] [2025-02-06 12:20:27,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:27,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:27,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:20:27,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:20:27,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:27,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960753188] [2025-02-06 12:20:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960753188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:27,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035675106] [2025-02-06 12:20:27,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:27,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:20:27,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:20:27,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:20:27,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:20:27,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:20:27,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:20:27,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:27,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:27,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 12:20:27,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:20:27,786 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:20:27,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:20:27,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:20:27,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:27,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:20:27,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:20:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:27,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:20:27,979 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-06 12:20:27,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 12:20:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035675106] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:28,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:20:28,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2025-02-06 12:20:28,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158638946] [2025-02-06 12:20:28,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:20:28,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:20:28,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:28,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:20:28,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=169, Unknown=6, NotChecked=0, Total=210 [2025-02-06 12:20:28,014 INFO L87 Difference]: Start difference. First operand 625 states and 723 transitions. Second operand has 14 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:20:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:29,448 INFO L93 Difference]: Finished difference Result 624 states and 722 transitions. [2025-02-06 12:20:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:20:29,448 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2025-02-06 12:20:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:29,451 INFO L225 Difference]: With dead ends: 624 [2025-02-06 12:20:29,451 INFO L226 Difference]: Without dead ends: 624 [2025-02-06 12:20:29,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=372, Unknown=6, NotChecked=0, Total=462 [2025-02-06 12:20:29,452 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 506 mSDsluCounter, 2815 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:29,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 3163 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:20:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-02-06 12:20:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2025-02-06 12:20:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 441 states have (on average 1.5714285714285714) internal successors, (693), 617 states have internal predecessors, (693), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2025-02-06 12:20:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 722 transitions. [2025-02-06 12:20:29,464 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 722 transitions. Word has length 86 [2025-02-06 12:20:29,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:29,464 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 722 transitions. [2025-02-06 12:20:29,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:20:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 722 transitions. [2025-02-06 12:20:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 12:20:29,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:29,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:29,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:20:29,665 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,SelfDestructingSolverStorable15 [2025-02-06 12:20:29,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr222REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:29,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1084668690, now seen corresponding path program 1 times [2025-02-06 12:20:29,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:29,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139223908] [2025-02-06 12:20:29,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:29,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:20:29,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:20:29,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:29,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139223908] [2025-02-06 12:20:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139223908] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448709613] [2025-02-06 12:20:30,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:30,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:20:30,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:20:30,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:20:30,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:20:30,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:20:30,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:20:30,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:30,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:30,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 12:20:30,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:20:30,600 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:20:30,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:20:30,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:20:30,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:20:30,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:20:30,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:20:30,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:20:30,865 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:30,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:20:30,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:20:30,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:20:30,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:20:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:30,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:20:31,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_630 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:20:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448709613] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:31,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:20:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-02-06 12:20:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11444039] [2025-02-06 12:20:31,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:20:31,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:20:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:31,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:20:31,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-02-06 12:20:31,061 INFO L87 Difference]: Start difference. First operand 624 states and 722 transitions. Second operand has 18 states, 15 states have (on average 7.4) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:20:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:33,141 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2025-02-06 12:20:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:20:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.4) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2025-02-06 12:20:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:33,144 INFO L225 Difference]: With dead ends: 631 [2025-02-06 12:20:33,144 INFO L226 Difference]: Without dead ends: 631 [2025-02-06 12:20:33,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2025-02-06 12:20:33,145 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 525 mSDsluCounter, 3115 mSDsCounter, 0 mSdLazyCounter, 4158 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 3465 SdHoareTripleChecker+Invalid, 4200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:33,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 3465 Invalid, 4200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4158 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 12:20:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-06 12:20:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 622. [2025-02-06 12:20:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 440 states have (on average 1.5704545454545455) internal successors, (691), 615 states have internal predecessors, (691), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 717 transitions. [2025-02-06 12:20:33,155 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 717 transitions. Word has length 86 [2025-02-06 12:20:33,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:33,155 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 717 transitions. [2025-02-06 12:20:33,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.4) internal successors, (111), 18 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:20:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 717 transitions. [2025-02-06 12:20:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 12:20:33,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:33,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:33,165 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-06 12:20:33,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 12:20:33,357 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:33,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:33,357 INFO L85 PathProgramCache]: Analyzing trace with hash -729225795, now seen corresponding path program 1 times [2025-02-06 12:20:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:33,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410816328] [2025-02-06 12:20:33,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:33,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 12:20:33,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 12:20:33,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:33,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:34,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:34,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410816328] [2025-02-06 12:20:34,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410816328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:34,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:34,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:20:34,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140290881] [2025-02-06 12:20:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:34,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:20:34,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:34,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:20:34,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:20:34,039 INFO L87 Difference]: Start difference. First operand 622 states and 717 transitions. Second operand has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:35,075 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2025-02-06 12:20:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:20:35,075 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-02-06 12:20:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:35,078 INFO L225 Difference]: With dead ends: 635 [2025-02-06 12:20:35,078 INFO L226 Difference]: Without dead ends: 635 [2025-02-06 12:20:35,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:20:35,078 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 508 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:35,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 2010 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 12:20:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-02-06 12:20:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2025-02-06 12:20:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 448 states have (on average 1.5647321428571428) internal successors, (701), 623 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:20:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 728 transitions. [2025-02-06 12:20:35,088 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 728 transitions. Word has length 88 [2025-02-06 12:20:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:35,089 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 728 transitions. [2025-02-06 12:20:35,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 728 transitions. [2025-02-06 12:20:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 12:20:35,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:35,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:35,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:20:35,090 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:35,091 INFO L85 PathProgramCache]: Analyzing trace with hash -729225796, now seen corresponding path program 1 times [2025-02-06 12:20:35,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:35,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526077921] [2025-02-06 12:20:35,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:35,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:35,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 12:20:35,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 12:20:35,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:35,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:35,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:35,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526077921] [2025-02-06 12:20:35,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526077921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:35,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:35,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:20:35,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017981971] [2025-02-06 12:20:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:35,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:20:35,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:35,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:20:35,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:20:35,537 INFO L87 Difference]: Start difference. First operand 631 states and 728 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:36,392 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2025-02-06 12:20:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:20:36,392 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-02-06 12:20:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:36,396 INFO L225 Difference]: With dead ends: 634 [2025-02-06 12:20:36,396 INFO L226 Difference]: Without dead ends: 634 [2025-02-06 12:20:36,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:20:36,397 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 525 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:36,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2253 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:20:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-02-06 12:20:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2025-02-06 12:20:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 448 states have (on average 1.5625) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:20:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2025-02-06 12:20:36,412 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 88 [2025-02-06 12:20:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:36,412 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2025-02-06 12:20:36,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2025-02-06 12:20:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 12:20:36,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:36,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:36,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:20:36,413 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:36,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1968522717, now seen corresponding path program 1 times [2025-02-06 12:20:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:36,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44115990] [2025-02-06 12:20:36,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:36,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:20:36,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:20:36,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:36,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:37,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:37,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44115990] [2025-02-06 12:20:37,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44115990] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:37,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226469492] [2025-02-06 12:20:37,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:37,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:20:37,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:20:37,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:20:37,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:20:37,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:20:37,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:20:37,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:37,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:37,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 12:20:37,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:20:37,255 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-06 12:20:37,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:20:37,359 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:20:37,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:20:37,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:20:37,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:20:37,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:20:37,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:20:37,535 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:37,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:20:37,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:20:37,595 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:37,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:20:37,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:20:37,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:20:37,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:20:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:37,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:20:37,681 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_885 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_885 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:20:37,693 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_885 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_885 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-02-06 12:20:37,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_890 (Array Int Int)) (v_ArrVal_891 (Array Int Int)) (v_ArrVal_885 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_891))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_890) .cse0 v_ArrVal_885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_890 (Array Int Int)) (v_ArrVal_891 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_890) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-02-06 12:20:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226469492] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:37,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:20:37,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2025-02-06 12:20:37,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625222769] [2025-02-06 12:20:37,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:20:37,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 12:20:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:37,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 12:20:37,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2025-02-06 12:20:37,745 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 16 states, 14 states have (on average 9.428571428571429) internal successors, (132), 16 states have internal predecessors, (132), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:20:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:39,638 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2025-02-06 12:20:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:20:39,638 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.428571428571429) internal successors, (132), 16 states have internal predecessors, (132), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2025-02-06 12:20:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:39,640 INFO L225 Difference]: With dead ends: 633 [2025-02-06 12:20:39,640 INFO L226 Difference]: Without dead ends: 633 [2025-02-06 12:20:39,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=3, NotChecked=132, Total=650 [2025-02-06 12:20:39,641 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 495 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 3290 SdHoareTripleChecker+Invalid, 3756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:39,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 3290 Invalid, 3756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 12:20:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-02-06 12:20:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2025-02-06 12:20:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 448 states have (on average 1.5602678571428572) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:20:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2025-02-06 12:20:39,651 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 89 [2025-02-06 12:20:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:39,651 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2025-02-06 12:20:39,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.428571428571429) internal successors, (132), 16 states have internal predecessors, (132), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:20:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2025-02-06 12:20:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 12:20:39,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:39,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:39,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:20:39,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:20:39,858 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:39,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1968522718, now seen corresponding path program 1 times [2025-02-06 12:20:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:39,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297346939] [2025-02-06 12:20:39,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:39,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:20:39,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:20:39,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:39,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:40,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:40,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297346939] [2025-02-06 12:20:40,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297346939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:40,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835065429] [2025-02-06 12:20:40,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:40,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:20:40,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:20:40,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:20:40,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:20:40,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:20:40,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:20:40,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:40,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:40,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 12:20:40,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:20:40,547 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-06 12:20:40,643 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:20:40,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:20:40,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:20:40,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:40,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:20:40,772 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:40,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:20:40,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:20:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:40,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:20:40,800 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-06 12:20:40,805 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:20:40,837 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-02-06 12:20:40,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-02-06 12:20:40,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1024 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1027))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1024)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-02-06 12:20:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835065429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:40,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:20:40,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2025-02-06 12:20:40,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437036235] [2025-02-06 12:20:40,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:20:40,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 12:20:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:40,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 12:20:40,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=229, Unknown=3, NotChecked=96, Total=380 [2025-02-06 12:20:40,846 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 17 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:20:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:41,771 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2025-02-06 12:20:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:20:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 17 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2025-02-06 12:20:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:41,774 INFO L225 Difference]: With dead ends: 632 [2025-02-06 12:20:41,774 INFO L226 Difference]: Without dead ends: 632 [2025-02-06 12:20:41,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=459, Unknown=3, NotChecked=138, Total=702 [2025-02-06 12:20:41,775 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 499 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:41,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 2558 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:20:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-02-06 12:20:41,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2025-02-06 12:20:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 440 states have (on average 1.565909090909091) internal successors, (689), 613 states have internal predecessors, (689), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2025-02-06 12:20:41,784 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 89 [2025-02-06 12:20:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:41,784 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2025-02-06 12:20:41,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 17 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:20:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2025-02-06 12:20:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 12:20:41,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:41,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:41,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:20:41,986 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,SelfDestructingSolverStorable20 [2025-02-06 12:20:41,986 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:41,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash -420614032, now seen corresponding path program 1 times [2025-02-06 12:20:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:41,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814367430] [2025-02-06 12:20:41,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:41,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:42,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 12:20:42,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 12:20:42,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:42,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:42,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:42,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814367430] [2025-02-06 12:20:42,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814367430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:42,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:42,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 12:20:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995144292] [2025-02-06 12:20:42,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:42,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:20:42,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:42,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:20:42,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:20:42,476 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:43,617 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2025-02-06 12:20:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:20:43,618 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2025-02-06 12:20:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:43,620 INFO L225 Difference]: With dead ends: 636 [2025-02-06 12:20:43,620 INFO L226 Difference]: Without dead ends: 636 [2025-02-06 12:20:43,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:20:43,622 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 530 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:43,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 3152 Invalid, 2724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 12:20:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-02-06 12:20:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 632. [2025-02-06 12:20:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 451 states have (on average 1.5565410199556542) internal successors, (702), 624 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:20:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 729 transitions. [2025-02-06 12:20:43,631 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 729 transitions. Word has length 91 [2025-02-06 12:20:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:43,631 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 729 transitions. [2025-02-06 12:20:43,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 729 transitions. [2025-02-06 12:20:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 12:20:43,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:43,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:43,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:20:43,632 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr214REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -420614031, now seen corresponding path program 1 times [2025-02-06 12:20:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:43,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410725410] [2025-02-06 12:20:43,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:43,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 12:20:43,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 12:20:43,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:43,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:44,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410725410] [2025-02-06 12:20:44,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410725410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:44,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:44,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 12:20:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95703247] [2025-02-06 12:20:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:44,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:20:44,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:44,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:20:44,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:20:44,254 INFO L87 Difference]: Start difference. First operand 632 states and 729 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:45,521 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2025-02-06 12:20:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:20:45,522 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2025-02-06 12:20:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:45,523 INFO L225 Difference]: With dead ends: 635 [2025-02-06 12:20:45,523 INFO L226 Difference]: Without dead ends: 635 [2025-02-06 12:20:45,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-06 12:20:45,524 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 505 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 2507 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 2529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:45,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 2211 Invalid, 2529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2507 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 12:20:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-02-06 12:20:45,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2025-02-06 12:20:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 451 states have (on average 1.5543237250554325) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:20:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2025-02-06 12:20:45,533 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 91 [2025-02-06 12:20:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:45,534 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2025-02-06 12:20:45,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2025-02-06 12:20:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 12:20:45,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:45,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:45,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 12:20:45,535 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:45,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:45,535 INFO L85 PathProgramCache]: Analyzing trace with hash -776340918, now seen corresponding path program 1 times [2025-02-06 12:20:45,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:45,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363644655] [2025-02-06 12:20:45,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:45,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:45,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:20:45,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:20:45,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:45,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363644655] [2025-02-06 12:20:46,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363644655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026643890] [2025-02-06 12:20:46,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:46,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:20:46,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:20:46,024 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:20:46,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:20:46,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:20:46,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:20:46,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:46,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:46,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 12:20:46,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:20:46,239 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-06 12:20:46,324 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:20:46,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:20:46,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:20:46,400 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:46,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:20:46,439 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:46,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:20:46,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:46,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:20:46,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:20:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:46,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:20:46,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1301) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:20:46,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (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$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:20:46,614 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-02-06 12:20:46,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2025-02-06 12:20:46,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026643890] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:46,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:20:46,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-02-06 12:20:46,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33669244] [2025-02-06 12:20:46,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:20:46,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:20:46,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:46,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:20:46,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=374, Unknown=25, NotChecked=82, Total=552 [2025-02-06 12:20:46,655 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 19 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:20:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:48,074 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2025-02-06 12:20:48,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:20:48,074 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 19 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2025-02-06 12:20:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:48,076 INFO L225 Difference]: With dead ends: 634 [2025-02-06 12:20:48,076 INFO L226 Difference]: Without dead ends: 634 [2025-02-06 12:20:48,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=714, Unknown=25, NotChecked=114, Total=992 [2025-02-06 12:20:48,077 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 497 mSDsluCounter, 3739 mSDsCounter, 0 mSdLazyCounter, 3501 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 4085 SdHoareTripleChecker+Invalid, 3536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:48,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 4085 Invalid, 3536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3501 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:20:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-02-06 12:20:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2025-02-06 12:20:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 451 states have (on average 1.5521064301552105) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:20:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2025-02-06 12:20:48,088 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 92 [2025-02-06 12:20:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:48,088 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2025-02-06 12:20:48,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 19 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:20:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2025-02-06 12:20:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 12:20:48,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:48,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:48,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:20:48,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 12:20:48,291 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr214REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:48,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash -776340917, now seen corresponding path program 1 times [2025-02-06 12:20:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288803610] [2025-02-06 12:20:48,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:48,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:20:48,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:20:48,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:48,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:48,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:48,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288803610] [2025-02-06 12:20:48,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288803610] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:48,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703232631] [2025-02-06 12:20:48,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:48,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:20:48,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:20:48,975 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:20:48,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:20:49,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:20:49,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:20:49,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:49,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:49,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 12:20:49,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:20:49,187 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-06 12:20:49,275 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:20:49,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:20:49,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:20:49,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:20:49,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:20:49,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:20:49,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:20:49,445 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:49,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:20:49,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:20:49,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:49,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:20:49,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:20:49,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:49,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:20:49,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:20:49,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:20:49,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:20:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:49,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:20:49,658 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1455 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:20:49,669 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1455 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2025-02-06 12:20:49,687 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1454))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:20:49,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1454))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2025-02-06 12:20:49,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1454))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1462) .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1462) .cse5 v_ArrVal_1453) (select (select (store .cse6 .cse5 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1455))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-02-06 12:20:49,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703232631] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:49,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:20:49,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-02-06 12:20:49,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409088268] [2025-02-06 12:20:49,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:20:49,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:20:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:49,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:20:49,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=479, Unknown=5, NotChecked=240, Total=812 [2025-02-06 12:20:49,752 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:20:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:51,414 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2025-02-06 12:20:51,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:20:51,415 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 92 [2025-02-06 12:20:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:51,417 INFO L225 Difference]: With dead ends: 633 [2025-02-06 12:20:51,417 INFO L226 Difference]: Without dead ends: 633 [2025-02-06 12:20:51,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=744, Unknown=5, NotChecked=300, Total=1190 [2025-02-06 12:20:51,417 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 495 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 3035 SdHoareTripleChecker+Invalid, 3502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:51,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 3035 Invalid, 3502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 12:20:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-02-06 12:20:51,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 618. [2025-02-06 12:20:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 440 states have (on average 1.5613636363636363) internal successors, (687), 611 states have internal predecessors, (687), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:20:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2025-02-06 12:20:51,425 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 92 [2025-02-06 12:20:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:51,425 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2025-02-06 12:20:51,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:20:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2025-02-06 12:20:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:20:51,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:51,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:51,437 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-06 12:20:51,631 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,SelfDestructingSolverStorable24 [2025-02-06 12:20:51,631 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:51,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2092540395, now seen corresponding path program 1 times [2025-02-06 12:20:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:51,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924842687] [2025-02-06 12:20:51,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:51,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:20:51,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:20:51,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:51,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:52,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:52,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924842687] [2025-02-06 12:20:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924842687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:52,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 12:20:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589288138] [2025-02-06 12:20:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:52,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 12:20:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:52,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 12:20:52,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:20:52,168 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:53,325 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2025-02-06 12:20:53,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:20:53,326 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-02-06 12:20:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:53,328 INFO L225 Difference]: With dead ends: 637 [2025-02-06 12:20:53,328 INFO L226 Difference]: Without dead ends: 637 [2025-02-06 12:20:53,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-02-06 12:20:53,329 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 527 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:53,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2866 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 12:20:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-02-06 12:20:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2025-02-06 12:20:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 454 states have (on average 1.5484581497797356) internal successors, (703), 625 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:20:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 730 transitions. [2025-02-06 12:20:53,340 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 730 transitions. Word has length 94 [2025-02-06 12:20:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:53,340 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 730 transitions. [2025-02-06 12:20:53,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 730 transitions. [2025-02-06 12:20:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:20:53,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:53,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:53,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 12:20:53,341 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr210REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:53,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2092540394, now seen corresponding path program 1 times [2025-02-06 12:20:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855449718] [2025-02-06 12:20:53,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:53,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:20:53,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:20:53,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:53,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:53,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:53,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855449718] [2025-02-06 12:20:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855449718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:20:53,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:20:53,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:20:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516141017] [2025-02-06 12:20:53,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:20:53,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:20:53,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:53,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:20:53,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:20:53,980 INFO L87 Difference]: Start difference. First operand 633 states and 730 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:55,367 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2025-02-06 12:20:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:20:55,367 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-02-06 12:20:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:55,369 INFO L225 Difference]: With dead ends: 636 [2025-02-06 12:20:55,369 INFO L226 Difference]: Without dead ends: 636 [2025-02-06 12:20:55,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:20:55,369 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 507 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 3131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:55,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2734 Invalid, 3131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:20:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-02-06 12:20:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2025-02-06 12:20:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 454 states have (on average 1.5462555066079295) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:20:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2025-02-06 12:20:55,377 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 94 [2025-02-06 12:20:55,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:55,377 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2025-02-06 12:20:55,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2025-02-06 12:20:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:20:55,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:55,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:55,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 12:20:55,379 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash 427085307, now seen corresponding path program 1 times [2025-02-06 12:20:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78549499] [2025-02-06 12:20:55,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:55,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:20:55,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:20:55,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:55,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:55,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:55,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78549499] [2025-02-06 12:20:55,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78549499] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:55,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923775434] [2025-02-06 12:20:55,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:55,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:20:55,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:20:55,847 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:20:55,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:20:56,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:20:56,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:20:56,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:56,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:56,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 12:20:56,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:20:56,056 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-06 12:20:56,141 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:20:56,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:20:56,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:20:56,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:56,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:20:56,228 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:56,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:20:56,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:56,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:20:56,317 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:56,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:20:56,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:20:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:56,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:20:56,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1761) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-06 12:20:56,416 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:20:56,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (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$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1759))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:20:56,502 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-02-06 12:20:56,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2025-02-06 12:20:56,509 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1764))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-02-06 12:20:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923775434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:56,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:20:56,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 19 [2025-02-06 12:20:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081814382] [2025-02-06 12:20:56,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:20:56,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:20:56,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:56,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:20:56,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=399, Unknown=32, NotChecked=180, Total=702 [2025-02-06 12:20:56,512 INFO L87 Difference]: Start difference. First operand 633 states and 729 transitions. Second operand has 20 states, 18 states have (on average 7.611111111111111) internal successors, (137), 19 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:20:57,896 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2025-02-06 12:20:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:20:57,897 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.611111111111111) internal successors, (137), 19 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-02-06 12:20:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:20:57,899 INFO L225 Difference]: With dead ends: 635 [2025-02-06 12:20:57,899 INFO L226 Difference]: Without dead ends: 635 [2025-02-06 12:20:57,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=794, Unknown=40, NotChecked=252, Total=1260 [2025-02-06 12:20:57,899 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 489 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 3239 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 3785 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:20:57,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 3785 Invalid, 3262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3239 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 12:20:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-02-06 12:20:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2025-02-06 12:20:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 454 states have (on average 1.5440528634361232) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:20:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2025-02-06 12:20:57,907 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 95 [2025-02-06 12:20:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:20:57,907 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2025-02-06 12:20:57,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.611111111111111) internal successors, (137), 19 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:20:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2025-02-06 12:20:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:20:57,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:20:57,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:20:57,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:20:58,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:20:58,109 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr210REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:20:58,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:20:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash 427085308, now seen corresponding path program 1 times [2025-02-06 12:20:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:20:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669800049] [2025-02-06 12:20:58,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:20:58,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:20:58,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:20:58,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:58,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:58,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:20:58,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669800049] [2025-02-06 12:20:58,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669800049] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:58,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757660249] [2025-02-06 12:20:58,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:20:58,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:20:58,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:20:58,832 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:20:58,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:20:59,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:20:59,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:20:59,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:20:59,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:20:59,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 12:20:59,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:20:59,069 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-06 12:20:59,161 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:20:59,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:20:59,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:20:59,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:20:59,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:20:59,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:20:59,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:20:59,358 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:59,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:20:59,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:20:59,414 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:59,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:20:59,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:20:59,464 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:59,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:20:59,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:20:59,520 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:20:59,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:20:59,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:20:59,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:20:59,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:20:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:20:59,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:20:59,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1930 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:20:59,651 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1928))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) .cse1 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:20:59,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1928))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2025-02-06 12:20:59,681 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1928))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926) .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926) .cse5 v_ArrVal_1927) (select (select (store .cse6 .cse5 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1930))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-02-06 12:20:59,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1926) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1930))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1936 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1925))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1928))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse5 v_ArrVal_1926) .cse6 v_ArrVal_1927) .cse7 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2025-02-06 12:20:59,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757660249] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:20:59,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:20:59,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-02-06 12:20:59,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432414068] [2025-02-06 12:20:59,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:20:59,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:20:59,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:20:59,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:20:59,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=631, Unknown=25, NotChecked=280, Total=1056 [2025-02-06 12:20:59,849 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:21:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:21:02,280 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2025-02-06 12:21:02,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:21:02,280 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-02-06 12:21:02,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:21:02,282 INFO L225 Difference]: With dead ends: 634 [2025-02-06 12:21:02,282 INFO L226 Difference]: Without dead ends: 634 [2025-02-06 12:21:02,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=990, Unknown=25, NotChecked=350, Total=1560 [2025-02-06 12:21:02,283 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 497 mSDsluCounter, 3857 mSDsCounter, 0 mSdLazyCounter, 5144 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 4204 SdHoareTripleChecker+Invalid, 5184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 5144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:21:02,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 4204 Invalid, 5184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 5144 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 12:21:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-02-06 12:21:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 616. [2025-02-06 12:21:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 440 states have (on average 1.5568181818181819) internal successors, (685), 609 states have internal predecessors, (685), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:21:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 711 transitions. [2025-02-06 12:21:02,292 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 711 transitions. Word has length 95 [2025-02-06 12:21:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:21:02,292 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 711 transitions. [2025-02-06 12:21:02,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:21:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 711 transitions. [2025-02-06 12:21:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:21:02,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:21:02,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:21:02,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:21:02,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 12:21:02,493 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:21:02,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:21:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1628360689, now seen corresponding path program 1 times [2025-02-06 12:21:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:21:02,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135163369] [2025-02-06 12:21:02,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:21:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:21:02,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:21:02,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:21:02,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:21:02,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:21:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:21:03,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:21:03,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135163369] [2025-02-06 12:21:03,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135163369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:21:03,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:21:03,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 12:21:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399587219] [2025-02-06 12:21:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:21:03,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 12:21:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:21:03,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 12:21:03,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-06 12:21:03,158 INFO L87 Difference]: Start difference. First operand 616 states and 711 transitions. Second operand has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:21:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:21:04,309 INFO L93 Difference]: Finished difference Result 639 states and 737 transitions. [2025-02-06 12:21:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:21:04,310 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-02-06 12:21:04,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:21:04,311 INFO L225 Difference]: With dead ends: 639 [2025-02-06 12:21:04,311 INFO L226 Difference]: Without dead ends: 639 [2025-02-06 12:21:04,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-02-06 12:21:04,312 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 509 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 2733 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:21:04,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 3180 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2733 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 12:21:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-02-06 12:21:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 635. [2025-02-06 12:21:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 458 states have (on average 1.539301310043668) internal successors, (705), 627 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:21:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 732 transitions. [2025-02-06 12:21:04,319 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 732 transitions. Word has length 98 [2025-02-06 12:21:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:21:04,319 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 732 transitions. [2025-02-06 12:21:04,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.4) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:21:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 732 transitions. [2025-02-06 12:21:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:21:04,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:21:04,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:21:04,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 12:21:04,320 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr206REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:21:04,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:21:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1628360688, now seen corresponding path program 1 times [2025-02-06 12:21:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:21:04,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028319244] [2025-02-06 12:21:04,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:21:04,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:21:04,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:21:04,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:21:04,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:21:04,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:21:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:21:05,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:21:05,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028319244] [2025-02-06 12:21:05,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028319244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:21:05,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:21:05,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 12:21:05,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475090532] [2025-02-06 12:21:05,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:21:05,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:21:05,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:21:05,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:21:05,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-06 12:21:05,257 INFO L87 Difference]: Start difference. First operand 635 states and 732 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:21:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:21:07,090 INFO L93 Difference]: Finished difference Result 638 states and 736 transitions. [2025-02-06 12:21:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:21:07,090 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-02-06 12:21:07,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:21:07,092 INFO L225 Difference]: With dead ends: 638 [2025-02-06 12:21:07,092 INFO L226 Difference]: Without dead ends: 638 [2025-02-06 12:21:07,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:21:07,093 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 511 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 3880 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 3165 SdHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:21:07,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 3165 Invalid, 3909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3880 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 12:21:07,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-06 12:21:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2025-02-06 12:21:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 458 states have (on average 1.537117903930131) internal successors, (704), 627 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:21:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 731 transitions. [2025-02-06 12:21:07,102 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 731 transitions. Word has length 98 [2025-02-06 12:21:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:21:07,102 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 731 transitions. [2025-02-06 12:21:07,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:21:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 731 transitions. [2025-02-06 12:21:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:21:07,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:21:07,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:21:07,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 12:21:07,103 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:21:07,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:21:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1762050827, now seen corresponding path program 1 times [2025-02-06 12:21:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:21:07,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624349031] [2025-02-06 12:21:07,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:21:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:21:07,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:21:07,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:21:07,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:21:07,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:21:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:21:07,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:21:07,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624349031] [2025-02-06 12:21:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624349031] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:21:07,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465011704] [2025-02-06 12:21:07,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:21:07,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:21:07,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:21:07,665 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:21:07,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:21:07,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:21:07,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:21:07,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:21:07,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:21:07,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 12:21:07,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:21:07,892 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-06 12:21:07,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:21:07,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:21:07,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:21:08,005 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:21:08,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:21:08,027 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:21:08,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:21:08,060 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:21:08,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:21:08,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:21:08,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:21:08,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:21:08,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:21:08,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:21:08,145 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 12:21:08,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:21:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:21:08,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:21:08,677 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-02-06 12:21:08,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2025-02-06 12:21:08,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2272))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2265)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2266)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2267)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-02-06 12:21:08,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465011704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:21:08,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:21:08,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 20 [2025-02-06 12:21:08,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709274976] [2025-02-06 12:21:08,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:21:08,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 12:21:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:21:08,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 12:21:08,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=752, Unknown=45, NotChecked=58, Total=992 [2025-02-06 12:21:08,700 INFO L87 Difference]: Start difference. First operand 635 states and 731 transitions. Second operand has 21 states, 19 states have (on average 7.421052631578948) internal successors, (141), 20 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:21:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:21:10,005 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2025-02-06 12:21:10,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 12:21:10,005 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.421052631578948) internal successors, (141), 20 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2025-02-06 12:21:10,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:21:10,007 INFO L225 Difference]: With dead ends: 637 [2025-02-06 12:21:10,007 INFO L226 Difference]: Without dead ends: 637 [2025-02-06 12:21:10,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=1343, Unknown=45, NotChecked=78, Total=1722 [2025-02-06 12:21:10,008 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 494 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 2717 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 3164 SdHoareTripleChecker+Invalid, 2742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:21:10,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 3164 Invalid, 2742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2717 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:21:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-02-06 12:21:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 634. [2025-02-06 12:21:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 458 states have (on average 1.534934497816594) internal successors, (703), 626 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 12:21:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 730 transitions. [2025-02-06 12:21:10,019 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 730 transitions. Word has length 99 [2025-02-06 12:21:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:21:10,020 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 730 transitions. [2025-02-06 12:21:10,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.421052631578948) internal successors, (141), 20 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:21:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 730 transitions. [2025-02-06 12:21:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:21:10,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:21:10,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:21:10,030 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-06 12:21:10,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:21:10,221 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr206REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-06 12:21:10,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:21:10,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1762050826, now seen corresponding path program 1 times [2025-02-06 12:21:10,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:21:10,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588054074] [2025-02-06 12:21:10,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:21:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:21:10,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:21:10,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:21:10,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:21:10,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:21:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:21:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:21:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588054074] [2025-02-06 12:21:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588054074] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:21:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720305892] [2025-02-06 12:21:11,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:21:11,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:21:11,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:21:11,044 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:21:11,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:21:11,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:21:11,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:21:11,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:21:11,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:21:11,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 12:21:11,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:21:11,281 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-06 12:21:11,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:21:11,381 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:21:11,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:21:11,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:21:11,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:21:11,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:21:11,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:21:11,600 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:21:11,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:21:11,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:21:11,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:21:11,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:21:11,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:21:11,787 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:21:11,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:21:11,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:21:11,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:21:11,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:21:11,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:21:11,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:21:11,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:21:11,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:21:12,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-02-06 12:21:12,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:21:12,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:21:12,059 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-02-06 12:21:12,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2025-02-06 12:21:12,067 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:21:12,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:21:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:21:12,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:21:23,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:21:23,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2025-02-06 12:21:24,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_24))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_17))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_23))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_22) .cse0 v_prenex_26) .cse1 v_prenex_25) .cse2 v_prenex_21) (select (select (store .cse3 .cse2 v_prenex_19) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_18))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2457 Int) (v_ArrVal_2450 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2462))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2449))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2452))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2454))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2463) .cse7 v_ArrVal_2450) .cse8 v_ArrVal_2451) .cse9 v_ArrVal_2453) .cse10 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2457) (select (select (store .cse11 .cse10 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2463 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2457 Int) (v_ArrVal_2450 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2462))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_2449))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_2452))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_2454))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2463) .cse15 v_ArrVal_2450) .cse16 v_ArrVal_2451) .cse17 v_ArrVal_2453) .cse18 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2457) (select (select (store .cse19 .cse18 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2025-02-06 12:21:24,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720305892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:21:24,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:21:24,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2025-02-06 12:21:24,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284291799] [2025-02-06 12:21:24,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:21:24,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 12:21:24,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:21:24,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 12:21:24,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1546, Unknown=67, NotChecked=82, Total=1892 [2025-02-06 12:21:24,955 INFO L87 Difference]: Start difference. First operand 634 states and 730 transitions. Second operand has 32 states, 29 states have (on average 5.517241379310345) internal successors, (160), 30 states have internal predecessors, (160), 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)