./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strtok_r.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-dietlibc/strtok_r.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 768358a1bcdb56fc885a8df113baa43d689898e0e32c0ab06e790a868148d36d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:15:31,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:15:31,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 06:15:31,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:15:31,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:15:31,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:15:31,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:15:31,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:15:31,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:15:31,822 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:15:31,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:15:31,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:15:31,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:15:31,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:15:31,823 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:15:31,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:15:31,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:15:31,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:15:31,824 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:15:31,824 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:15:31,824 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:15:31,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:15:31,824 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:15:31,824 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:15:31,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:15:31,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:15:31,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:15:31,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:15:31,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:15:31,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:15:31,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:15:31,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:15:31,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:15:31,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:15:31,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:15:31,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:15:31,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:15:31,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:15:31,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:15:31,826 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 768358a1bcdb56fc885a8df113baa43d689898e0e32c0ab06e790a868148d36d [2025-02-08 06:15:32,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:15:32,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:15:32,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:15:32,071 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:15:32,072 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:15:32,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strtok_r.i [2025-02-08 06:15:33,235 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/853c804a3/6360d4c1bf094dd5ac660d5a0a6dcb4a/FLAGbcffde57d [2025-02-08 06:15:33,568 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:15:33,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strtok_r.i [2025-02-08 06:15:33,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/853c804a3/6360d4c1bf094dd5ac660d5a0a6dcb4a/FLAGbcffde57d [2025-02-08 06:15:33,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/853c804a3/6360d4c1bf094dd5ac660d5a0a6dcb4a [2025-02-08 06:15:33,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:15:33,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:15:33,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:15:33,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:15:33,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:15:33,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:15:33" (1/1) ... [2025-02-08 06:15:33,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a274b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:33, skipping insertion in model container [2025-02-08 06:15:33,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:15:33" (1/1) ... [2025-02-08 06:15:33,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:15:34,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:15:34,039 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:15:34,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:15:34,101 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:15:34,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34 WrapperNode [2025-02-08 06:15:34,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:15:34,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:15:34,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:15:34,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:15:34,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,123 INFO L138 Inliner]: procedures = 118, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2025-02-08 06:15:34,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:15:34,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:15:34,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:15:34,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:15:34,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,141 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [3, 8, 5]. 50 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0, 0]. The 3 writes are split as follows [1, 2, 0]. [2025-02-08 06:15:34,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:15:34,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:15:34,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:15:34,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:15:34,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (1/1) ... [2025-02-08 06:15:34,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:15:34,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:15:34,181 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 06:15:34,183 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 06:15:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:15:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:15:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:15:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:15:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:15:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:15:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:15:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:15:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:15:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:15:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:15:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:15:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:15:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:15:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:15:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:15:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:15:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:15:34,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:15:34,292 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:15:34,293 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:15:34,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L536: strtok_r_#t~ret21#1 := strcspn_#res#1;havoc strcspn_#t~mem11#1, strcspn_#t~mem12#1, strcspn_#t~mem13#1, strcspn_#t~mem14#1, strcspn_#t~pre15#1, strcspn_#t~pre16#1, strcspn_#t~pre17#1.base, strcspn_#t~pre17#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~1#1, strcspn_~i~0#1;havoc strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;assume { :end_inline_strcspn } true;strtok_r_~s#1.base, strtok_r_~s#1.offset := strtok_r_~s#1.base, strtok_r_~s#1.offset + (if strtok_r_#t~ret21#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then strtok_r_#t~ret21#1 % 18446744073709551616 % 18446744073709551616 else strtok_r_#t~ret21#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc strtok_r_#t~ret21#1; [2025-02-08 06:15:34,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L537: SUMMARY for call write~int#1(0, strtok_r_#t~post23#1.base, strtok_r_#t~post23#1.offset, 1); srcloc: null [2025-02-08 06:15:34,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L537: assume !(1 == #valid[strtok_r_#t~post23#1.base]); [2025-02-08 06:15:34,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L537: assume !(1 + strtok_r_#t~post23#1.offset <= #length[strtok_r_#t~post23#1.base] && 0 <= strtok_r_#t~post23#1.offset); [2025-02-08 06:15:34,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L537-1: assume 0 != strtok_r_#t~mem22#1;havoc strtok_r_#t~mem22#1;strtok_r_#t~post23#1.base, strtok_r_#t~post23#1.offset := strtok_r_~s#1.base, strtok_r_~s#1.offset;strtok_r_~s#1.base, strtok_r_~s#1.offset := strtok_r_#t~post23#1.base, 1 + strtok_r_#t~post23#1.offset; [2025-02-08 06:15:34,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L537-1: assume !(0 != strtok_r_#t~mem22#1);havoc strtok_r_#t~mem22#1; [2025-02-08 06:15:34,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L537-2: SUMMARY for call strtok_r_#t~mem22#1 := read~int#1(strtok_r_~s#1.base, strtok_r_~s#1.offset, 1); srcloc: null [2025-02-08 06:15:34,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L537-2: assume !(1 == #valid[strtok_r_~s#1.base]); [2025-02-08 06:15:34,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L537-2: assume !(1 + strtok_r_~s#1.offset <= #length[strtok_r_~s#1.base] && 0 <= strtok_r_~s#1.offset); [2025-02-08 06:15:34,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc main_#t~ret28#1.base, main_#t~ret28#1.offset;call ULTIMATE.dealloc(main_#t~malloc25#1.base, main_#t~malloc25#1.offset);havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;call ULTIMATE.dealloc(main_#t~malloc27#1.base, main_#t~malloc27#1.offset);havoc main_#t~malloc27#1.base, main_#t~malloc27#1.offset;call ULTIMATE.dealloc(main_~#ptr~0#1.base, main_~#ptr~0#1.offset);havoc main_~#ptr~0#1.base, main_~#ptr~0#1.offset; [2025-02-08 06:15:34,549 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-02-08 06:15:34,549 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:15:34,557 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:15:34,558 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:15:34,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:15:34 BoogieIcfgContainer [2025-02-08 06:15:34,558 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:15:34,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:15:34,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:15:34,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:15:34,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:15:33" (1/3) ... [2025-02-08 06:15:34,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f1fc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:15:34, skipping insertion in model container [2025-02-08 06:15:34,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:15:34" (2/3) ... [2025-02-08 06:15:34,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f1fc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:15:34, skipping insertion in model container [2025-02-08 06:15:34,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:15:34" (3/3) ... [2025-02-08 06:15:34,573 INFO L128 eAbstractionObserver]: Analyzing ICFG strtok_r.i [2025-02-08 06:15:34,586 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:15:34,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG strtok_r.i that has 1 procedures, 69 locations, 1 initial locations, 4 loop locations, and 31 error locations. [2025-02-08 06:15:34,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:15:34,627 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;@ecc46b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:15:34,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-02-08 06:15:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 2.05) internal successors, (82), 68 states have internal predecessors, (82), 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 06:15:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:15:34,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:34,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:15:34,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:34,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:34,639 INFO L85 PathProgramCache]: Analyzing trace with hash 137827, now seen corresponding path program 1 times [2025-02-08 06:15:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:34,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942919008] [2025-02-08 06:15:34,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:34,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:15:34,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:15:34,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:34,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:34,743 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 06:15:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942919008] [2025-02-08 06:15:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942919008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:34,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:34,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:15:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936436574] [2025-02-08 06:15:34,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:34,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:15:34,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:34,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:15:34,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:34,770 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 2.05) internal successors, (82), 68 states have internal predecessors, (82), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:34,836 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2025-02-08 06:15:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:15:34,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:15:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:34,842 INFO L225 Difference]: With dead ends: 70 [2025-02-08 06:15:34,842 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 06:15:34,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:34,848 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:34,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:15:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 06:15:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 06:15:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.894736842105263) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2025-02-08 06:15:34,882 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 3 [2025-02-08 06:15:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:34,882 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2025-02-08 06:15:34,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2025-02-08 06:15:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:15:34,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:34,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:15:34,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:15:34,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:34,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:34,883 INFO L85 PathProgramCache]: Analyzing trace with hash 137990, now seen corresponding path program 1 times [2025-02-08 06:15:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:34,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416548105] [2025-02-08 06:15:34,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:34,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:34,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:15:34,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:15:34,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:34,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:34,960 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 06:15:34,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416548105] [2025-02-08 06:15:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416548105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:34,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:34,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:15:34,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968852979] [2025-02-08 06:15:34,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:34,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:15:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:34,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:15:34,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:34,963 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:35,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:35,003 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-02-08 06:15:35,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:15:35,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:15:35,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:35,004 INFO L225 Difference]: With dead ends: 64 [2025-02-08 06:15:35,004 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 06:15:35,004 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 06:15:35,004 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:35,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 06:15:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 06:15:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.868421052631579) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2025-02-08 06:15:35,008 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 3 [2025-02-08 06:15:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:35,008 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2025-02-08 06:15:35,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2025-02-08 06:15:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:15:35,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:35,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:15:35,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:15:35,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:35,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:35,010 INFO L85 PathProgramCache]: Analyzing trace with hash 137991, now seen corresponding path program 1 times [2025-02-08 06:15:35,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:35,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487544509] [2025-02-08 06:15:35,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:35,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:35,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:15:35,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:15:35,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:35,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:15:35,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:35,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487544509] [2025-02-08 06:15:35,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487544509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:35,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:35,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:15:35,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547964562] [2025-02-08 06:15:35,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:35,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:15:35,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:35,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:15:35,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:15:35,116 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:35,156 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2025-02-08 06:15:35,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:15:35,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:15:35,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:35,157 INFO L225 Difference]: With dead ends: 63 [2025-02-08 06:15:35,157 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 06:15:35,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:15:35,158 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:35,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 06:15:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-08 06:15:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 62 states have internal predecessors, (70), 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 06:15:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2025-02-08 06:15:35,161 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 3 [2025-02-08 06:15:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:35,161 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2025-02-08 06:15:35,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2025-02-08 06:15:35,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:15:35,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:35,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:15:35,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:15:35,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:35,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash -184037889, now seen corresponding path program 1 times [2025-02-08 06:15:35,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:35,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444019228] [2025-02-08 06:15:35,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:35,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:35,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:15:35,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:15:35,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:35,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:15:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444019228] [2025-02-08 06:15:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444019228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:15:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732774643] [2025-02-08 06:15:35,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:35,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:15:35,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:35,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:15:35,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:15:35,287 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 06:15:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:35,339 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2025-02-08 06:15:35,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:15:35,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-08 06:15:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:35,340 INFO L225 Difference]: With dead ends: 64 [2025-02-08 06:15:35,340 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 06:15:35,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:15:35,341 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:35,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 06:15:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-08 06:15:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2025-02-08 06:15:35,344 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 6 [2025-02-08 06:15:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:35,344 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-02-08 06:15:35,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 06:15:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2025-02-08 06:15:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:15:35,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:35,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:35,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:15:35,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:35,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1410202398, now seen corresponding path program 1 times [2025-02-08 06:15:35,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:35,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607717686] [2025-02-08 06:15:35,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:35,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:35,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:15:35,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:15:35,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:35,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:35,406 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 06:15:35,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:35,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607717686] [2025-02-08 06:15:35,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607717686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:35,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:35,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:15:35,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460333834] [2025-02-08 06:15:35,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:35,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:15:35,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:35,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:15:35,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:15:35,409 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 06:15:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:35,444 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-02-08 06:15:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:15:35,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-02-08 06:15:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:35,449 INFO L225 Difference]: With dead ends: 59 [2025-02-08 06:15:35,449 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 06:15:35,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:15:35,450 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:35,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 128 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 06:15:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-08 06:15:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 58 states have internal predecessors, (64), 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 06:15:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-02-08 06:15:35,457 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 7 [2025-02-08 06:15:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:35,457 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-02-08 06:15:35,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 06:15:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-02-08 06:15:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:15:35,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:35,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:35,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:15:35,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:35,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2005190716, now seen corresponding path program 1 times [2025-02-08 06:15:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:35,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146803558] [2025-02-08 06:15:35,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:35,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:15:35,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:15:35,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:35,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:35,647 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 06:15:35,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:35,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146803558] [2025-02-08 06:15:35,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146803558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:35,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:35,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:15:35,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388709083] [2025-02-08 06:15:35,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:35,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:15:35,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:35,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:15:35,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:15:35,648 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:35,726 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-02-08 06:15:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:15:35,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:15:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:35,726 INFO L225 Difference]: With dead ends: 56 [2025-02-08 06:15:35,726 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 06:15:35,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:15:35,727 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 51 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:35,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 120 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:15:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 06:15:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 06:15:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-02-08 06:15:35,730 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2025-02-08 06:15:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:35,730 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-02-08 06:15:35,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-02-08 06:15:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:15:35,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:35,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:35,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:15:35,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:35,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2005190717, now seen corresponding path program 1 times [2025-02-08 06:15:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:35,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968399240] [2025-02-08 06:15:35,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:35,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:35,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:15:35,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:15:35,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:35,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:15:36,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968399240] [2025-02-08 06:15:36,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968399240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:36,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:15:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623833675] [2025-02-08 06:15:36,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:36,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:15:36,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:36,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:15:36,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:15:36,037 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:36,172 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-02-08 06:15:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:15:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:15:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:36,173 INFO L225 Difference]: With dead ends: 76 [2025-02-08 06:15:36,173 INFO L226 Difference]: Without dead ends: 76 [2025-02-08 06:15:36,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 06:15:36,174 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:36,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 156 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:15:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-08 06:15:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2025-02-08 06:15:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 66 states have internal predecessors, (79), 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 06:15:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-02-08 06:15:36,178 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 9 [2025-02-08 06:15:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:36,178 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-02-08 06:15:36,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-02-08 06:15:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:15:36,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:36,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:36,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:15:36,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:36,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2063449995, now seen corresponding path program 1 times [2025-02-08 06:15:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:36,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315886673] [2025-02-08 06:15:36,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:36,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:36,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:15:36,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:15:36,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:36,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:36,431 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 06:15:36,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:36,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315886673] [2025-02-08 06:15:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315886673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:36,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:36,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:15:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948593999] [2025-02-08 06:15:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:36,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:15:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:36,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:15:36,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:15:36,433 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:36,527 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2025-02-08 06:15:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:15:36,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 06:15:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:36,529 INFO L225 Difference]: With dead ends: 81 [2025-02-08 06:15:36,529 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 06:15:36,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:15:36,530 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 122 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:36,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 176 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:15:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 06:15:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2025-02-08 06:15:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 70 states have internal predecessors, (86), 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 06:15:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2025-02-08 06:15:36,537 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 12 [2025-02-08 06:15:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:36,537 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2025-02-08 06:15:36,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2025-02-08 06:15:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:15:36,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:36,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:36,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:15:36,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:36,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:36,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2063448235, now seen corresponding path program 1 times [2025-02-08 06:15:36,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:36,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390951577] [2025-02-08 06:15:36,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:36,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:36,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:15:36,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:15:36,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:36,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:36,619 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 06:15:36,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:36,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390951577] [2025-02-08 06:15:36,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390951577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:36,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:36,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:15:36,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149642554] [2025-02-08 06:15:36,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:36,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:15:36,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:36,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:15:36,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:15:36,621 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:36,675 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-02-08 06:15:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:15:36,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 06:15:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:36,676 INFO L225 Difference]: With dead ends: 68 [2025-02-08 06:15:36,676 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 06:15:36,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:15:36,677 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 59 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:36,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 91 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 06:15:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-08 06:15:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 67 states have internal predecessors, (80), 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 06:15:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2025-02-08 06:15:36,679 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 12 [2025-02-08 06:15:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:36,679 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2025-02-08 06:15:36,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2025-02-08 06:15:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:15:36,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:36,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:15:36,680 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:36,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2063448234, now seen corresponding path program 1 times [2025-02-08 06:15:36,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85239480] [2025-02-08 06:15:36,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:36,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:36,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:15:36,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:15:36,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:36,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:36,877 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 06:15:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:36,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85239480] [2025-02-08 06:15:36,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85239480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:36,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:36,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:15:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971088983] [2025-02-08 06:15:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:36,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:15:36,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:36,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:15:36,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:15:36,878 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:37,019 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2025-02-08 06:15:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:15:37,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 06:15:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:37,020 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:15:37,020 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:15:37,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:15:37,022 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 83 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:37,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 122 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:15:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:15:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-02-08 06:15:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 85 states have internal predecessors, (103), 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 06:15:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2025-02-08 06:15:37,030 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 12 [2025-02-08 06:15:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:37,030 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2025-02-08 06:15:37,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2025-02-08 06:15:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:15:37,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:37,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:37,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:15:37,031 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:37,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1299445129, now seen corresponding path program 1 times [2025-02-08 06:15:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:37,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109130282] [2025-02-08 06:15:37,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:37,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:37,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:15:37,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:15:37,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:37,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:37,094 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 06:15:37,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:37,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109130282] [2025-02-08 06:15:37,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109130282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:37,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:15:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848308476] [2025-02-08 06:15:37,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:37,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:15:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:37,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:15:37,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:37,095 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 06:15:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:37,149 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2025-02-08 06:15:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:15:37,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-02-08 06:15:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:37,150 INFO L225 Difference]: With dead ends: 85 [2025-02-08 06:15:37,150 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 06:15:37,150 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 06:15:37,151 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 40 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:37,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 42 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:15:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 06:15:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-08 06:15:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 84 states have internal predecessors, (102), 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 06:15:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2025-02-08 06:15:37,157 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 14 [2025-02-08 06:15:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:37,157 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2025-02-08 06:15:37,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 06:15:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2025-02-08 06:15:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:15:37,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:37,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:37,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:15:37,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:37,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1299445130, now seen corresponding path program 1 times [2025-02-08 06:15:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520878810] [2025-02-08 06:15:37,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:37,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:15:37,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:15:37,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:37,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:37,224 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 06:15:37,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:37,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520878810] [2025-02-08 06:15:37,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520878810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:37,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:37,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:15:37,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173544150] [2025-02-08 06:15:37,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:37,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:15:37,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:37,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:15:37,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:37,225 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 06:15:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:37,249 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2025-02-08 06:15:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:15:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-02-08 06:15:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:37,250 INFO L225 Difference]: With dead ends: 84 [2025-02-08 06:15:37,250 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 06:15:37,250 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 06:15:37,250 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:37,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 38 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 06:15:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-08 06:15:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.463768115942029) internal successors, (101), 83 states have internal predecessors, (101), 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 06:15:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2025-02-08 06:15:37,253 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 14 [2025-02-08 06:15:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:37,253 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2025-02-08 06:15:37,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 06:15:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2025-02-08 06:15:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:15:37,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:37,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:37,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:15:37,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:37,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1628093626, now seen corresponding path program 1 times [2025-02-08 06:15:37,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:37,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96715826] [2025-02-08 06:15:37,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:37,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:15:37,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:15:37,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:37,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:37,361 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 06:15:37,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:37,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96715826] [2025-02-08 06:15:37,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96715826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:37,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:37,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:15:37,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109989732] [2025-02-08 06:15:37,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:37,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:15:37,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:37,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:15:37,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:15:37,366 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:37,462 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2025-02-08 06:15:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:15:37,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 06:15:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:37,463 INFO L225 Difference]: With dead ends: 82 [2025-02-08 06:15:37,463 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 06:15:37,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 06:15:37,468 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 52 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:37,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 76 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:15:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 06:15:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-08 06:15:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.434782608695652) internal successors, (99), 81 states have internal predecessors, (99), 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 06:15:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2025-02-08 06:15:37,470 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 15 [2025-02-08 06:15:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:37,470 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2025-02-08 06:15:37,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2025-02-08 06:15:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:15:37,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:37,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:37,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:15:37,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:37,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1628093627, now seen corresponding path program 1 times [2025-02-08 06:15:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105952476] [2025-02-08 06:15:37,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:37,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:15:37,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:15:37,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:37,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:15:37,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:37,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105952476] [2025-02-08 06:15:37,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105952476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:37,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:37,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:15:37,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104984933] [2025-02-08 06:15:37,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:37,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:15:37,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:37,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:15:37,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:15:37,537 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:37,586 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2025-02-08 06:15:37,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:15:37,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 06:15:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:37,587 INFO L225 Difference]: With dead ends: 83 [2025-02-08 06:15:37,587 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 06:15:37,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:15:37,587 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:37,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 88 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 06:15:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-08 06:15:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.408450704225352) internal successors, (100), 82 states have internal predecessors, (100), 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 06:15:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2025-02-08 06:15:37,589 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 15 [2025-02-08 06:15:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:37,590 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2025-02-08 06:15:37,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:37,590 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2025-02-08 06:15:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:15:37,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:37,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:37,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:15:37,590 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:37,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1068715003, now seen corresponding path program 1 times [2025-02-08 06:15:37,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670955765] [2025-02-08 06:15:37,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:37,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:37,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:15:37,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:15:37,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:37,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:37,810 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 06:15:37,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:37,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670955765] [2025-02-08 06:15:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670955765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:37,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:37,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:15:37,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080931115] [2025-02-08 06:15:37,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:37,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:15:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:37,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:15:37,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:15:37,811 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:37,846 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2025-02-08 06:15:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:15:37,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-08 06:15:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:37,847 INFO L225 Difference]: With dead ends: 82 [2025-02-08 06:15:37,847 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 06:15:37,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:15:37,847 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 103 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:37,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 103 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 06:15:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-08 06:15:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.411764705882353) internal successors, (96), 78 states have internal predecessors, (96), 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 06:15:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2025-02-08 06:15:37,850 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 16 [2025-02-08 06:15:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:37,850 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2025-02-08 06:15:37,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2025-02-08 06:15:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:15:37,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:37,850 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:37,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:15:37,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:37,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash 131043787, now seen corresponding path program 1 times [2025-02-08 06:15:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:37,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843564438] [2025-02-08 06:15:37,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:37,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:37,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:15:37,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:15:37,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:37,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:15:37,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:37,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843564438] [2025-02-08 06:15:37,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843564438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:37,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:37,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:15:37,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490329685] [2025-02-08 06:15:37,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:37,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:15:37,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:37,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:15:37,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:37,872 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 06:15:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:37,879 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2025-02-08 06:15:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:15:37,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-02-08 06:15:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:37,879 INFO L225 Difference]: With dead ends: 83 [2025-02-08 06:15:37,880 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 06:15:37,880 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 06:15:37,880 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:37,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 06:15:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-08 06:15:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 82 states have internal predecessors, (100), 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 06:15:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2025-02-08 06:15:37,882 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 17 [2025-02-08 06:15:37,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:37,882 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2025-02-08 06:15:37,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 06:15:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2025-02-08 06:15:37,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:15:37,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:37,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:37,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:15:37,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:37,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:37,883 INFO L85 PathProgramCache]: Analyzing trace with hash -528450802, now seen corresponding path program 1 times [2025-02-08 06:15:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:37,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949419597] [2025-02-08 06:15:37,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:37,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:37,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:15:37,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:15:37,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:37,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:37,959 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 06:15:37,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949419597] [2025-02-08 06:15:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949419597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:37,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:37,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:15:37,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117969740] [2025-02-08 06:15:37,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:37,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:15:37,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:37,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:15:37,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:15:37,961 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 06:15:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:37,986 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2025-02-08 06:15:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:15:37,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2025-02-08 06:15:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:37,987 INFO L225 Difference]: With dead ends: 81 [2025-02-08 06:15:37,987 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 06:15:37,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:15:37,988 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:37,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 63 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 06:15:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 06:15:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 80 states have internal predecessors, (98), 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 06:15:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2025-02-08 06:15:37,989 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 18 [2025-02-08 06:15:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:37,989 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2025-02-08 06:15:37,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 06:15:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2025-02-08 06:15:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:15:37,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:37,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:37,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:15:37,990 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:37,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash -528450801, now seen corresponding path program 1 times [2025-02-08 06:15:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:37,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573319056] [2025-02-08 06:15:37,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:37,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:15:38,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:15:38,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:38,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:38,143 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 06:15:38,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573319056] [2025-02-08 06:15:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573319056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:38,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:38,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:15:38,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464993883] [2025-02-08 06:15:38,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:38,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:15:38,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:38,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:15:38,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:15:38,144 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 06:15:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:38,209 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2025-02-08 06:15:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:15:38,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-02-08 06:15:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:38,210 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:15:38,210 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:15:38,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:15:38,210 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:38,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 97 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:15:38,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:15:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2025-02-08 06:15:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 85 states have internal predecessors, (104), 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 06:15:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2025-02-08 06:15:38,213 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 18 [2025-02-08 06:15:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:38,213 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2025-02-08 06:15:38,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 06:15:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2025-02-08 06:15:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:15:38,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:38,214 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:38,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:15:38,214 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:38,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1377491913, now seen corresponding path program 1 times [2025-02-08 06:15:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:38,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261019067] [2025-02-08 06:15:38,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:38,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:38,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:15:38,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:15:38,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:38,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:15:38,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261019067] [2025-02-08 06:15:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261019067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:38,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:38,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:15:38,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926292926] [2025-02-08 06:15:38,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:38,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:15:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:38,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:15:38,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:15:38,268 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:38,303 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2025-02-08 06:15:38,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:15:38,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 06:15:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:38,305 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:15:38,305 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:15:38,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:15:38,305 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:38,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:15:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 06:15:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 91 states have internal predecessors, (112), 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 06:15:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2025-02-08 06:15:38,308 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 19 [2025-02-08 06:15:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:38,308 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2025-02-08 06:15:38,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:15:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2025-02-08 06:15:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:15:38,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:38,308 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:38,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:15:38,309 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-08 06:15:38,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash -955548211, now seen corresponding path program 1 times [2025-02-08 06:15:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:38,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942230304] [2025-02-08 06:15:38,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:38,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:15:38,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:15:38,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:38,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 06:15:38,325 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 06:15:38,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:15:38,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:15:38,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:38,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 06:15:38,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 06:15:38,365 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 06:15:38,366 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2025-02-08 06:15:38,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (29 of 31 remaining) [2025-02-08 06:15:38,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2025-02-08 06:15:38,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2025-02-08 06:15:38,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2025-02-08 06:15:38,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2025-02-08 06:15:38,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2025-02-08 06:15:38,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2025-02-08 06:15:38,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2025-02-08 06:15:38,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2025-02-08 06:15:38,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2025-02-08 06:15:38,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2025-02-08 06:15:38,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2025-02-08 06:15:38,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2025-02-08 06:15:38,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2025-02-08 06:15:38,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2025-02-08 06:15:38,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2025-02-08 06:15:38,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:15:38,374 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:38,412 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:15:38,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:15:38 BoogieIcfgContainer [2025-02-08 06:15:38,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:15:38,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:15:38,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:15:38,418 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:15:38,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:15:34" (3/4) ... [2025-02-08 06:15:38,420 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 06:15:38,448 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-02-08 06:15:38,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:15:38,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:15:38,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:15:38,479 INFO L158 Benchmark]: Toolchain (without parser) took 4673.50ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 133.3MB in the beginning and 96.9MB in the end (delta: 36.4MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2025-02-08 06:15:38,479 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:15:38,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.96ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 116.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:15:38,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.70ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 114.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:15:38,479 INFO L158 Benchmark]: Boogie Preprocessor took 25.36ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 111.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:15:38,480 INFO L158 Benchmark]: IcfgBuilder took 408.06ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 89.0MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 06:15:38,480 INFO L158 Benchmark]: TraceAbstraction took 3857.92ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 88.6MB in the beginning and 102.4MB in the end (delta: -13.8MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2025-02-08 06:15:38,480 INFO L158 Benchmark]: Witness Printer took 60.65ms. Allocated memory is still 226.5MB. Free memory was 102.4MB in the beginning and 96.9MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:15:38,481 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.96ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 116.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.70ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 114.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.36ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 111.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 408.06ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 89.0MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3857.92ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 88.6MB in the beginning and 102.4MB in the end (delta: -13.8MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * Witness Printer took 60.65ms. Allocated memory is still 226.5MB. Free memory was 102.4MB in the beginning and 96.9MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L543] int in_len = __VERIFIER_nondet_int(); [L544] COND FALSE !(in_len < 1) [L545] char* in = __builtin_alloca (in_len); VAL [in={3:0}, in_len=8] [L546] in[in_len-1]=0 [L547] int delim_len = __VERIFIER_nondet_int(); [L548] COND FALSE !(delim_len < 1) [L549] char* delim = __builtin_alloca (delim_len); [L550] char* ptr = 0; [L550] char* ptr = 0; [L551] CALL strtok_r(in, delim, &ptr) [L531] char*tmp=0; VAL [delim={4:0}, ptrptr={2:0}, s={3:0}, tmp={0:0}] [L532] COND FALSE !(s==0) [L533] CALL strspn(s,delim) [L508] size_t l = 0; [L509] const char *a; VAL [accept={4:0}, l=0, s={3:0}] [L510] COND TRUE *s [L510] EXPR \read(*s) [L510] COND TRUE *s [L511] a = accept VAL [a={4:0}, accept={4:0}, l=0, s={3:0}] [L511] COND TRUE *a && *s != *a [L511] EXPR \read(*a) [L511] *a && *s != *a VAL [a={4:0}, accept={4:0}, l=0, s={3:0}] [L511] *a && *s != *a [L511] EXPR \read(*s) [L511] EXPR \read(*a) [L511] *a && *s != *a VAL [a={4:0}, accept={4:0}, l=0, s={3:0}] [L511] COND TRUE *a && *s != *a [L511] a++ VAL [a={4:1}, accept={4:0}, l=0, s={3:0}] [L511] COND TRUE *a && *s != *a [L511] \read(*a) - UnprovableResult [Line: 542]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 69 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 670 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 670 mSDsluCounter, 2103 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1229 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1163 IncrementalHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 874 mSDtfsCounter, 1163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=19, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 1169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 06:15:38,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)