./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test24-1.c --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/ldv-regression/test24-1.c -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 61e163c7079e2ec105ad677de51f27ac7eccc49ef492909c4fa51ebc02ead9b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:20:05,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:20:05,476 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:20:05,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:20:05,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:20:05,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:20:05,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:20:05,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:20:05,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:20:05,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:20:05,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:20:05,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:20:05,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:20:05,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:20:05,494 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:20:05,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:20:05,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:20:05,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:20:05,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:20:05,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:20:05,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:20:05,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:20:05,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:20:05,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:20:05,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:20:05,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:20:05,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:20:05,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:20:05,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:20:05,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:20:05,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:20:05,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:20:05,496 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 -> 61e163c7079e2ec105ad677de51f27ac7eccc49ef492909c4fa51ebc02ead9b7 [2025-02-08 06:20:05,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:20:05,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:20:05,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:20:05,682 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:20:05,682 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:20:05,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test24-1.c [2025-02-08 06:20:06,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e69509e6/028e6998b2774480a76d83d8962179c7/FLAG9a72f55ba [2025-02-08 06:20:07,012 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:20:07,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test24-1.c [2025-02-08 06:20:07,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e69509e6/028e6998b2774480a76d83d8962179c7/FLAG9a72f55ba [2025-02-08 06:20:07,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e69509e6/028e6998b2774480a76d83d8962179c7 [2025-02-08 06:20:07,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:20:07,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:20:07,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:20:07,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:20:07,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:20:07,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07, skipping insertion in model container [2025-02-08 06:20:07,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:20:07,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:20:07,466 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:20:07,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:20:07,487 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:20:07,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07 WrapperNode [2025-02-08 06:20:07,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:20:07,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:20:07,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:20:07,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:20:07,492 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:20:07" (1/1) ... [2025-02-08 06:20:07,500 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:20:07" (1/1) ... [2025-02-08 06:20:07,508 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2025-02-08 06:20:07,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:20:07,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:20:07,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:20:07,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:20:07,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,527 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 06:20:07,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:20:07,540 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:20:07,540 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:20:07,540 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:20:07,541 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (1/1) ... [2025-02-08 06:20:07,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:20:07,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:20:07,578 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:20:07,587 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:20:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:20:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:20:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:20:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:20:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:20:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:20:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:20:07,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:20:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:20:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:20:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:20:07,653 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:20:07,654 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:20:07,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; [2025-02-08 06:20:07,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: assume !(0 == main_#t~ret9#1);havoc main_#t~ret9#1; [2025-02-08 06:20:07,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc check_#t~mem4#1;main_#t~ret9#1 := check_#res#1;havoc check_#t~mem4#1, check_~ad1#1.base, check_~ad1#1.offset, check_~b#1;havoc check_#in~ad1#1.base, check_#in~ad1#1.offset, check_#in~b#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; [2025-02-08 06:20:07,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: assume { :begin_inline_reach_error } true; [2025-02-08 06:20:07,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3: assume false;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1;call ULTIMATE.dealloc(main_~#ad1~0#1.base, main_~#ad1~0#1.offset);havoc main_~#ad1~0#1.base, main_~#ad1~0#1.offset; [2025-02-08 06:20:07,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3: assume !false; [2025-02-08 06:20:07,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#ad1~0#1.base, main_~#ad1~0#1.offset);havoc main_~#ad1~0#1.base, main_~#ad1~0#1.offset; [2025-02-08 06:20:07,776 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-08 06:20:07,776 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:20:07,781 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:20:07,781 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:20:07,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:20:07 BoogieIcfgContainer [2025-02-08 06:20:07,782 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:20:07,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:20:07,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:20:07,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:20:07,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:20:07" (1/3) ... [2025-02-08 06:20:07,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1c8392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:20:07, skipping insertion in model container [2025-02-08 06:20:07,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:20:07" (2/3) ... [2025-02-08 06:20:07,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1c8392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:20:07, skipping insertion in model container [2025-02-08 06:20:07,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:20:07" (3/3) ... [2025-02-08 06:20:07,791 INFO L128 eAbstractionObserver]: Analyzing ICFG test24-1.c [2025-02-08 06:20:07,800 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:20:07,801 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test24-1.c that has 1 procedures, 26 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-02-08 06:20:07,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:20:07,829 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;@2655eee0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:20:07,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 06:20:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 15 states have (on average 1.8) internal successors, (27), 25 states have internal predecessors, (27), 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:20:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:20:07,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:07,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:20:07,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-08 06:20:07,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash 67459, now seen corresponding path program 1 times [2025-02-08 06:20:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060926283] [2025-02-08 06:20:07,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:07,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:07,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:20:07,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:20:07,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:07,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:07,954 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:20:07,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:07,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060926283] [2025-02-08 06:20:07,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060926283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:07,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:07,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:20:07,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530087839] [2025-02-08 06:20:07,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:07,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:20:07,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:07,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:20:07,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:20:07,974 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.8) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:08,013 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2025-02-08 06:20:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:20:08,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:20:08,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:08,018 INFO L225 Difference]: With dead ends: 25 [2025-02-08 06:20:08,018 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 06:20:08,020 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:20:08,022 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:08,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:08,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 06:20:08,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 06:20:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 20 states have internal predecessors, (21), 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:20:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-02-08 06:20:08,046 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 3 [2025-02-08 06:20:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:08,047 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-02-08 06:20:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-02-08 06:20:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:20:08,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:08,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:20:08,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:20:08,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-08 06:20:08,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash 67460, now seen corresponding path program 1 times [2025-02-08 06:20:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:08,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-02-08 06:20:08,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:08,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:20:08,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:20:08,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:08,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:08,165 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:20:08,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:08,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-02-08 06:20:08,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911687258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:08,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:08,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:20:08,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328982282] [2025-02-08 06:20:08,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:08,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:20:08,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:08,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:20:08,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:20:08,167 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:08,212 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-02-08 06:20:08,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:20:08,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 06:20:08,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:08,212 INFO L225 Difference]: With dead ends: 20 [2025-02-08 06:20:08,212 INFO L226 Difference]: Without dead ends: 20 [2025-02-08 06:20:08,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:08,213 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:08,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 17 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-08 06:20:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-08 06:20:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-02-08 06:20:08,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 3 [2025-02-08 06:20:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:08,218 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-02-08 06:20:08,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-02-08 06:20:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:20:08,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:08,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:20:08,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:20:08,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-08 06:20:08,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:08,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2091385, now seen corresponding path program 1 times [2025-02-08 06:20:08,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:08,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711786772] [2025-02-08 06:20:08,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:08,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:08,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:20:08,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:20:08,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:08,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:08,312 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:20:08,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:08,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711786772] [2025-02-08 06:20:08,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711786772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:08,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:08,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:20:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124994849] [2025-02-08 06:20:08,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:08,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:20:08,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:08,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:20:08,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:20:08,314 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:08,341 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-02-08 06:20:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:20:08,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:20:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:08,342 INFO L225 Difference]: With dead ends: 19 [2025-02-08 06:20:08,342 INFO L226 Difference]: Without dead ends: 17 [2025-02-08 06:20:08,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:20:08,342 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:08,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-08 06:20:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-08 06:20:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-02-08 06:20:08,344 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 4 [2025-02-08 06:20:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:08,344 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-02-08 06:20:08,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-02-08 06:20:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:20:08,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:08,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:20:08,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:20:08,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-08 06:20:08,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash 64828160, now seen corresponding path program 1 times [2025-02-08 06:20:08,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:08,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179140571] [2025-02-08 06:20:08,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:08,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:08,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:20:08,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:20:08,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:08,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:08,404 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:20:08,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:08,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179140571] [2025-02-08 06:20:08,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179140571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:08,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:08,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:20:08,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786923970] [2025-02-08 06:20:08,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:08,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:20:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:08,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:20:08,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:08,407 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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:20:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:08,430 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-02-08 06:20:08,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:20:08,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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:20:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:08,431 INFO L225 Difference]: With dead ends: 16 [2025-02-08 06:20:08,432 INFO L226 Difference]: Without dead ends: 16 [2025-02-08 06:20:08,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:08,432 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:08,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-08 06:20:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-08 06:20:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-02-08 06:20:08,438 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 5 [2025-02-08 06:20:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:08,438 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-02-08 06:20:08,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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:20:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-02-08 06:20:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:20:08,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:08,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:20:08,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:20:08,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-08 06:20:08,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 64828161, now seen corresponding path program 1 times [2025-02-08 06:20:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766961217] [2025-02-08 06:20:08,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:08,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:20:08,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:20:08,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:08,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:08,544 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:20:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:08,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766961217] [2025-02-08 06:20:08,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766961217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:08,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:08,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:20:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483242690] [2025-02-08 06:20:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:08,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:20:08,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:08,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:20:08,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:08,546 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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:20:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:08,588 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-02-08 06:20:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:20:08,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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:20:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:08,589 INFO L225 Difference]: With dead ends: 15 [2025-02-08 06:20:08,589 INFO L226 Difference]: Without dead ends: 15 [2025-02-08 06:20:08,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:20:08,591 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:08,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 18 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-08 06:20:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-08 06:20:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-02-08 06:20:08,594 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 5 [2025-02-08 06:20:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:08,594 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-02-08 06:20:08,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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:20:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-02-08 06:20:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:20:08,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:08,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:08,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:20:08,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-08 06:20:08,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1439570693, now seen corresponding path program 1 times [2025-02-08 06:20:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:08,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433441623] [2025-02-08 06:20:08,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:08,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:08,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:20:08,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:20:08,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:08,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:08,698 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:20:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:08,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433441623] [2025-02-08 06:20:08,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433441623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:08,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:08,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:20:08,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238307654] [2025-02-08 06:20:08,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:08,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:20:08,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:08,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:20:08,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:08,700 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:08,729 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-08 06:20:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:20:08,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 06:20:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:08,730 INFO L225 Difference]: With dead ends: 14 [2025-02-08 06:20:08,730 INFO L226 Difference]: Without dead ends: 14 [2025-02-08 06:20:08,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:20:08,731 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:08,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-08 06:20:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-08 06:20:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-08 06:20:08,733 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 8 [2025-02-08 06:20:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:08,733 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-08 06:20:08,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-08 06:20:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:20:08,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:08,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:08,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:20:08,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-08 06:20:08,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1439570692, now seen corresponding path program 1 times [2025-02-08 06:20:08,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:08,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-02-08 06:20:08,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:08,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:20:08,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:20:08,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:08,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:08,836 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:20:08,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:08,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-02-08 06:20:08,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930090440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:08,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:08,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:20:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884500098] [2025-02-08 06:20:08,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:08,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:20:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:08,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:20:08,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:08,837 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:08,899 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-08 06:20:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:20:08,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 06:20:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:08,900 INFO L225 Difference]: With dead ends: 13 [2025-02-08 06:20:08,900 INFO L226 Difference]: Without dead ends: 13 [2025-02-08 06:20:08,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:20:08,900 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:08,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-08 06:20:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-08 06:20:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 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:20:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-02-08 06:20:08,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2025-02-08 06:20:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:08,902 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-02-08 06:20:08,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-02-08 06:20:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:20:08,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:08,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:08,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:20:08,903 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-08 06:20:08,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1002073639, now seen corresponding path program 1 times [2025-02-08 06:20:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:08,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703254434] [2025-02-08 06:20:08,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:08,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:20:08,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:20:08,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:08,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:20:08,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703254434] [2025-02-08 06:20:08,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703254434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:08,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:08,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:20:08,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928226217] [2025-02-08 06:20:08,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:08,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:20:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:08,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:20:08,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:20:08,961 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:08,991 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-02-08 06:20:08,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:20:08,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:20:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:08,992 INFO L225 Difference]: With dead ends: 12 [2025-02-08 06:20:08,992 INFO L226 Difference]: Without dead ends: 12 [2025-02-08 06:20:08,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:20:08,992 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:08,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-08 06:20:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-08 06:20:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-02-08 06:20:08,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2025-02-08 06:20:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:08,994 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-02-08 06:20:08,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-02-08 06:20:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:20:08,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:08,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:08,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:20:08,997 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-08 06:20:08,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1002073638, now seen corresponding path program 1 times [2025-02-08 06:20:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:08,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402758286] [2025-02-08 06:20:08,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:08,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:09,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:20:09,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:20:09,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:09,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:09,137 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:20:09,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:09,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402758286] [2025-02-08 06:20:09,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402758286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:20:09,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:20:09,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:20:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478610960] [2025-02-08 06:20:09,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:20:09,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:20:09,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:09,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:20:09,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:20:09,138 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:09,198 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-02-08 06:20:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:20:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:20:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:09,201 INFO L225 Difference]: With dead ends: 15 [2025-02-08 06:20:09,201 INFO L226 Difference]: Without dead ends: 15 [2025-02-08 06:20:09,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:20:09,201 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:09,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:20:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-08 06:20:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-08 06:20:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-02-08 06:20:09,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2025-02-08 06:20:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:09,204 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-02-08 06:20:09,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-02-08 06:20:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:20:09,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:20:09,204 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:09,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:20:09,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-02-08 06:20:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:20:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1578141659, now seen corresponding path program 1 times [2025-02-08 06:20:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:20:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799827176] [2025-02-08 06:20:09,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:20:09,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:20:09,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:20:09,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:09,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:20:09,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:20:09,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799827176] [2025-02-08 06:20:09,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799827176] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:20:09,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83797833] [2025-02-08 06:20:09,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:20:09,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:20:09,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:20:09,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:20:09,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:20:09,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:20:09,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:20:09,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:20:09,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:20:09,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 06:20:09,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:20:09,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 06:20:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:20:09,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:20:09,932 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2025-02-08 06:20:09,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-02-08 06:20:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:20:09,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83797833] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:20:09,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:20:09,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-02-08 06:20:09,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132970718] [2025-02-08 06:20:09,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:20:09,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:20:09,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:09,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:20:09,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:20:09,961 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 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:20:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:10,386 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2025-02-08 06:20:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:20:10,387 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 06:20:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:10,387 INFO L225 Difference]: With dead ends: 23 [2025-02-08 06:20:10,387 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:20:10,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:20:10,389 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:10,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 15 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:20:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:20:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:20:10,390 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:20:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:20:10,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-02-08 06:20:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:10,390 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:20:10,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 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:20:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:20:10,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:20:10,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2025-02-08 06:20:10,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2025-02-08 06:20:10,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-02-08 06:20:10,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2025-02-08 06:20:10,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-02-08 06:20:10,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-02-08 06:20:10,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2025-02-08 06:20:10,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-02-08 06:20:10,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-02-08 06:20:10,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2025-02-08 06:20:10,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:20:10,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 06:20:10,603 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:10,609 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:20:10,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:20:10 BoogieIcfgContainer [2025-02-08 06:20:10,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:20:10,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:20:10,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:20:10,615 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:20:10,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:20:07" (3/4) ... [2025-02-08 06:20:10,617 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:20:10,623 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-08 06:20:10,623 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 06:20:10,623 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 06:20:10,624 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:20:10,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:20:10,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:20:10,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:20:10,685 INFO L158 Benchmark]: Toolchain (without parser) took 3342.74ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 111.3MB in the end (delta: 11.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2025-02-08 06:20:10,686 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:20:10,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.75ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 111.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:20:10,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.03ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:20:10,687 INFO L158 Benchmark]: Boogie Preprocessor took 29.62ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:20:10,687 INFO L158 Benchmark]: IcfgBuilder took 242.06ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 95.8MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:20:10,688 INFO L158 Benchmark]: TraceAbstraction took 2830.74ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 117.4MB in the end (delta: -22.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:20:10,688 INFO L158 Benchmark]: Witness Printer took 69.94ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 111.3MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:20:10,689 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 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.75ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 111.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.03ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.62ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 242.06ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 95.8MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2830.74ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 117.4MB in the end (delta: -22.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.94ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 111.3MB in the end (delta: 6.1MB). There was no memory consumed. 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: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 1 procedures, 26 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 341 IncrementalHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 85 mSDtfsCounter, 341 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 821 SizeOfPredicates, 6 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 0/9 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:20:10,711 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