./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0218.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0218.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:22:32,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:22:32,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:22:32,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:22:32,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:22:32,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:22:32,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:22:32,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:22:32,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:22:32,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:22:32,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:22:32,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:22:32,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:22:32,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:22:32,777 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:22:32,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:22:32,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:22:32,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:22:32,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:22:32,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:22:32,778 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:22:32,778 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:22:32,778 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:22:32,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:22:32,778 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:22:32,779 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:22:32,779 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:22:32,779 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:22:32,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:22:32,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:22:32,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:22:32,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:22:32,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:22:32,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:22:32,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:22:32,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:22:32,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:22:32,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:22:32,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:22:32,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:22:32,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:22:32,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:22:32,780 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2025-02-08 06:22:32,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:22:33,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:22:33,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:22:33,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:22:33,004 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:22:33,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0218.i [2025-02-08 06:22:34,096 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55dbca277/c2276944c756490d8947bc06d173c1f8/FLAGdad976758 [2025-02-08 06:22:34,419 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:22:34,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2025-02-08 06:22:34,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55dbca277/c2276944c756490d8947bc06d173c1f8/FLAGdad976758 [2025-02-08 06:22:34,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55dbca277/c2276944c756490d8947bc06d173c1f8 [2025-02-08 06:22:34,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:22:34,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:22:34,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:22:34,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:22:34,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:22:34,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@611dfea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34, skipping insertion in model container [2025-02-08 06:22:34,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:22:34,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:22:34,724 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:22:34,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:22:34,844 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:22:34,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34 WrapperNode [2025-02-08 06:22:34,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:22:34,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:22:34,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:22:34,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:22:34,851 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:22:34" (1/1) ... [2025-02-08 06:22:34,867 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:22:34" (1/1) ... [2025-02-08 06:22:34,900 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2025-02-08 06:22:34,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:22:34,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:22:34,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:22:34,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:22:34,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,948 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2025-02-08 06:22:34,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:22:34,974 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:22:34,974 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:22:34,974 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:22:34,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (1/1) ... [2025-02-08 06:22:34,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:22:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:35,001 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:22:35,004 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:22:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2025-02-08 06:22:35,022 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:22:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:22:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:22:35,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:22:35,128 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:22:35,129 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:22:35,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: assume 0 != remove_one_#t~ret20#1;havoc remove_one_#t~ret20#1; [2025-02-08 06:22:35,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; [2025-02-08 06:22:35,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L698-1: remove_one_#t~ret20#1 := is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;havoc is_empty_#in~list#1.base, is_empty_#in~list#1.offset;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; [2025-02-08 06:22:35,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset := create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset;havoc create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; [2025-02-08 06:22:35,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: remove_one_~item~2#1.base, remove_one_~item~2#1.offset := remove_one_#t~mem25#1.base, remove_one_#t~mem25#1.offset;havoc remove_one_#t~mem25#1.base, remove_one_#t~mem25#1.offset; [2025-02-08 06:22:35,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call remove_one_#t~mem25#1.base, remove_one_#t~mem25#1.offset := read~$Pointer$#1(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * remove_one_~from#1, 4); srcloc: null [2025-02-08 06:22:35,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: assume !(1 == #valid[remove_one_~list#1.base]); [2025-02-08 06:22:35,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: assume !(4 + (remove_one_~list#1.offset + 4 * remove_one_~from#1) <= #length[remove_one_~list#1.base] && 0 <= remove_one_~list#1.offset + 4 * remove_one_~from#1); [2025-02-08 06:22:35,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: assume 0 == append_one_#t~mem18#1.base && 0 == append_one_#t~mem18#1.offset;havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; [2025-02-08 06:22:35,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: assume !(0 == append_one_#t~mem18#1.base && 0 == append_one_#t~mem18#1.offset);havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; [2025-02-08 06:22:35,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$#1(append_one_~item~1#1.base, append_one_~item~1#1.offset, 4); srcloc: null [2025-02-08 06:22:35,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: assume !(1 == #valid[append_one_~item~1#1.base]); [2025-02-08 06:22:35,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: assume !(4 + append_one_~item~1#1.offset <= #length[append_one_~item~1#1.base] && 0 <= append_one_~item~1#1.offset); [2025-02-08 06:22:35,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708: remove_one_~next~0#1.base, remove_one_~next~0#1.offset := remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset;havoc remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset; [2025-02-08 06:22:35,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: SUMMARY for call remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset := read~$Pointer$#1(remove_one_~item~2#1.base, remove_one_~item~2#1.offset + 4 * remove_one_~next_field~0#1, 4); srcloc: null [2025-02-08 06:22:35,450 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: assume !(1 == #valid[remove_one_~item~2#1.base]); [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: assume !(4 + (remove_one_~item~2#1.offset + 4 * remove_one_~next_field~0#1) <= #length[remove_one_~item~2#1.base] && 0 <= remove_one_~item~2#1.offset + 4 * remove_one_~next_field~0#1); [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: assume remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: assume !(remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;remove_one_~next_field~0#1 := (if 0 == remove_one_~from#1 then 1 else 0);remove_one_~term_field~1#1 := (if 1 == remove_one_~from#1 then 1 else 0); [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$#1(remove_one_~list#1.base, 4 + remove_one_~list#1.offset, 4); srcloc: null [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: assume !(1 == #valid[remove_one_~list#1.base]); [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: assume !(4 + (4 + remove_one_~list#1.offset) <= #length[remove_one_~list#1.base] && 0 <= 4 + remove_one_~list#1.offset); [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-2: SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$#1(remove_one_~list#1.base, remove_one_~list#1.offset, 4); srcloc: null [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-2: assume !(1 == #valid[remove_one_~list#1.base]); [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-2: assume !(4 + remove_one_~list#1.offset <= #length[remove_one_~list#1.base] && 0 <= remove_one_~list#1.offset); [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;havoc append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1;assume { :end_inline_append_one } true; [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692: SUMMARY for call write~$Pointer$#1(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset, 4); srcloc: null [2025-02-08 06:22:35,451 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692: assume !(1 == #valid[append_one_~list#1.base]); [2025-02-08 06:22:35,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692: assume !(4 + append_one_~list#1.offset <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset); [2025-02-08 06:22:35,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: SUMMARY for call write~$Pointer$#1(0, 0, remove_one_~next~0#1.base, remove_one_~next~0#1.offset + 4 * remove_one_~term_field~1#1, 4); srcloc: null [2025-02-08 06:22:35,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: assume !(1 == #valid[remove_one_~next~0#1.base]); [2025-02-08 06:22:35,452 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: assume !(4 + (remove_one_~next~0#1.offset + 4 * remove_one_~term_field~1#1) <= #length[remove_one_~next~0#1.base] && 0 <= remove_one_~next~0#1.offset + 4 * remove_one_~term_field~1#1); [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume #Ultimate.C_memset_#t~loopctr37#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int#1 := #memory_int#1[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr37#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$#1.base, #memory_$Pointer$#1.offset := #memory_$Pointer$#1.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr37#1 := 0], #memory_$Pointer$#1.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr37#1 := (if #Ultimate.C_memset_#value#1 % 256 % 4294967296 <= 2147483647 then #Ultimate.C_memset_#value#1 % 256 % 4294967296 else #Ultimate.C_memset_#value#1 % 256 % 4294967296 - 4294967296)];#Ultimate.C_memset_#t~loopctr37#1 := 1 + #Ultimate.C_memset_#t~loopctr37#1; [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume !(#Ultimate.C_memset_#t~loopctr37#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296);assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr37#1;havoc #Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset; [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr37#1;#Ultimate.C_memset_#t~loopctr37#1 := 0; [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume !(#Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset); [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-2: assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-2: assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: assume 0 == remove_one_#t~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base];call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: assume !(0 == remove_one_#t~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base]); [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: assume remove_one_#t~mem23#1.base < #StackHeapBarrier; [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: assume !(remove_one_#t~mem23#1.base < #StackHeapBarrier); [2025-02-08 06:22:35,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-2: assume 0 == remove_one_#t~mem23#1.offset; [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-2: assume !(0 == remove_one_#t~mem23#1.offset); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-3: SUMMARY for call remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$#1(remove_one_~list#1.base, remove_one_~list#1.offset, 4); srcloc: null [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-3: assume !(1 == #valid[remove_one_~list#1.base]); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-3: assume !(4 + remove_one_~list#1.offset <= #length[remove_one_~list#1.base] && 0 <= remove_one_~list#1.offset); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L693: assume 0 == append_one_#t~mem19#1.base && 0 == append_one_#t~mem19#1.offset;havoc append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset; [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L693: assume !(0 == append_one_#t~mem19#1.base && 0 == append_one_#t~mem19#1.offset);havoc append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset; [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L693-1: SUMMARY for call append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset := read~$Pointer$#1(append_one_~list#1.base, 4 + append_one_~list#1.offset, 4); srcloc: null [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L693-1: assume !(1 == #valid[append_one_~list#1.base]); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L693-1: assume !(4 + (4 + append_one_~list#1.offset) <= #length[append_one_~list#1.base] && 0 <= 4 + append_one_~list#1.offset); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: SUMMARY for call write~$Pointer$#1(remove_one_~next~0#1.base, remove_one_~next~0#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset + 4 * remove_one_~from#1, 4); srcloc: null [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume !(1 == #valid[remove_one_~list#1.base]); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume !(4 + (remove_one_~list#1.offset + 4 * remove_one_~from#1) <= #length[remove_one_~list#1.base] && 0 <= remove_one_~list#1.offset + 4 * remove_one_~from#1); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L694: SUMMARY for call write~$Pointer$#1(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, 4 + append_one_~list#1.offset, 4); srcloc: null [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L694: assume !(1 == #valid[append_one_~list#1.base]); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L694: assume !(4 + (4 + append_one_~list#1.offset) <= #length[append_one_~list#1.base] && 0 <= 4 + append_one_~list#1.offset); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: assume 0 == remove_one_~item~2#1.base || 1 == #valid[remove_one_~item~2#1.base];call ULTIMATE.dealloc(remove_one_~item~2#1.base, remove_one_~item~2#1.offset);havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~mem25#1.base, remove_one_#t~mem25#1.offset, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;havoc remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1;assume { :end_inline_remove_one } true; [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: assume !(0 == remove_one_~item~2#1.base || 1 == #valid[remove_one_~item~2#1.base]); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-1: assume remove_one_~item~2#1.base < #StackHeapBarrier; [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-1: assume !(remove_one_~item~2#1.base < #StackHeapBarrier); [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-2: assume 0 == remove_one_~item~2#1.offset; [2025-02-08 06:22:35,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-2: assume !(0 == remove_one_~item~2#1.offset); [2025-02-08 06:22:35,479 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-02-08 06:22:35,479 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:22:35,488 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:22:35,488 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:22:35,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:22:35 BoogieIcfgContainer [2025-02-08 06:22:35,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:22:35,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:22:35,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:22:35,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:22:35,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:22:34" (1/3) ... [2025-02-08 06:22:35,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa3a31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:22:35, skipping insertion in model container [2025-02-08 06:22:35,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:34" (2/3) ... [2025-02-08 06:22:35,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa3a31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:22:35, skipping insertion in model container [2025-02-08 06:22:35,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:22:35" (3/3) ... [2025-02-08 06:22:35,495 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0218.i [2025-02-08 06:22:35,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:22:35,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0218.i that has 2 procedures, 103 locations, 1 initial locations, 6 loop locations, and 65 error locations. [2025-02-08 06:22:35,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:22:35,545 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;@7d55007c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:22:35,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-02-08 06:22:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 99 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:22:35,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:35,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:22:35,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:35,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash 210705718, now seen corresponding path program 1 times [2025-02-08 06:22:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:35,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314069390] [2025-02-08 06:22:35,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:35,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:22:35,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:22:35,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:35,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:35,661 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:22:35,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:35,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314069390] [2025-02-08 06:22:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314069390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:35,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847153449] [2025-02-08 06:22:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:35,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 06:22:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:35,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 06:22:35,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 06:22:35,681 INFO L87 Difference]: Start difference. First operand has 103 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 99 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:35,692 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2025-02-08 06:22:35,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 06:22:35,693 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:22:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:35,697 INFO L225 Difference]: With dead ends: 103 [2025-02-08 06:22:35,697 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 06:22:35,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 06:22:35,700 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:35,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 06:22:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 06:22:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2025-02-08 06:22:35,726 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 5 [2025-02-08 06:22:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:35,726 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2025-02-08 06:22:35,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2025-02-08 06:22:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:22:35,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:35,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:22:35,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:22:35,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:35,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:35,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2054093127, now seen corresponding path program 1 times [2025-02-08 06:22:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:35,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921216962] [2025-02-08 06:22:35,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:35,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:35,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:22:35,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:22:35,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:35,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:35,800 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:22:35,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:35,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921216962] [2025-02-08 06:22:35,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921216962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:35,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:35,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:22:35,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537912432] [2025-02-08 06:22:35,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:35,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:22:35,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:35,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:22:35,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:22:35,803 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:22:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:35,854 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2025-02-08 06:22:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:22:35,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:22:35,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:35,855 INFO L225 Difference]: With dead ends: 108 [2025-02-08 06:22:35,856 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 06:22:35,856 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:22:35,856 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 97 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:35,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 79 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 06:22:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2025-02-08 06:22:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.7241379310344827) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2025-02-08 06:22:35,862 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 6 [2025-02-08 06:22:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:35,862 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2025-02-08 06:22:35,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:22:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2025-02-08 06:22:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:22:35,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:35,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:22:35,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:22:35,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:35,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2054093126, now seen corresponding path program 1 times [2025-02-08 06:22:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:35,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518553376] [2025-02-08 06:22:35,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:35,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:35,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:22:35,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:22:35,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:35,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:35,963 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:22:35,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:35,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518553376] [2025-02-08 06:22:35,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518553376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:35,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:35,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:35,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058668161] [2025-02-08 06:22:35,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:35,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:35,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:35,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:35,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:35,965 INFO L87 Difference]: Start difference. First operand 95 states and 104 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:22:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:36,028 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2025-02-08 06:22:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:22:36,029 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:22:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:36,029 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:22:36,029 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 06:22:36,030 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:22:36,030 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 99 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:36,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 142 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 06:22:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 06:22:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2025-02-08 06:22:36,035 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 6 [2025-02-08 06:22:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:36,035 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2025-02-08 06:22:36,035 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:22:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2025-02-08 06:22:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:22:36,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:36,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:22:36,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:22:36,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:36,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:36,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2054093095, now seen corresponding path program 1 times [2025-02-08 06:22:36,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:36,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206158487] [2025-02-08 06:22:36,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:36,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:36,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:22:36,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:22:36,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:36,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:36,108 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:22:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:36,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206158487] [2025-02-08 06:22:36,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206158487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:36,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:36,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:36,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685323952] [2025-02-08 06:22:36,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:36,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:36,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:36,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:36,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:36,109 INFO L87 Difference]: Start difference. First operand 96 states and 105 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:22:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:36,163 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2025-02-08 06:22:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:22:36,164 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:22:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:36,166 INFO L225 Difference]: With dead ends: 95 [2025-02-08 06:22:36,166 INFO L226 Difference]: Without dead ends: 95 [2025-02-08 06:22:36,166 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:22:36,168 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 97 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:36,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 142 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-08 06:22:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-02-08 06:22:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 58 states have (on average 1.706896551724138) internal successors, (99), 90 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2025-02-08 06:22:36,175 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 6 [2025-02-08 06:22:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:36,175 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2025-02-08 06:22:36,176 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:22:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2025-02-08 06:22:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:22:36,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:36,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:36,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:22:36,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:36,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1205675001, now seen corresponding path program 1 times [2025-02-08 06:22:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364734245] [2025-02-08 06:22:36,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:36,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:22:36,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:22:36,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:36,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:36,338 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:22:36,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:36,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364734245] [2025-02-08 06:22:36,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364734245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:36,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:36,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:22:36,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437752573] [2025-02-08 06:22:36,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:36,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:36,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:36,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:36,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:36,342 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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:22:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:36,470 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2025-02-08 06:22:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:36,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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:22:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:36,471 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:22:36,472 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:22:36,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:36,472 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 83 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:36,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 334 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:22:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 06:22:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2025-02-08 06:22:36,480 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 9 [2025-02-08 06:22:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:36,480 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2025-02-08 06:22:36,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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:22:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2025-02-08 06:22:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:22:36,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:36,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:36,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:22:36,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:36,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:36,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1205674649, now seen corresponding path program 1 times [2025-02-08 06:22:36,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:36,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646164436] [2025-02-08 06:22:36,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:36,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:36,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:22:36,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:22:36,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:36,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:36,515 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:22:36,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:36,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646164436] [2025-02-08 06:22:36,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646164436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:36,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:36,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:22:36,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246444415] [2025-02-08 06:22:36,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:36,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:22:36,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:36,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:22:36,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:22:36,517 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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:22:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:36,552 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2025-02-08 06:22:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:22:36,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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:22:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:36,553 INFO L225 Difference]: With dead ends: 109 [2025-02-08 06:22:36,553 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 06:22:36,553 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:22:36,554 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 33 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:36,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 136 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:36,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 06:22:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2025-02-08 06:22:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 91 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2025-02-08 06:22:36,558 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 9 [2025-02-08 06:22:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:36,558 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2025-02-08 06:22:36,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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:22:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2025-02-08 06:22:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:22:36,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:36,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:36,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:22:36,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:36,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1206598522, now seen corresponding path program 1 times [2025-02-08 06:22:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:36,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559869536] [2025-02-08 06:22:36,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:36,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:22:36,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:22:36,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:36,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:36,633 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:22:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559869536] [2025-02-08 06:22:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559869536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:36,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:36,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:22:36,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597184336] [2025-02-08 06:22:36,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:36,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:36,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:36,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:36,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:36,635 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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:22:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:36,693 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2025-02-08 06:22:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:36,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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:22:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:36,694 INFO L225 Difference]: With dead ends: 82 [2025-02-08 06:22:36,694 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 06:22:36,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:36,694 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 66 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:36,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 296 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 06:22:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-08 06:22:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.702127659574468) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-02-08 06:22:36,698 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 9 [2025-02-08 06:22:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:36,698 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-02-08 06:22:36,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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:22:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-02-08 06:22:36,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:22:36,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:36,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:36,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:22:36,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:36,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1633763747, now seen corresponding path program 1 times [2025-02-08 06:22:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:36,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209222676] [2025-02-08 06:22:36,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:36,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:22:36,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:22:36,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:36,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:36,750 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:22:36,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:36,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209222676] [2025-02-08 06:22:36,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209222676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:36,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:36,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:22:36,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9546662] [2025-02-08 06:22:36,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:36,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:36,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:36,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:36,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:36,752 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:36,799 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2025-02-08 06:22:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:22:36,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-08 06:22:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:36,800 INFO L225 Difference]: With dead ends: 74 [2025-02-08 06:22:36,800 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 06:22:36,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:22:36,801 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 80 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:36,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 98 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 06:22:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-08 06:22:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2025-02-08 06:22:36,803 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 14 [2025-02-08 06:22:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:36,804 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2025-02-08 06:22:36,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2025-02-08 06:22:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:22:36,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:36,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:36,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:22:36,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:36,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1633763748, now seen corresponding path program 1 times [2025-02-08 06:22:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:36,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996709155] [2025-02-08 06:22:36,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:36,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:22:36,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:22:36,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:36,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:36,860 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:22:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:36,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996709155] [2025-02-08 06:22:36,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996709155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:36,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:36,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:22:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542128414] [2025-02-08 06:22:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:36,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:36,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:36,862 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:36,924 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2025-02-08 06:22:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:22:36,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-08 06:22:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:36,925 INFO L225 Difference]: With dead ends: 70 [2025-02-08 06:22:36,925 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 06:22:36,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:22:36,926 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 73 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:36,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 97 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 06:22:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-08 06:22:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 66 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:22:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2025-02-08 06:22:36,929 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 14 [2025-02-08 06:22:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:36,929 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2025-02-08 06:22:36,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2025-02-08 06:22:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:22:36,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:36,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:36,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:22:36,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:36,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash -946607292, now seen corresponding path program 1 times [2025-02-08 06:22:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948701921] [2025-02-08 06:22:36,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:36,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:22:36,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:22:36,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:36,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:36,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:36,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948701921] [2025-02-08 06:22:36,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948701921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:36,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:36,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:22:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721376303] [2025-02-08 06:22:36,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:36,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:36,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:36,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:36,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:36,977 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:36,993 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2025-02-08 06:22:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-08 06:22:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:36,994 INFO L225 Difference]: With dead ends: 76 [2025-02-08 06:22:36,994 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 06:22:36,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:22:36,995 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:36,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 369 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 06:22:36,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-08 06:22:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.574468085106383) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:22:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-02-08 06:22:36,998 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2025-02-08 06:22:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:36,998 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-02-08 06:22:36,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-02-08 06:22:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:22:36,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:36,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:36,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:22:36,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:36,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1143120797, now seen corresponding path program 1 times [2025-02-08 06:22:36,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:36,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672918729] [2025-02-08 06:22:36,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:36,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:37,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:22:37,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:22:37,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:37,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:37,050 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:22:37,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:37,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672918729] [2025-02-08 06:22:37,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672918729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:37,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:37,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:22:37,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346803145] [2025-02-08 06:22:37,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:37,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:37,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:37,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:37,052 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:37,061 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-02-08 06:22:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:37,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-08 06:22:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:37,062 INFO L225 Difference]: With dead ends: 29 [2025-02-08 06:22:37,062 INFO L226 Difference]: Without dead ends: 23 [2025-02-08 06:22:37,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:37,062 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:37,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-08 06:22:37,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-02-08 06:22:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-02-08 06:22:37,064 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2025-02-08 06:22:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:37,064 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-02-08 06:22:37,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-02-08 06:22:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:22:37,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:37,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:37,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:22:37,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-08 06:22:37,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1608443396, now seen corresponding path program 1 times [2025-02-08 06:22:37,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:37,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457310660] [2025-02-08 06:22:37,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:37,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:37,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:37,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:37,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:37,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:37,275 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:22:37,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:37,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457310660] [2025-02-08 06:22:37,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457310660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:37,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:37,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:22:37,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688933892] [2025-02-08 06:22:37,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:37,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:22:37,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:37,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:22:37,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:37,277 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:37,423 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-02-08 06:22:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:22:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-02-08 06:22:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:37,423 INFO L225 Difference]: With dead ends: 18 [2025-02-08 06:22:37,423 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:22:37,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:22:37,424 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:37,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 75 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:22:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:22:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:22:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:22:37,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2025-02-08 06:22:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:37,425 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:22:37,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:22:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:22:37,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:22:37,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (64 of 65 remaining) [2025-02-08 06:22:37,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (63 of 65 remaining) [2025-02-08 06:22:37,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (62 of 65 remaining) [2025-02-08 06:22:37,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (61 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (56 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (55 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (54 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2025-02-08 06:22:37,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2025-02-08 06:22:37,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 65 remaining) [2025-02-08 06:22:37,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2025-02-08 06:22:37,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2025-02-08 06:22:37,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2025-02-08 06:22:37,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2025-02-08 06:22:37,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2025-02-08 06:22:37,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (43 of 65 remaining) [2025-02-08 06:22:37,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (42 of 65 remaining) [2025-02-08 06:22:37,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (41 of 65 remaining) [2025-02-08 06:22:37,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2025-02-08 06:22:37,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2025-02-08 06:22:37,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2025-02-08 06:22:37,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2025-02-08 06:22:37,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 65 remaining) [2025-02-08 06:22:37,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 65 remaining) [2025-02-08 06:22:37,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (34 of 65 remaining) [2025-02-08 06:22:37,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (33 of 65 remaining) [2025-02-08 06:22:37,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (32 of 65 remaining) [2025-02-08 06:22:37,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 65 remaining) [2025-02-08 06:22:37,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 65 remaining) [2025-02-08 06:22:37,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 65 remaining) [2025-02-08 06:22:37,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 65 remaining) [2025-02-08 06:22:37,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2025-02-08 06:22:37,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2025-02-08 06:22:37,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 65 remaining) [2025-02-08 06:22:37,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 65 remaining) [2025-02-08 06:22:37,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 65 remaining) [2025-02-08 06:22:37,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 65 remaining) [2025-02-08 06:22:37,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:22:37,437 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:37,439 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:22:37,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:22:37 BoogieIcfgContainer [2025-02-08 06:22:37,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:22:37,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:22:37,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:22:37,445 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:22:37,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:22:35" (3/4) ... [2025-02-08 06:22:37,446 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:22:37,450 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rand_end_point [2025-02-08 06:22:37,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 06:22:37,456 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-08 06:22:37,456 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 06:22:37,456 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:22:37,527 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:22:37,527 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:22:37,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:22:37,528 INFO L158 Benchmark]: Toolchain (without parser) took 3066.67ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.8MB in the beginning and 228.6MB in the end (delta: -122.8MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2025-02-08 06:22:37,528 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:22:37,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.35ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 83.4MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 06:22:37,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.53ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 81.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:22:37,528 INFO L158 Benchmark]: Boogie Preprocessor took 71.57ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 78.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:22:37,528 INFO L158 Benchmark]: IcfgBuilder took 514.54ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 46.8MB in the end (delta: 31.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 06:22:37,529 INFO L158 Benchmark]: TraceAbstraction took 1953.23ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 45.7MB in the beginning and 235.9MB in the end (delta: -190.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:22:37,529 INFO L158 Benchmark]: Witness Printer took 82.70ms. Allocated memory is still 302.0MB. Free memory was 235.9MB in the beginning and 228.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:22:37,532 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.35ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 83.4MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.53ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 81.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.57ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 78.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 514.54ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 46.8MB in the end (delta: 31.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1953.23ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 45.7MB in the beginning and 235.9MB in the end (delta: -190.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 82.70ms. Allocated memory is still 302.0MB. Free memory was 235.9MB in the beginning and 228.6MB in the end (delta: 7.3MB). 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 - PositiveResult [Line: 720]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 742]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 742]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 742]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 711]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 711]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 711]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 658]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 658]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 648 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 2016 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1199 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 503 IncrementalHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 817 mSDtfsCounter, 503 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, InterpolantAutomatonStates: 56, 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, 12 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 1011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 65 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:22:37,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE