./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:50:25,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:50:25,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 07:50:25,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:50:25,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:50:25,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:50:25,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:50:25,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:50:25,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:50:25,875 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:50:25,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:50:25,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:50:25,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:50:25,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:50:25,877 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:50:25,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:50:25,877 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 07:50:25,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:50:25,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 07:50:25,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:50:25,878 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:50:25,878 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:50:25,878 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:50:25,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:50:25,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:50:25,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:50:25,878 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 07:50:25,879 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:50:25,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:50:25,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:50:25,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:50:25,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:50:25,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:50:25,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:50:25,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:50:25,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:50:25,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:50:25,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:50:25,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:50:25,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:50:25,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:50:25,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:50:25,881 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 -> 72c3cbe0b435a963730c7c79c0d825f3c978c53ad7cc61822ef9417e2e6ee67f [2025-02-08 07:50:26,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:50:26,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:50:26,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:50:26,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:50:26,187 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:50:26,189 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_FNV_test1-1.i [2025-02-08 07:50:27,456 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fd0cc508/07e6176e331949a380a726b1b101271e/FLAGfb10cd2b7 [2025-02-08 07:50:27,783 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:50:27,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-1.i [2025-02-08 07:50:27,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fd0cc508/07e6176e331949a380a726b1b101271e/FLAGfb10cd2b7 [2025-02-08 07:50:28,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8fd0cc508/07e6176e331949a380a726b1b101271e [2025-02-08 07:50:28,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:50:28,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:50:28,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:50:28,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:50:28,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:50:28,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36291a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28, skipping insertion in model container [2025-02-08 07:50:28,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:50:28,438 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:50:28,477 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:50:28,481 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:50:28,485 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:50:28,490 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:50:28,501 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:50:28,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:50:28,516 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:50:28,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:50:28,648 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:50:28,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28 WrapperNode [2025-02-08 07:50:28,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:50:28,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:50:28,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:50:28,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:50:28,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,722 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 823 [2025-02-08 07:50:28,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:50:28,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:50:28,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:50:28,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:50:28,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,797 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-08 07:50:28,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:50:28,841 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:50:28,841 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:50:28,841 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:50:28,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (1/1) ... [2025-02-08 07:50:28,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:50:28,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:50:28,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:50:28,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:50:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 07:50:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 07:50:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 07:50:28,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 07:50:28,919 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 07:50:28,919 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 07:50:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:50:28,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:50:29,091 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:50:29,092 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:50:30,679 INFO L? ?]: Removed 774 outVars from TransFormulas that were not future-live. [2025-02-08 07:50:30,680 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:50:30,738 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:50:30,742 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 07:50:30,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:50:30 BoogieIcfgContainer [2025-02-08 07:50:30,742 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:50:30,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:50:30,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:50:30,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:50:30,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:50:28" (1/3) ... [2025-02-08 07:50:30,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5436336e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:50:30, skipping insertion in model container [2025-02-08 07:50:30,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:50:28" (2/3) ... [2025-02-08 07:50:30,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5436336e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:50:30, skipping insertion in model container [2025-02-08 07:50:30,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:50:30" (3/3) ... [2025-02-08 07:50:30,751 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test1-1.i [2025-02-08 07:50:30,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:50:30,765 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test1-1.i that has 4 procedures, 763 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2025-02-08 07:50:30,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:50:30,827 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;@537c5b3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:50:30,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2025-02-08 07:50:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 758 states, 424 states have (on average 2.0542452830188678) internal successors, (871), 751 states have internal predecessors, (871), 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-08 07:50:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:50:30,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:30,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:50:30,840 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-08 07:50:30,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash 29551613, now seen corresponding path program 1 times [2025-02-08 07:50:30,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:30,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979759062] [2025-02-08 07:50:30,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:30,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:50:30,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:50:30,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:30,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:31,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:31,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979759062] [2025-02-08 07:50:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979759062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:31,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:31,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:50:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68630156] [2025-02-08 07:50:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:31,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:50:31,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:31,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:50:31,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:50:31,096 INFO L87 Difference]: Start difference. First operand has 758 states, 424 states have (on average 2.0542452830188678) internal successors, (871), 751 states have internal predecessors, (871), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:31,784 INFO L93 Difference]: Finished difference Result 700 states and 807 transitions. [2025-02-08 07:50:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:50:31,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 07:50:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:31,804 INFO L225 Difference]: With dead ends: 700 [2025-02-08 07:50:31,804 INFO L226 Difference]: Without dead ends: 695 [2025-02-08 07:50:31,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:50:31,809 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 698 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 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.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:31,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 484 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:50:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-02-08 07:50:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 694. [2025-02-08 07:50:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 417 states have (on average 1.8585131894484412) internal successors, (775), 688 states have internal predecessors, (775), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 791 transitions. [2025-02-08 07:50:31,896 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 791 transitions. Word has length 4 [2025-02-08 07:50:31,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:31,897 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 791 transitions. [2025-02-08 07:50:31,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:31,897 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 791 transitions. [2025-02-08 07:50:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:50:31,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:31,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:50:31,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:50:31,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:31,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:31,899 INFO L85 PathProgramCache]: Analyzing trace with hash 29551614, now seen corresponding path program 1 times [2025-02-08 07:50:31,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:31,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891270906] [2025-02-08 07:50:31,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:31,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:31,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:50:31,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:50:31,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:31,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:32,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:32,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891270906] [2025-02-08 07:50:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891270906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:32,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:32,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:50:32,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307522953] [2025-02-08 07:50:32,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:32,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:50:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:32,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:50:32,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:50:32,012 INFO L87 Difference]: Start difference. First operand 694 states and 791 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:32,472 INFO L93 Difference]: Finished difference Result 678 states and 776 transitions. [2025-02-08 07:50:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:50:32,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 07:50:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:32,475 INFO L225 Difference]: With dead ends: 678 [2025-02-08 07:50:32,475 INFO L226 Difference]: Without dead ends: 678 [2025-02-08 07:50:32,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:50:32,476 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 466 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:32,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 745 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 07:50:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-02-08 07:50:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 669. [2025-02-08 07:50:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 417 states have (on average 1.7985611510791366) internal successors, (750), 663 states have internal predecessors, (750), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 766 transitions. [2025-02-08 07:50:32,500 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 766 transitions. Word has length 4 [2025-02-08 07:50:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:32,501 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 766 transitions. [2025-02-08 07:50:32,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 766 transitions. [2025-02-08 07:50:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:50:32,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:32,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:50:32,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:50:32,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:32,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:32,502 INFO L85 PathProgramCache]: Analyzing trace with hash 28713522, now seen corresponding path program 1 times [2025-02-08 07:50:32,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:32,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736117201] [2025-02-08 07:50:32,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:32,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:32,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:50:32,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:50:32,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:32,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:32,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:32,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736117201] [2025-02-08 07:50:32,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736117201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:32,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:32,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:50:32,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936892989] [2025-02-08 07:50:32,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:32,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:50:32,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:32,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:50:32,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:50:32,536 INFO L87 Difference]: Start difference. First operand 669 states and 766 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:32,648 INFO L93 Difference]: Finished difference Result 1295 states and 1479 transitions. [2025-02-08 07:50:32,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:50:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 07:50:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:32,654 INFO L225 Difference]: With dead ends: 1295 [2025-02-08 07:50:32,654 INFO L226 Difference]: Without dead ends: 1295 [2025-02-08 07:50:32,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:50:32,655 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 706 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:32,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1478 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:50:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2025-02-08 07:50:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 670. [2025-02-08 07:50:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 418 states have (on average 1.7966507177033493) internal successors, (751), 664 states have internal predecessors, (751), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 767 transitions. [2025-02-08 07:50:32,695 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 767 transitions. Word has length 4 [2025-02-08 07:50:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:32,695 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 767 transitions. [2025-02-08 07:50:32,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 767 transitions. [2025-02-08 07:50:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 07:50:32,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:32,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:50:32,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:50:32,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:32,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash -349345674, now seen corresponding path program 1 times [2025-02-08 07:50:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:32,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694442203] [2025-02-08 07:50:32,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:32,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 07:50:32,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 07:50:32,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:32,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:32,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:32,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694442203] [2025-02-08 07:50:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694442203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:32,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:32,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:50:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465915051] [2025-02-08 07:50:32,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:32,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:50:32,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:32,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:50:32,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:50:32,802 INFO L87 Difference]: Start difference. First operand 670 states and 767 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:33,392 INFO L93 Difference]: Finished difference Result 696 states and 820 transitions. [2025-02-08 07:50:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:50:33,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 07:50:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:33,397 INFO L225 Difference]: With dead ends: 696 [2025-02-08 07:50:33,397 INFO L226 Difference]: Without dead ends: 696 [2025-02-08 07:50:33,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:50:33,400 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 965 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:33,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 739 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:50:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-02-08 07:50:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 647. [2025-02-08 07:50:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 418 states have (on average 1.7416267942583732) internal successors, (728), 641 states have internal predecessors, (728), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 744 transitions. [2025-02-08 07:50:33,428 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 744 transitions. Word has length 10 [2025-02-08 07:50:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:33,428 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 744 transitions. [2025-02-08 07:50:33,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 744 transitions. [2025-02-08 07:50:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 07:50:33,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:33,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:50:33,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:50:33,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:33,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:33,430 INFO L85 PathProgramCache]: Analyzing trace with hash -349345673, now seen corresponding path program 1 times [2025-02-08 07:50:33,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:33,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546533091] [2025-02-08 07:50:33,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:33,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 07:50:33,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 07:50:33,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:33,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:33,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:33,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546533091] [2025-02-08 07:50:33,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546533091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:33,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:33,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:50:33,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717701329] [2025-02-08 07:50:33,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:33,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:50:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:33,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:50:33,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:50:33,538 INFO L87 Difference]: Start difference. First operand 647 states and 744 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:33,587 INFO L93 Difference]: Finished difference Result 572 states and 641 transitions. [2025-02-08 07:50:33,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:50:33,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 07:50:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:33,590 INFO L225 Difference]: With dead ends: 572 [2025-02-08 07:50:33,590 INFO L226 Difference]: Without dead ends: 572 [2025-02-08 07:50:33,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:50:33,591 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 60 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1179 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-08 07:50:33,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1179 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:50:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-08 07:50:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-08 07:50:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 355 states have (on average 1.7605633802816902) internal successors, (625), 566 states have internal predecessors, (625), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 641 transitions. [2025-02-08 07:50:33,608 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 641 transitions. Word has length 10 [2025-02-08 07:50:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:33,609 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 641 transitions. [2025-02-08 07:50:33,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 641 transitions. [2025-02-08 07:50:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 07:50:33,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:33,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:50:33,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 07:50:33,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr290REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:33,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2055061787, now seen corresponding path program 1 times [2025-02-08 07:50:33,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:33,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14230205] [2025-02-08 07:50:33,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:33,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:33,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 07:50:33,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 07:50:33,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:33,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:33,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:33,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14230205] [2025-02-08 07:50:33,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14230205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:33,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:33,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:50:33,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698458824] [2025-02-08 07:50:33,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:33,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:50:33,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:33,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:50:33,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:50:33,692 INFO L87 Difference]: Start difference. First operand 572 states and 641 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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-08 07:50:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:33,777 INFO L93 Difference]: Finished difference Result 554 states and 616 transitions. [2025-02-08 07:50:33,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:50:33,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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-08 07:50:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:33,780 INFO L225 Difference]: With dead ends: 554 [2025-02-08 07:50:33,780 INFO L226 Difference]: Without dead ends: 554 [2025-02-08 07:50:33,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:50:33,781 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 41 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1715 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-08 07:50:33,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1715 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:50:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-08 07:50:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2025-02-08 07:50:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 341 states have (on average 1.750733137829912) internal successors, (597), 545 states have internal predecessors, (597), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 613 transitions. [2025-02-08 07:50:33,795 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 613 transitions. Word has length 11 [2025-02-08 07:50:33,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:33,795 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 613 transitions. [2025-02-08 07:50:33,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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-08 07:50:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 613 transitions. [2025-02-08 07:50:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 07:50:33,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:33,796 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] [2025-02-08 07:50:33,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 07:50:33,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr276REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1039576559, now seen corresponding path program 1 times [2025-02-08 07:50:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:33,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936014381] [2025-02-08 07:50:33,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:33,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 07:50:33,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 07:50:33,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:33,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:33,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:33,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936014381] [2025-02-08 07:50:33,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936014381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:33,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:50:33,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346510076] [2025-02-08 07:50:33,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:33,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:50:33,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:33,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:50:33,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:50:33,990 INFO L87 Difference]: Start difference. First operand 551 states and 613 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:34,496 INFO L93 Difference]: Finished difference Result 605 states and 695 transitions. [2025-02-08 07:50:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:50:34,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-08 07:50:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:34,502 INFO L225 Difference]: With dead ends: 605 [2025-02-08 07:50:34,502 INFO L226 Difference]: Without dead ends: 605 [2025-02-08 07:50:34,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:50:34,504 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 471 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:34,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 949 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:50:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-08 07:50:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 547. [2025-02-08 07:50:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 341 states have (on average 1.7390029325513197) internal successors, (593), 541 states have internal predecessors, (593), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 609 transitions. [2025-02-08 07:50:34,520 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 609 transitions. Word has length 25 [2025-02-08 07:50:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:34,520 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 609 transitions. [2025-02-08 07:50:34,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 609 transitions. [2025-02-08 07:50:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 07:50:34,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:34,523 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] [2025-02-08 07:50:34,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:50:34,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr261REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:34,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash -592977163, now seen corresponding path program 1 times [2025-02-08 07:50:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100583571] [2025-02-08 07:50:34,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:34,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 07:50:34,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 07:50:34,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:34,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:34,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:34,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100583571] [2025-02-08 07:50:34,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100583571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:34,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:34,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:50:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412700114] [2025-02-08 07:50:34,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:34,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:50:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:34,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:50:34,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:50:34,683 INFO L87 Difference]: Start difference. First operand 547 states and 609 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:34,755 INFO L93 Difference]: Finished difference Result 547 states and 605 transitions. [2025-02-08 07:50:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:50:34,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-08 07:50:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:34,757 INFO L225 Difference]: With dead ends: 547 [2025-02-08 07:50:34,758 INFO L226 Difference]: Without dead ends: 547 [2025-02-08 07:50:34,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:50:34,758 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 21 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1697 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-08 07:50:34,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1697 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:50:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-08 07:50:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-02-08 07:50:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 341 states have (on average 1.7272727272727273) internal successors, (589), 541 states have internal predecessors, (589), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 605 transitions. [2025-02-08 07:50:34,769 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 605 transitions. Word has length 60 [2025-02-08 07:50:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:34,770 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 605 transitions. [2025-02-08 07:50:34,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 605 transitions. [2025-02-08 07:50:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 07:50:34,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:34,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:50:34,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 07:50:34,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr261REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:34,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:34,771 INFO L85 PathProgramCache]: Analyzing trace with hash 386878253, now seen corresponding path program 1 times [2025-02-08 07:50:34,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:34,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569513772] [2025-02-08 07:50:34,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:34,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 07:50:34,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 07:50:34,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:34,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:34,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:34,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569513772] [2025-02-08 07:50:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569513772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:34,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:34,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:50:34,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012772557] [2025-02-08 07:50:34,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:34,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:50:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:34,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:50:34,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:50:34,906 INFO L87 Difference]: Start difference. First operand 547 states and 605 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:34,972 INFO L93 Difference]: Finished difference Result 639 states and 724 transitions. [2025-02-08 07:50:34,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:50:34,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-08 07:50:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:34,975 INFO L225 Difference]: With dead ends: 639 [2025-02-08 07:50:34,975 INFO L226 Difference]: Without dead ends: 639 [2025-02-08 07:50:34,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:50:34,976 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 54 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1152 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-08 07:50:34,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1152 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:50:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-02-08 07:50:34,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2025-02-08 07:50:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 433 states have (on average 1.6351039260969977) internal successors, (708), 633 states have internal predecessors, (708), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 724 transitions. [2025-02-08 07:50:34,989 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 724 transitions. Word has length 68 [2025-02-08 07:50:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:34,989 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 724 transitions. [2025-02-08 07:50:34,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 724 transitions. [2025-02-08 07:50:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:50:34,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:34,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:50:34,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:50:34,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:34,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash 935466296, now seen corresponding path program 1 times [2025-02-08 07:50:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705652136] [2025-02-08 07:50:34,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:35,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 07:50:35,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:50:35,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:35,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:35,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:35,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705652136] [2025-02-08 07:50:35,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705652136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:35,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:35,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:50:35,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949505267] [2025-02-08 07:50:35,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:35,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:50:35,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:35,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:50:35,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:50:35,323 INFO L87 Difference]: Start difference. First operand 639 states and 724 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:35,878 INFO L93 Difference]: Finished difference Result 638 states and 723 transitions. [2025-02-08 07:50:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:50:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-08 07:50:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:35,881 INFO L225 Difference]: With dead ends: 638 [2025-02-08 07:50:35,882 INFO L226 Difference]: Without dead ends: 638 [2025-02-08 07:50:35,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:50:35,883 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 2 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:35,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1637 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:50:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-08 07:50:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2025-02-08 07:50:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 433 states have (on average 1.6327944572748267) internal successors, (707), 632 states have internal predecessors, (707), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 723 transitions. [2025-02-08 07:50:35,898 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 723 transitions. Word has length 76 [2025-02-08 07:50:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:35,898 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 723 transitions. [2025-02-08 07:50:35,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 723 transitions. [2025-02-08 07:50:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:50:35,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:35,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:50:35,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:50:35,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr226REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:35,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:35,900 INFO L85 PathProgramCache]: Analyzing trace with hash 935466297, now seen corresponding path program 1 times [2025-02-08 07:50:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:35,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320133462] [2025-02-08 07:50:35,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:35,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 07:50:35,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:50:35,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:35,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:36,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320133462] [2025-02-08 07:50:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320133462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:50:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238685738] [2025-02-08 07:50:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:36,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:50:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:36,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:50:36,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:50:36,369 INFO L87 Difference]: Start difference. First operand 638 states and 723 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:37,006 INFO L93 Difference]: Finished difference Result 637 states and 722 transitions. [2025-02-08 07:50:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:50:37,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-08 07:50:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:37,010 INFO L225 Difference]: With dead ends: 637 [2025-02-08 07:50:37,010 INFO L226 Difference]: Without dead ends: 637 [2025-02-08 07:50:37,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:50:37,010 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 1 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:37,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1598 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:50:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-02-08 07:50:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2025-02-08 07:50:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 432 states have (on average 1.6342592592592593) internal successors, (706), 631 states have internal predecessors, (706), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 722 transitions. [2025-02-08 07:50:37,023 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 722 transitions. Word has length 76 [2025-02-08 07:50:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:37,023 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 722 transitions. [2025-02-08 07:50:37,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:50:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 722 transitions. [2025-02-08 07:50:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 07:50:37,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:37,025 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] [2025-02-08 07:50:37,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:50:37,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:37,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash 747511445, now seen corresponding path program 1 times [2025-02-08 07:50:37,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:37,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797943204] [2025-02-08 07:50:37,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:37,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 07:50:37,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 07:50:37,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:37,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:37,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:37,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797943204] [2025-02-08 07:50:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797943204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:37,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:37,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:50:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554233444] [2025-02-08 07:50:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:50:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:37,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:50:37,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:50:37,281 INFO L87 Difference]: Start difference. First operand 637 states and 722 transitions. Second operand has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:37,928 INFO L93 Difference]: Finished difference Result 649 states and 737 transitions. [2025-02-08 07:50:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:50:37,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 84 [2025-02-08 07:50:37,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:37,933 INFO L225 Difference]: With dead ends: 649 [2025-02-08 07:50:37,933 INFO L226 Difference]: Without dead ends: 649 [2025-02-08 07:50:37,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:50:37,934 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 10 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:37,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2155 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:50:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-08 07:50:37,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 643. [2025-02-08 07:50:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 437 states have (on average 1.631578947368421) internal successors, (713), 636 states have internal predecessors, (713), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 07:50:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 732 transitions. [2025-02-08 07:50:37,949 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 732 transitions. Word has length 84 [2025-02-08 07:50:37,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:37,949 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 732 transitions. [2025-02-08 07:50:37,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 732 transitions. [2025-02-08 07:50:37,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 07:50:37,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:37,953 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] [2025-02-08 07:50:37,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:50:37,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr222REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:37,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash 747511446, now seen corresponding path program 1 times [2025-02-08 07:50:37,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:37,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304454420] [2025-02-08 07:50:37,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:37,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:37,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 07:50:37,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 07:50:37,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:37,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:38,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:38,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304454420] [2025-02-08 07:50:38,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304454420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:38,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:38,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:50:38,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318275526] [2025-02-08 07:50:38,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:38,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:50:38,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:38,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:50:38,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:50:38,460 INFO L87 Difference]: Start difference. First operand 643 states and 732 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:39,169 INFO L93 Difference]: Finished difference Result 643 states and 731 transitions. [2025-02-08 07:50:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:50:39,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 84 [2025-02-08 07:50:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:39,172 INFO L225 Difference]: With dead ends: 643 [2025-02-08 07:50:39,172 INFO L226 Difference]: Without dead ends: 643 [2025-02-08 07:50:39,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:50:39,173 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 5 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:39,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2041 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 07:50:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-02-08 07:50:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2025-02-08 07:50:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 437 states have (on average 1.6292906178489703) internal successors, (712), 636 states have internal predecessors, (712), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 07:50:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 731 transitions. [2025-02-08 07:50:39,187 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 731 transitions. Word has length 84 [2025-02-08 07:50:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:39,187 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 731 transitions. [2025-02-08 07:50:39,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 731 transitions. [2025-02-08 07:50:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 07:50:39,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:39,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:50:39,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:50:39,189 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-08 07:50:39,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash -151045995, now seen corresponding path program 1 times [2025-02-08 07:50:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:39,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602956652] [2025-02-08 07:50:39,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:39,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:50:39,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:50:39,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:39,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:39,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:39,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602956652] [2025-02-08 07:50:39,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602956652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:39,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985485837] [2025-02-08 07:50:39,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:39,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:50:39,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:50:39,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:50:39,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:50:39,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:50:39,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:50:39,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:39,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:39,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 07:50:39,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:50:40,010 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:50:40,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:50:40,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:50:40,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:40,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-08 07:50:40,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:50:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:40,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:50:40,170 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-08 07:50:40,171 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-08 07:50:40,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985485837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:40,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:50:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2025-02-08 07:50:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9726136] [2025-02-08 07:50:40,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:50:40,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:50:40,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:40,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:50:40,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=169, Unknown=6, NotChecked=0, Total=210 [2025-02-08 07:50:40,218 INFO L87 Difference]: Start difference. First operand 643 states and 731 transitions. Second operand has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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-08 07:50:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:41,962 INFO L93 Difference]: Finished difference Result 642 states and 730 transitions. [2025-02-08 07:50:41,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:50:41,962 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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 85 [2025-02-08 07:50:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:41,965 INFO L225 Difference]: With dead ends: 642 [2025-02-08 07:50:41,965 INFO L226 Difference]: Without dead ends: 642 [2025-02-08 07:50:41,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=372, Unknown=6, NotChecked=0, Total=462 [2025-02-08 07:50:41,966 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 519 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:41,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 3170 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 07:50:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-02-08 07:50:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2025-02-08 07:50:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 437 states have (on average 1.6270022883295194) internal successors, (711), 635 states have internal predecessors, (711), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 07:50:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 730 transitions. [2025-02-08 07:50:41,978 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 730 transitions. Word has length 85 [2025-02-08 07:50:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:41,979 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 730 transitions. [2025-02-08 07:50:41,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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-08 07:50:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 730 transitions. [2025-02-08 07:50:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 07:50:41,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:41,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:50:41,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 07:50:42,183 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,SelfDestructingSolverStorable13 [2025-02-08 07:50:42,184 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-08 07:50:42,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:42,184 INFO L85 PathProgramCache]: Analyzing trace with hash -151045994, now seen corresponding path program 1 times [2025-02-08 07:50:42,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:42,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589294569] [2025-02-08 07:50:42,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:42,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:42,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:50:42,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:50:42,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:42,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:42,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:42,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589294569] [2025-02-08 07:50:42,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589294569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:42,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718074553] [2025-02-08 07:50:42,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:42,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:50:42,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:50:42,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:50:42,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:50:42,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:50:43,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:50:43,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:43,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:43,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 07:50:43,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:50:43,128 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:50:43,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:50:43,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:50:43,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:50:43,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:50:43,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 07:50:43,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:50:43,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:43,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:50:43,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:50:43,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:50:43,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:50:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:43,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:50:43,505 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_582 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:50:43,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718074553] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:43,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:50:43,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-02-08 07:50:43,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23651418] [2025-02-08 07:50:43,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:50:43,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:50:43,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:43,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:50:43,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-02-08 07:50:43,510 INFO L87 Difference]: Start difference. First operand 642 states and 730 transitions. Second operand has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:50:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:45,407 INFO L93 Difference]: Finished difference Result 649 states and 737 transitions. [2025-02-08 07:50:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:50:45,407 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 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 85 [2025-02-08 07:50:45,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:45,410 INFO L225 Difference]: With dead ends: 649 [2025-02-08 07:50:45,410 INFO L226 Difference]: Without dead ends: 649 [2025-02-08 07:50:45,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-02-08 07:50:45,411 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 517 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 3218 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2697 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:45,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2697 Invalid, 3257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3218 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-08 07:50:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-08 07:50:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 640. [2025-02-08 07:50:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 436 states have (on average 1.6261467889908257) internal successors, (709), 633 states have internal predecessors, (709), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 725 transitions. [2025-02-08 07:50:45,423 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 725 transitions. Word has length 85 [2025-02-08 07:50:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:45,423 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 725 transitions. [2025-02-08 07:50:45,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:50:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 725 transitions. [2025-02-08 07:50:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 07:50:45,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:45,424 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] [2025-02-08 07:50:45,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:50:45,624 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,SelfDestructingSolverStorable14 [2025-02-08 07:50:45,625 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:45,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash -291474371, now seen corresponding path program 1 times [2025-02-08 07:50:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910243499] [2025-02-08 07:50:45,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:45,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 07:50:45,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 07:50:45,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:45,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:46,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:46,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910243499] [2025-02-08 07:50:46,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910243499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:46,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 07:50:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207633187] [2025-02-08 07:50:46,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:46,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:50:46,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:46,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:50:46,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:50:46,109 INFO L87 Difference]: Start difference. First operand 640 states and 725 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:47,421 INFO L93 Difference]: Finished difference Result 653 states and 741 transitions. [2025-02-08 07:50:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:50:47,421 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 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 87 [2025-02-08 07:50:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:47,424 INFO L225 Difference]: With dead ends: 653 [2025-02-08 07:50:47,424 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 07:50:47,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-08 07:50:47,425 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 521 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:47,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2847 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:50:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 07:50:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2025-02-08 07:50:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 444 states have (on average 1.6193693693693694) internal successors, (719), 641 states have internal predecessors, (719), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:50:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 736 transitions. [2025-02-08 07:50:47,436 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 736 transitions. Word has length 87 [2025-02-08 07:50:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:47,437 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 736 transitions. [2025-02-08 07:50:47,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 736 transitions. [2025-02-08 07:50:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 07:50:47,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:47,438 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] [2025-02-08 07:50:47,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:50:47,438 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:47,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash -291474370, now seen corresponding path program 1 times [2025-02-08 07:50:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:47,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102521726] [2025-02-08 07:50:47,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:47,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:47,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 07:50:47,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 07:50:47,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:47,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:48,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102521726] [2025-02-08 07:50:48,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102521726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:48,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:48,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 07:50:48,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405421813] [2025-02-08 07:50:48,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:48,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:50:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:48,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:50:48,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:50:48,045 INFO L87 Difference]: Start difference. First operand 649 states and 736 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:49,183 INFO L93 Difference]: Finished difference Result 652 states and 740 transitions. [2025-02-08 07:50:49,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 07:50:49,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 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 87 [2025-02-08 07:50:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:49,185 INFO L225 Difference]: With dead ends: 652 [2025-02-08 07:50:49,185 INFO L226 Difference]: Without dead ends: 652 [2025-02-08 07:50:49,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:50:49,186 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 518 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:49,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1982 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:50:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-08 07:50:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 649. [2025-02-08 07:50:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 444 states have (on average 1.617117117117117) internal successors, (718), 641 states have internal predecessors, (718), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:50:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 735 transitions. [2025-02-08 07:50:49,196 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 735 transitions. Word has length 87 [2025-02-08 07:50:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:49,196 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 735 transitions. [2025-02-08 07:50:49,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 735 transitions. [2025-02-08 07:50:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 07:50:49,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:49,197 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-08 07:50:49,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:50:49,198 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:49,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1314986557, now seen corresponding path program 1 times [2025-02-08 07:50:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259757063] [2025-02-08 07:50:49,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:49,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:50:49,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:50:49,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:49,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259757063] [2025-02-08 07:50:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259757063] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58719415] [2025-02-08 07:50:49,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:49,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:50:49,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:50:49,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:50:49,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:50:49,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:50:49,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:50:49,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:49,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:49,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 07:50:49,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:50:49,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:50:49,934 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:50:49,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:50:49,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:50:50,021 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:50,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:50:50,078 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:50,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:50:50,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:50:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:50,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:50:50,194 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-02-08 07:50:50,194 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-08 07:50:50,200 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_835 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_835))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_832)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-08 07:50:50,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58719415] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:50,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:50:50,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2025-02-08 07:50:50,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203727727] [2025-02-08 07:50:50,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:50:50,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 07:50:50,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:50,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 07:50:50,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=278, Unknown=13, NotChecked=34, Total=380 [2025-02-08 07:50:50,206 INFO L87 Difference]: Start difference. First operand 649 states and 735 transitions. Second operand has 17 states, 15 states have (on average 8.8) internal successors, (132), 17 states have internal predecessors, (132), 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-08 07:50:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:51,829 INFO L93 Difference]: Finished difference Result 651 states and 739 transitions. [2025-02-08 07:50:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:50:51,830 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.8) internal successors, (132), 17 states have internal predecessors, (132), 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 88 [2025-02-08 07:50:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:51,832 INFO L225 Difference]: With dead ends: 651 [2025-02-08 07:50:51,832 INFO L226 Difference]: Without dead ends: 651 [2025-02-08 07:50:51,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=526, Unknown=18, NotChecked=48, Total=702 [2025-02-08 07:50:51,833 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 489 mSDsluCounter, 3736 mSDsCounter, 0 mSdLazyCounter, 3614 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 4071 SdHoareTripleChecker+Invalid, 3638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 4071 Invalid, 3638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3614 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 07:50:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-08 07:50:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 648. [2025-02-08 07:50:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 444 states have (on average 1.614864864864865) internal successors, (717), 640 states have internal predecessors, (717), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:50:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 734 transitions. [2025-02-08 07:50:51,846 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 734 transitions. Word has length 88 [2025-02-08 07:50:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:51,846 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 734 transitions. [2025-02-08 07:50:51,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.8) internal successors, (132), 17 states have internal predecessors, (132), 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-08 07:50:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 734 transitions. [2025-02-08 07:50:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 07:50:51,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:51,847 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-08 07:50:51,856 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-08 07:50:52,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:50:52,048 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:52,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1314986558, now seen corresponding path program 1 times [2025-02-08 07:50:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:52,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286593471] [2025-02-08 07:50:52,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:52,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:50:52,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:50:52,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:52,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286593471] [2025-02-08 07:50:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286593471] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644292826] [2025-02-08 07:50:52,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:52,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:50:52,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:50:52,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:50:52,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:50:52,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:50:52,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:50:52,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:52,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:52,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 07:50:52,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:50:52,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:50:53,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:50:53,051 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:50:53,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:50:53,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:50:53,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:50:53,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 07:50:53,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:50:53,198 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:53,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:50:53,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:50:53,264 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:50:53,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:50:53,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:50:53,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:50:53,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:50:53,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-08 07:50:53,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:50:53,426 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_973 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_973 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:50:53,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_978) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_973 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_979))) (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~mem50#1.base| v_ArrVal_978) .cse1 v_ArrVal_973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:50:53,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644292826] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:50:53,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:50:53,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2025-02-08 07:50:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960441190] [2025-02-08 07:50:53,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:50:53,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 07:50:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:53,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 07:50:53,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=275, Unknown=14, NotChecked=70, Total=420 [2025-02-08 07:50:53,522 INFO L87 Difference]: Start difference. First operand 648 states and 734 transitions. Second operand has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 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-08 07:50:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:55,266 INFO L93 Difference]: Finished difference Result 650 states and 738 transitions. [2025-02-08 07:50:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:50:55,266 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 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 88 [2025-02-08 07:50:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:55,269 INFO L225 Difference]: With dead ends: 650 [2025-02-08 07:50:55,269 INFO L226 Difference]: Without dead ends: 650 [2025-02-08 07:50:55,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=447, Unknown=15, NotChecked=90, Total=650 [2025-02-08 07:50:55,270 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 491 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 3517 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:55,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 3014 Invalid, 3541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3517 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 07:50:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-02-08 07:50:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 638. [2025-02-08 07:50:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 436 states have (on average 1.621559633027523) internal successors, (707), 631 states have internal predecessors, (707), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:50:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 723 transitions. [2025-02-08 07:50:55,283 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 723 transitions. Word has length 88 [2025-02-08 07:50:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:55,283 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 723 transitions. [2025-02-08 07:50:55,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 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-08 07:50:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 723 transitions. [2025-02-08 07:50:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 07:50:55,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:55,284 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] [2025-02-08 07:50:55,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 07:50:55,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:50:55,488 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:55,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1111376494, now seen corresponding path program 1 times [2025-02-08 07:50:55,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:55,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654413842] [2025-02-08 07:50:55,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:55,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 07:50:55,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 07:50:55,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:55,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:55,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:55,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654413842] [2025-02-08 07:50:55,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654413842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:55,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:55,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 07:50:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880157173] [2025-02-08 07:50:55,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:55,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:50:55,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:55,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:50:55,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:50:55,981 INFO L87 Difference]: Start difference. First operand 638 states and 723 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:57,329 INFO L93 Difference]: Finished difference Result 654 states and 742 transitions. [2025-02-08 07:50:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:50:57,330 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 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 90 [2025-02-08 07:50:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:57,332 INFO L225 Difference]: With dead ends: 654 [2025-02-08 07:50:57,332 INFO L226 Difference]: Without dead ends: 654 [2025-02-08 07:50:57,332 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-08 07:50:57,333 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 503 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3460 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:57,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3460 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3139 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:50:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-08 07:50:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 650. [2025-02-08 07:50:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 447 states have (on average 1.610738255033557) internal successors, (720), 642 states have internal predecessors, (720), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:50:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 737 transitions. [2025-02-08 07:50:57,343 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 737 transitions. Word has length 90 [2025-02-08 07:50:57,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:57,344 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 737 transitions. [2025-02-08 07:50:57,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 737 transitions. [2025-02-08 07:50:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 07:50:57,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:57,345 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] [2025-02-08 07:50:57,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 07:50:57,345 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr214REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:50:57,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:57,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1111376495, now seen corresponding path program 1 times [2025-02-08 07:50:57,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:57,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967259582] [2025-02-08 07:50:57,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:57,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 07:50:57,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 07:50:57,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:57,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:50:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:50:57,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:50:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967259582] [2025-02-08 07:50:57,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967259582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:50:57,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:50:57,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 07:50:57,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306637767] [2025-02-08 07:50:57,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:50:57,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 07:50:57,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:50:57,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 07:50:57,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 07:50:57,989 INFO L87 Difference]: Start difference. First operand 650 states and 737 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:50:59,528 INFO L93 Difference]: Finished difference Result 653 states and 741 transitions. [2025-02-08 07:50:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:50:59,529 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 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 90 [2025-02-08 07:50:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:50:59,531 INFO L225 Difference]: With dead ends: 653 [2025-02-08 07:50:59,531 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 07:50:59,531 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-08 07:50:59,532 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 502 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2464 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:50:59,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2464 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2902 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:50:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 07:50:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2025-02-08 07:50:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 447 states have (on average 1.6085011185682327) internal successors, (719), 642 states have internal predecessors, (719), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:50:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 736 transitions. [2025-02-08 07:50:59,541 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 736 transitions. Word has length 90 [2025-02-08 07:50:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:50:59,542 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 736 transitions. [2025-02-08 07:50:59,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:50:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 736 transitions. [2025-02-08 07:50:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 07:50:59,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:50:59,543 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-08 07:50:59,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 07:50:59,543 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-08 07:50:59,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:50:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash 368303214, now seen corresponding path program 1 times [2025-02-08 07:50:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:50:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061757538] [2025-02-08 07:50:59,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:50:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:50:59,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:50:59,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:50:59,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:50:59,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:00,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061757538] [2025-02-08 07:51:00,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061757538] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411910125] [2025-02-08 07:51:00,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:00,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:51:00,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:51:00,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:51:00,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:51:00,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:51:00,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:51:00,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:00,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:00,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 07:51:00,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:51:00,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:51:00,320 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:51:00,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:51:00,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:51:00,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:00,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:00,447 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:00,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:00,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:00,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:00,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:51:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:00,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:51:00,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (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_1252))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1253)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:51:04,740 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-02-08 07:51:04,740 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-08 07:51:04,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1256))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1252)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1253)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-08 07:51:04,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411910125] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:04,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:51:04,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-02-08 07:51:04,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441244407] [2025-02-08 07:51:04,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:51:04,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 07:51:04,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:04,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 07:51:04,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=373, Unknown=24, NotChecked=82, Total=552 [2025-02-08 07:51:04,754 INFO L87 Difference]: Start difference. First operand 650 states and 736 transitions. Second operand has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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-08 07:51:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:06,369 INFO L93 Difference]: Finished difference Result 652 states and 740 transitions. [2025-02-08 07:51:06,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:51:06,370 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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 91 [2025-02-08 07:51:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:06,372 INFO L225 Difference]: With dead ends: 652 [2025-02-08 07:51:06,372 INFO L226 Difference]: Without dead ends: 652 [2025-02-08 07:51:06,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=144, Invalid=709, Unknown=25, NotChecked=114, Total=992 [2025-02-08 07:51:06,376 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 491 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 3082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:06,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 3443 Invalid, 3082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 07:51:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-08 07:51:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 649. [2025-02-08 07:51:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 447 states have (on average 1.6062639821029083) internal successors, (718), 641 states have internal predecessors, (718), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:51:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 735 transitions. [2025-02-08 07:51:06,391 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 735 transitions. Word has length 91 [2025-02-08 07:51:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:06,391 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 735 transitions. [2025-02-08 07:51:06,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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-08 07:51:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 735 transitions. [2025-02-08 07:51:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 07:51:06,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:06,392 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-08 07:51:06,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 07:51:06,593 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,SelfDestructingSolverStorable21 [2025-02-08 07:51:06,593 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-08 07:51:06,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash 368303215, now seen corresponding path program 1 times [2025-02-08 07:51:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:06,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23553886] [2025-02-08 07:51:06,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:06,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:06,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:51:06,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:51:06,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:06,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:07,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:07,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23553886] [2025-02-08 07:51:07,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23553886] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:07,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5191152] [2025-02-08 07:51:07,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:07,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:51:07,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:51:07,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:51:07,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:51:07,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:51:07,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:51:07,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:07,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:07,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 07:51:07,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:51:07,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:51:07,578 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:51:07,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:51:07,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:51:07,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:51:07,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:51:07,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 07:51:07,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:51:07,728 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:07,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:51:07,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:07,789 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:07,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:51:07,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:07,844 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:07,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:51:07,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:07,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:51:07,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:51:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:07,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:51:07,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1407) |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_1408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2025-02-08 07:51:07,936 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_1407 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:51:07,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1406))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1405) .cse0 v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1405) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-02-08 07:51:07,978 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_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1405) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1406))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1405) .cse2 v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-02-08 07:51:08,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1414))) (let ((.cse0 (select (select .cse1 |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_1413) .cse0 v_ArrVal_1405) (select (select (store .cse1 .cse0 v_ArrVal_1406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1407))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1414))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1406))) (let ((.cse4 (select (select .cse5 |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_1413) .cse3 v_ArrVal_1405) .cse4 v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 07:51:08,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5191152] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:08,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:51:08,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2025-02-08 07:51:08,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313699786] [2025-02-08 07:51:08,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:51:08,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 07:51:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:08,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 07:51:08,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2025-02-08 07:51:08,040 INFO L87 Difference]: Start difference. First operand 649 states and 735 transitions. Second operand has 18 states, 16 states have (on average 8.5) internal successors, (136), 18 states have internal predecessors, (136), 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-08 07:51:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:09,603 INFO L93 Difference]: Finished difference Result 651 states and 739 transitions. [2025-02-08 07:51:09,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:51:09,604 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.5) internal successors, (136), 18 states have internal predecessors, (136), 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 91 [2025-02-08 07:51:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:09,605 INFO L225 Difference]: With dead ends: 651 [2025-02-08 07:51:09,605 INFO L226 Difference]: Without dead ends: 651 [2025-02-08 07:51:09,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2025-02-08 07:51:09,606 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 492 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:09,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1943 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:51:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-08 07:51:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 636. [2025-02-08 07:51:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 436 states have (on average 1.6169724770642202) internal successors, (705), 629 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:51:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 721 transitions. [2025-02-08 07:51:09,614 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 721 transitions. Word has length 91 [2025-02-08 07:51:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:09,615 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 721 transitions. [2025-02-08 07:51:09,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.5) internal successors, (136), 18 states have internal predecessors, (136), 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-08 07:51:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 721 transitions. [2025-02-08 07:51:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 07:51:09,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:09,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:51:09,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 07:51:09,816 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,SelfDestructingSolverStorable22 [2025-02-08 07:51:09,817 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:51:09,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:09,817 INFO L85 PathProgramCache]: Analyzing trace with hash -885268618, now seen corresponding path program 1 times [2025-02-08 07:51:09,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:09,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346077787] [2025-02-08 07:51:09,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:09,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:51:09,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:51:09,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:09,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:10,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:10,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346077787] [2025-02-08 07:51:10,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346077787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:51:10,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:51:10,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 07:51:10,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677835127] [2025-02-08 07:51:10,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:51:10,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 07:51:10,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:10,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 07:51:10,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:51:10,393 INFO L87 Difference]: Start difference. First operand 636 states and 721 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:51:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:11,674 INFO L93 Difference]: Finished difference Result 655 states and 743 transitions. [2025-02-08 07:51:11,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:51:11,674 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-02-08 07:51:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:11,676 INFO L225 Difference]: With dead ends: 655 [2025-02-08 07:51:11,676 INFO L226 Difference]: Without dead ends: 655 [2025-02-08 07:51:11,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-02-08 07:51:11,676 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 510 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:11,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 2503 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 07:51:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-08 07:51:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 651. [2025-02-08 07:51:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 450 states have (on average 1.6022222222222222) internal successors, (721), 643 states have internal predecessors, (721), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:51:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 738 transitions. [2025-02-08 07:51:11,688 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 738 transitions. Word has length 93 [2025-02-08 07:51:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:11,689 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 738 transitions. [2025-02-08 07:51:11,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:51:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 738 transitions. [2025-02-08 07:51:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 07:51:11,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:11,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:51:11,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 07:51:11,690 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr210REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:51:11,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash -885268617, now seen corresponding path program 1 times [2025-02-08 07:51:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:11,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854121360] [2025-02-08 07:51:11,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:11,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:11,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:51:11,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:51:11,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:11,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:12,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:12,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854121360] [2025-02-08 07:51:12,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854121360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:51:12,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:51:12,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 07:51:12,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659360495] [2025-02-08 07:51:12,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:51:12,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:51:12,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:12,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:51:12,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:51:12,329 INFO L87 Difference]: Start difference. First operand 651 states and 738 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:51:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:13,645 INFO L93 Difference]: Finished difference Result 654 states and 742 transitions. [2025-02-08 07:51:13,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 07:51:13,645 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-02-08 07:51:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:13,647 INFO L225 Difference]: With dead ends: 654 [2025-02-08 07:51:13,647 INFO L226 Difference]: Without dead ends: 654 [2025-02-08 07:51:13,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-02-08 07:51:13,648 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 503 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:13,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1989 Invalid, 2235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:51:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-08 07:51:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2025-02-08 07:51:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 450 states have (on average 1.6) internal successors, (720), 643 states have internal predecessors, (720), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:51:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 737 transitions. [2025-02-08 07:51:13,654 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 737 transitions. Word has length 93 [2025-02-08 07:51:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:13,654 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 737 transitions. [2025-02-08 07:51:13,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:51:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 737 transitions. [2025-02-08 07:51:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 07:51:13,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:13,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:51:13,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 07:51:13,656 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-08 07:51:13,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1519909514, now seen corresponding path program 1 times [2025-02-08 07:51:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:13,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878496458] [2025-02-08 07:51:13,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:13,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:51:13,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:51:13,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:13,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:14,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878496458] [2025-02-08 07:51:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878496458] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787838534] [2025-02-08 07:51:14,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:14,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:51:14,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:51:14,232 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:51:14,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:51:14,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:51:14,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:51:14,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:14,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:14,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 07:51:14,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:51:14,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:51:14,507 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:51:14,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:51:14,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:51:14,583 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:14,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:14,638 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:14,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:14,678 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:14,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:14,724 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:14,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:14,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:51:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:14,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:51:14,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 07:51:14,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (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_1711))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1712)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1713)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:51:15,036 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-02-08 07:51:15,036 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-08 07:51:15,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787838534] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:15,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:51:15,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-02-08 07:51:15,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361060431] [2025-02-08 07:51:15,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:51:15,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 07:51:15,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:15,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 07:51:15,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=513, Unknown=47, NotChecked=98, Total=756 [2025-02-08 07:51:15,114 INFO L87 Difference]: Start difference. First operand 651 states and 737 transitions. Second operand has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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-08 07:51:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:16,424 INFO L93 Difference]: Finished difference Result 653 states and 741 transitions. [2025-02-08 07:51:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:51:16,425 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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 94 [2025-02-08 07:51:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:16,427 INFO L225 Difference]: With dead ends: 653 [2025-02-08 07:51:16,427 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 07:51:16,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=959, Unknown=50, NotChecked=134, Total=1332 [2025-02-08 07:51:16,430 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 493 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:16,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2519 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 07:51:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 07:51:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2025-02-08 07:51:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 450 states have (on average 1.5977777777777777) internal successors, (719), 642 states have internal predecessors, (719), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:51:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 736 transitions. [2025-02-08 07:51:16,455 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 736 transitions. Word has length 94 [2025-02-08 07:51:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:16,456 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 736 transitions. [2025-02-08 07:51:16,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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-08 07:51:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 736 transitions. [2025-02-08 07:51:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 07:51:16,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:16,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:51:16,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 07:51:16,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:51:16,666 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-08 07:51:16,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1519909513, now seen corresponding path program 1 times [2025-02-08 07:51:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681596410] [2025-02-08 07:51:16,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:16,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:51:16,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:51:16,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:16,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:17,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681596410] [2025-02-08 07:51:17,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681596410] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001285585] [2025-02-08 07:51:17,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:17,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:51:17,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:51:17,473 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:51:17,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 07:51:17,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:51:17,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:51:17,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:17,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:17,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 07:51:17,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:51:17,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:51:17,931 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:51:17,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:51:17,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:51:17,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:51:17,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:51:18,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 07:51:18,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:51:18,105 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:18,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:51:18,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:18,171 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:18,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:51:18,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:18,240 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:18,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:51:18,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:18,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:18,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:51:18,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:18,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:51:18,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:51:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:18,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:51:18,369 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1881) |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_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1881 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:51:18,379 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_1881 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:51:18,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1879) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1880))) (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_1879) .cse1 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:51:18,416 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_1879 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1879) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1880))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1879) .cse2 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-02-08 07:51:18,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1878))) (let ((.cse0 (select (select .cse1 |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_1877) .cse0 v_ArrVal_1879) (select (select (store .cse1 .cse0 v_ArrVal_1880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1881))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1878))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1880))) (let ((.cse4 (select (select .cse5 |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_1877) .cse3 v_ArrVal_1879) .cse4 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 07:51:18,477 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1878))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1880))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1877) .cse1 v_ArrVal_1879) .cse2 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1878))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1877) .cse6 v_ArrVal_1879) (select (select (store .cse7 .cse6 v_ArrVal_1880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1881))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-02-08 07:51:18,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1888))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1878))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1880))) (let ((.cse2 (select (select .cse4 |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_1887) .cse0 v_ArrVal_1877) .cse1 v_ArrVal_1879) .cse2 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1888))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1878))) (let ((.cse8 (select (select .cse9 |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_1887) .cse7 v_ArrVal_1877) .cse8 v_ArrVal_1879) (select (select (store .cse9 .cse8 v_ArrVal_1880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1881))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-02-08 07:51:18,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001285585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:18,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:51:18,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2025-02-08 07:51:18,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782708168] [2025-02-08 07:51:18,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:51:18,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 07:51:18,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:18,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 07:51:18,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=394, Unknown=7, NotChecked=322, Total=812 [2025-02-08 07:51:18,575 INFO L87 Difference]: Start difference. First operand 650 states and 736 transitions. Second operand has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 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-08 07:51:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:20,564 INFO L93 Difference]: Finished difference Result 652 states and 740 transitions. [2025-02-08 07:51:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:51:20,564 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 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 94 [2025-02-08 07:51:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:20,566 INFO L225 Difference]: With dead ends: 652 [2025-02-08 07:51:20,566 INFO L226 Difference]: Without dead ends: 652 [2025-02-08 07:51:20,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=690, Unknown=7, NotChecked=420, Total=1260 [2025-02-08 07:51:20,567 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 491 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 3257 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:20,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2704 Invalid, 3294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3257 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-08 07:51:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-08 07:51:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 634. [2025-02-08 07:51:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 436 states have (on average 1.6123853211009174) internal successors, (703), 627 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:51:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 719 transitions. [2025-02-08 07:51:20,573 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 719 transitions. Word has length 94 [2025-02-08 07:51:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:20,573 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 719 transitions. [2025-02-08 07:51:20,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 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-08 07:51:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 719 transitions. [2025-02-08 07:51:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 07:51:20,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:20,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:51:20,581 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-08 07:51:20,774 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,SelfDestructingSolverStorable26 [2025-02-08 07:51:20,774 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:51:20,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash 60072112, now seen corresponding path program 1 times [2025-02-08 07:51:20,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:20,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351933044] [2025-02-08 07:51:20,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:20,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:20,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 07:51:20,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 07:51:20,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:20,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351933044] [2025-02-08 07:51:21,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351933044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:51:21,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:51:21,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 07:51:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816100396] [2025-02-08 07:51:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:51:21,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 07:51:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:21,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 07:51:21,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:51:21,484 INFO L87 Difference]: Start difference. First operand 634 states and 719 transitions. Second operand has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:51:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:23,197 INFO L93 Difference]: Finished difference Result 657 states and 745 transitions. [2025-02-08 07:51:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:51:23,198 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 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 97 [2025-02-08 07:51:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:23,200 INFO L225 Difference]: With dead ends: 657 [2025-02-08 07:51:23,200 INFO L226 Difference]: Without dead ends: 657 [2025-02-08 07:51:23,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-02-08 07:51:23,201 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 512 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 3161 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:23,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 3409 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3161 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 07:51:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-02-08 07:51:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 653. [2025-02-08 07:51:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 454 states have (on average 1.592511013215859) internal successors, (723), 645 states have internal predecessors, (723), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:51:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 740 transitions. [2025-02-08 07:51:23,207 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 740 transitions. Word has length 97 [2025-02-08 07:51:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:23,207 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 740 transitions. [2025-02-08 07:51:23,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:51:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 740 transitions. [2025-02-08 07:51:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 07:51:23,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:23,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:51:23,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 07:51:23,208 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr206REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:51:23,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash 60072113, now seen corresponding path program 1 times [2025-02-08 07:51:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:23,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041450049] [2025-02-08 07:51:23,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:23,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 07:51:23,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 07:51:23,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:23,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:24,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041450049] [2025-02-08 07:51:24,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041450049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:51:24,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:51:24,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 07:51:24,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945482024] [2025-02-08 07:51:24,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:51:24,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 07:51:24,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:24,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 07:51:24,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-08 07:51:24,223 INFO L87 Difference]: Start difference. First operand 653 states and 740 transitions. Second operand has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:51:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:26,498 INFO L93 Difference]: Finished difference Result 656 states and 744 transitions. [2025-02-08 07:51:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:51:26,498 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 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 97 [2025-02-08 07:51:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:26,500 INFO L225 Difference]: With dead ends: 656 [2025-02-08 07:51:26,500 INFO L226 Difference]: Without dead ends: 656 [2025-02-08 07:51:26,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-02-08 07:51:26,500 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 503 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 3944 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 3970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:26,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3213 Invalid, 3970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3944 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 07:51:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-02-08 07:51:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 653. [2025-02-08 07:51:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 454 states have (on average 1.5903083700440528) internal successors, (722), 645 states have internal predecessors, (722), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:51:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 739 transitions. [2025-02-08 07:51:26,514 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 739 transitions. Word has length 97 [2025-02-08 07:51:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:26,515 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 739 transitions. [2025-02-08 07:51:26,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:51:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 739 transitions. [2025-02-08 07:51:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:51:26,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:26,516 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-08 07:51:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 07:51:26,516 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-08 07:51:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -12728656, now seen corresponding path program 1 times [2025-02-08 07:51:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901900546] [2025-02-08 07:51:26,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:26,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:51:26,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:51:26,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:26,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901900546] [2025-02-08 07:51:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901900546] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542112607] [2025-02-08 07:51:27,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:27,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:51:27,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:51:27,219 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:51:27,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 07:51:27,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:51:27,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:51:27,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:27,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:27,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 07:51:27,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:51:27,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:51:27,541 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:51:27,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:51:27,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:51:27,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:27,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:27,605 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:27,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:27,645 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:27,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:27,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:27,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:27,720 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:27,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:51:27,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:51:27,753 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 07:51:27,754 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-08 07:51:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:27,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:51:28,517 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-02-08 07:51:28,518 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-08 07:51:28,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2220 (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_2224))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2217)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2218)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2219)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2220)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-02-08 07:51:28,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542112607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:28,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:51:28,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 20 [2025-02-08 07:51:28,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816099375] [2025-02-08 07:51:28,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:51:28,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 07:51:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:28,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 07:51:28,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=755, Unknown=41, NotChecked=58, Total=992 [2025-02-08 07:51:28,550 INFO L87 Difference]: Start difference. First operand 653 states and 739 transitions. Second operand has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:51:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:51:30,361 INFO L93 Difference]: Finished difference Result 655 states and 743 transitions. [2025-02-08 07:51:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 07:51:30,361 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 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-08 07:51:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:51:30,363 INFO L225 Difference]: With dead ends: 655 [2025-02-08 07:51:30,363 INFO L226 Difference]: Without dead ends: 655 [2025-02-08 07:51:30,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=1346, Unknown=41, NotChecked=78, Total=1722 [2025-02-08 07:51:30,364 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 490 mSDsluCounter, 3396 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 3728 SdHoareTripleChecker+Invalid, 3399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:51:30,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 3728 Invalid, 3399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 07:51:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-08 07:51:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 652. [2025-02-08 07:51:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 454 states have (on average 1.5881057268722467) internal successors, (721), 644 states have internal predecessors, (721), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:51:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 738 transitions. [2025-02-08 07:51:30,371 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 738 transitions. Word has length 98 [2025-02-08 07:51:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:51:30,372 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 738 transitions. [2025-02-08 07:51:30,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:51:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 738 transitions. [2025-02-08 07:51:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:51:30,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:51:30,372 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-08 07:51:30,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 07:51:30,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:51:30,573 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-08 07:51:30,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:51:30,573 INFO L85 PathProgramCache]: Analyzing trace with hash -12728655, now seen corresponding path program 1 times [2025-02-08 07:51:30,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:51:30,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704723441] [2025-02-08 07:51:30,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:51:30,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:51:30,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:51:30,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:30,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:31,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:51:31,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704723441] [2025-02-08 07:51:31,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704723441] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:31,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833222495] [2025-02-08 07:51:31,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:51:31,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:51:31,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:51:31,455 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:51:31,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 07:51:31,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:51:31,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:51:31,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:51:31,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:51:31,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 07:51:31,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:51:31,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:51:31,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:51:31,797 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:51:31,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:51:31,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:51:31,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:51:31,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 07:51:31,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:51:32,060 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:32,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-08 07:51:32,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:32,163 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:32,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-08 07:51:32,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:32,251 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:32,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-08 07:51:32,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:32,328 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:32,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-08 07:51:32,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:32,409 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:51:32,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-08 07:51:32,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 07:51:32,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-02-08 07:51:32,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:51:32,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:51:32,499 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-02-08 07:51:32,499 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-08 07:51:32,510 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:51:32,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:51:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:51:32,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:51:33,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2404))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2403) .cse1 v_ArrVal_2406) (select (select (store .cse2 .cse1 v_ArrVal_2405) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2408))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2408 (Array Int Int))) (or (forall ((v_ArrVal_2409 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2404))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2405))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2403) .cse4 v_ArrVal_2406) .cse5 v_ArrVal_2408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2409) (select (select (store .cse6 .cse5 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))))))) is different from false [2025-02-08 07:51:33,363 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2401))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2404))) (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~mem52#1.base| v_ArrVal_2402) .cse0 v_ArrVal_2403) .cse1 v_ArrVal_2406) (select (select (store .cse2 .cse1 v_ArrVal_2405) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2408))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2408 (Array Int Int))) (or (forall ((v_ArrVal_2409 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2401))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2404))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2405))) (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~mem52#1.base| v_ArrVal_2402) .cse5 v_ArrVal_2403) .cse6 v_ArrVal_2406) .cse7 v_ArrVal_2408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2409) (select (select (store .cse8 .cse7 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false [2025-02-08 07:51:39,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:51:39,789 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-08 07:51:40,302 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2415 (Array Int Int)) (v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2414 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2414))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2401))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2404))) (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_ArrVal_2415) .cse0 v_ArrVal_2402) .cse1 v_ArrVal_2403) .cse2 v_ArrVal_2406) (select (select (store .cse3 .cse2 v_ArrVal_2405) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2408))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2409 Int) (v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_25 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))) (or (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_25) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_21))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_prenex_24))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_prenex_20))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_prenex_18))) (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_prenex_19) .cse7 v_prenex_23) .cse8 v_prenex_22) .cse9 v_prenex_17) .cse10 v_prenex_26) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| v_prenex_25 v_ArrVal_2409) (select (select (store .cse11 .cse10 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2025-02-08 07:51:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833222495] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:51:40,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:51:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2025-02-08 07:51:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251663041] [2025-02-08 07:51:40,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:51:40,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 07:51:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:51:40,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 07:51:40,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1426, Unknown=40, NotChecked=240, Total=1892 [2025-02-08 07:51:40,312 INFO L87 Difference]: Start difference. First operand 652 states and 738 transitions. Second operand has 32 states, 29 states have (on average 5.482758620689655) internal successors, (159), 30 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)