./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-regression/test05.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 fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:12:58,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:12:59,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:12:59,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:12:59,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:12:59,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:12:59,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:12:59,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:12:59,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:12:59,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:12:59,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:12:59,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:12:59,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:12:59,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:12:59,053 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:12:59,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:12:59,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:12:59,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:12:59,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:12:59,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:12:59,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:12:59,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:12:59,055 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 -> fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 [2025-02-06 10:12:59,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:12:59,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:12:59,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:12:59,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:12:59,305 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:12:59,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test05.c [2025-02-06 10:13:00,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a50c5c14d/afb4efa336474be88ed74ac44facf5cf/FLAG723fe932c [2025-02-06 10:13:00,785 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:13:00,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test05.c [2025-02-06 10:13:00,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a50c5c14d/afb4efa336474be88ed74ac44facf5cf/FLAG723fe932c [2025-02-06 10:13:01,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a50c5c14d/afb4efa336474be88ed74ac44facf5cf [2025-02-06 10:13:01,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:13:01,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:13:01,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:13:01,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:13:01,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:13:01,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2b65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01, skipping insertion in model container [2025-02-06 10:13:01,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:13:01,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:13:01,204 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:13:01,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:13:01,227 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:13:01,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01 WrapperNode [2025-02-06 10:13:01,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:13:01,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:13:01,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:13:01,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:13:01,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,265 INFO L138 Inliner]: procedures = 16, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2025-02-06 10:13:01,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:13:01,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:13:01,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:13:01,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:13:01,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,301 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 3, 9, 3]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 8 writes are split as follows [0, 2, 5, 1]. [2025-02-06 10:13:01,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:13:01,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:13:01,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:13:01,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:13:01,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (1/1) ... [2025-02-06 10:13:01,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:13:01,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:01,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:13:01,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:13:01,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:13:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:13:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:13:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 10:13:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:13:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:13:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:13:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:13:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 10:13:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:13:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:13:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:13:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:13:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 10:13:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:13:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:13:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:13:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 10:13:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:13:01,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:13:01,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:13:01,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:13:01,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:13:01,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 10:13:01,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:13:01,479 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:13:01,481 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:13:01,735 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#p1~0#1.base, main_~#p1~0#1.offset);havoc main_~#p1~0#1.base, main_~#p1~0#1.offset;call ULTIMATE.dealloc(main_~#p2~0#1.base, main_~#p2~0#1.offset);havoc main_~#p2~0#1.base, main_~#p2~0#1.offset; [2025-02-06 10:13:01,751 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-02-06 10:13:01,754 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:13:01,762 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:13:01,763 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:13:01,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:01 BoogieIcfgContainer [2025-02-06 10:13:01,763 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:13:01,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:13:01,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:13:01,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:13:01,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:13:01" (1/3) ... [2025-02-06 10:13:01,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9e71de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:13:01, skipping insertion in model container [2025-02-06 10:13:01,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:01" (2/3) ... [2025-02-06 10:13:01,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9e71de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:13:01, skipping insertion in model container [2025-02-06 10:13:01,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:01" (3/3) ... [2025-02-06 10:13:01,772 INFO L128 eAbstractionObserver]: Analyzing ICFG test05.c [2025-02-06 10:13:01,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:13:01,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test05.c that has 1 procedures, 66 locations, 1 initial locations, 0 loop locations, and 32 error locations. [2025-02-06 10:13:01,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:13:01,828 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;@b0bcf23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:13:01,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-06 10:13:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 65 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:13:01,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:01,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:13:01,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:01,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash 104232, now seen corresponding path program 1 times [2025-02-06 10:13:01,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:01,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771543124] [2025-02-06 10:13:01,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:01,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:01,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:13:01,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:13:01,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:01,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:02,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771543124] [2025-02-06 10:13:02,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771543124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:02,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:02,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:13:02,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364333139] [2025-02-06 10:13:02,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:02,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:13:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:02,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:13:02,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:02,094 INFO L87 Difference]: Start difference. First operand has 66 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 65 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:02,172 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2025-02-06 10:13:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:02,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 10:13:02,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:02,178 INFO L225 Difference]: With dead ends: 63 [2025-02-06 10:13:02,178 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 10:13:02,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:02,181 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:02,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 10:13:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-06 10:13:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 31 states have (on average 2.0) internal successors, (62), 60 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2025-02-06 10:13:02,205 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 3 [2025-02-06 10:13:02,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:02,205 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2025-02-06 10:13:02,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2025-02-06 10:13:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:13:02,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:02,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:13:02,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:13:02,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash 104233, now seen corresponding path program 1 times [2025-02-06 10:13:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224532816] [2025-02-06 10:13:02,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:02,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:13:02,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:13:02,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:02,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:02,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:02,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224532816] [2025-02-06 10:13:02,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224532816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:02,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:02,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:13:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055859178] [2025-02-06 10:13:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:02,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:13:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:02,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:13:02,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:02,320 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:02,379 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2025-02-06 10:13:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:02,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 10:13:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:02,381 INFO L225 Difference]: With dead ends: 62 [2025-02-06 10:13:02,381 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 10:13:02,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:02,381 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 51 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:02,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 38 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 10:13:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2025-02-06 10:13:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 31 states have (on average 1.935483870967742) internal successors, (60), 58 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2025-02-06 10:13:02,385 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 3 [2025-02-06 10:13:02,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:02,385 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2025-02-06 10:13:02,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2025-02-06 10:13:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:13:02,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:02,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:13:02,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:13:02,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:02,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash 3231230, now seen corresponding path program 1 times [2025-02-06 10:13:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:02,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230984181] [2025-02-06 10:13:02,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:02,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:13:02,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:13:02,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:02,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:02,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230984181] [2025-02-06 10:13:02,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230984181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:02,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:02,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:13:02,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834907270] [2025-02-06 10:13:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:02,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:13:02,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:02,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:13:02,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:02,418 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:02,457 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2025-02-06 10:13:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:02,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 10:13:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:02,458 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:13:02,458 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:13:02,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:02,458 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:02,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:13:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-06 10:13:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.903225806451613) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2025-02-06 10:13:02,461 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 4 [2025-02-06 10:13:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:02,462 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2025-02-06 10:13:02,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2025-02-06 10:13:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:13:02,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:02,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:13:02,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:13:02,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:02,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash 3231231, now seen corresponding path program 1 times [2025-02-06 10:13:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:02,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193894811] [2025-02-06 10:13:02,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:02,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:13:02,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:13:02,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:02,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:02,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193894811] [2025-02-06 10:13:02,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193894811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:02,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:02,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:13:02,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272765979] [2025-02-06 10:13:02,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:02,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:13:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:02,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:13:02,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:02,546 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:02,606 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2025-02-06 10:13:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:02,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 10:13:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:02,608 INFO L225 Difference]: With dead ends: 57 [2025-02-06 10:13:02,608 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 10:13:02,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:02,608 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:02,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 10:13:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-06 10:13:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 56 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2025-02-06 10:13:02,617 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2025-02-06 10:13:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:02,617 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2025-02-06 10:13:02,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2025-02-06 10:13:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:13:02,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:02,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:13:02,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:13:02,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:02,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash 100168165, now seen corresponding path program 1 times [2025-02-06 10:13:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:02,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006105719] [2025-02-06 10:13:02,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:02,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:02,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:13:02,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:13:02,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:02,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006105719] [2025-02-06 10:13:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006105719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:02,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:13:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618249618] [2025-02-06 10:13:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:02,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:13:02,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:02,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:13:02,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:02,725 INFO L87 Difference]: Start difference. First operand 57 states and 58 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-06 10:13:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:02,782 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2025-02-06 10:13:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:02,783 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-06 10:13:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:02,787 INFO L225 Difference]: With dead ends: 56 [2025-02-06 10:13:02,787 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 10:13:02,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:02,789 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:02,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 10:13:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-06 10:13:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2025-02-06 10:13:02,796 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 5 [2025-02-06 10:13:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:02,796 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2025-02-06 10:13:02,796 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-06 10:13:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2025-02-06 10:13:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:13:02,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:02,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:13:02,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:13:02,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:02,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:02,798 INFO L85 PathProgramCache]: Analyzing trace with hash 100168166, now seen corresponding path program 1 times [2025-02-06 10:13:02,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:02,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664687449] [2025-02-06 10:13:02,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:02,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:02,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:13:02,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:13:02,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:02,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:02,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:02,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664687449] [2025-02-06 10:13:02,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664687449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:02,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:02,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:13:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760322394] [2025-02-06 10:13:02,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:02,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:13:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:02,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:13:02,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:02,940 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) 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-06 10:13:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:02,999 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2025-02-06 10:13:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:03,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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-06 10:13:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:03,001 INFO L225 Difference]: With dead ends: 55 [2025-02-06 10:13:03,001 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 10:13:03,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:03,002 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:03,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 10:13:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-06 10:13:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2025-02-06 10:13:03,007 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 5 [2025-02-06 10:13:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:03,007 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2025-02-06 10:13:03,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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-06 10:13:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2025-02-06 10:13:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:13:03,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:03,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:13:03,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:13:03,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:03,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1189754148, now seen corresponding path program 1 times [2025-02-06 10:13:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366324856] [2025-02-06 10:13:03,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:03,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:13:03,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:13:03,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:03,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:03,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:03,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366324856] [2025-02-06 10:13:03,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366324856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:03,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:03,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:13:03,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931583045] [2025-02-06 10:13:03,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:03,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:13:03,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:03,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:13:03,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:03,174 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:03,218 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-02-06 10:13:03,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:03,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:13:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:03,219 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:13:03,219 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:13:03,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:03,219 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 57 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:03,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:13:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 10:13:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2025-02-06 10:13:03,222 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 6 [2025-02-06 10:13:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:03,222 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-02-06 10:13:03,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2025-02-06 10:13:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:13:03,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:03,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:13:03,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:13:03,223 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:03,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:03,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1189754149, now seen corresponding path program 1 times [2025-02-06 10:13:03,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:03,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890463678] [2025-02-06 10:13:03,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:03,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:03,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:13:03,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:13:03,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:03,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:03,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:03,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890463678] [2025-02-06 10:13:03,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890463678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:03,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:03,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:13:03,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196079710] [2025-02-06 10:13:03,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:03,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:13:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:03,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:13:03,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:03,339 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:03,384 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2025-02-06 10:13:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:03,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:13:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:03,384 INFO L225 Difference]: With dead ends: 43 [2025-02-06 10:13:03,384 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 10:13:03,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:03,385 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:03,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 10:13:03,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 10:13:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2025-02-06 10:13:03,387 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 6 [2025-02-06 10:13:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:03,388 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2025-02-06 10:13:03,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2025-02-06 10:13:03,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:13:03,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:03,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:03,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:13:03,388 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:03,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:03,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1676444885, now seen corresponding path program 1 times [2025-02-06 10:13:03,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:03,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691605215] [2025-02-06 10:13:03,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:03,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:03,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:13:03,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:13:03,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:03,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:03,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:03,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691605215] [2025-02-06 10:13:03,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691605215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:03,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:03,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:13:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105660501] [2025-02-06 10:13:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:03,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:13:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:13:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:03,467 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-06 10:13:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:03,529 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2025-02-06 10:13:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:03,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:13:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:03,529 INFO L225 Difference]: With dead ends: 42 [2025-02-06 10:13:03,529 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 10:13:03,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:13:03,530 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:03,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 47 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 10:13:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-02-06 10:13:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2025-02-06 10:13:03,531 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 14 [2025-02-06 10:13:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:03,531 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2025-02-06 10:13:03,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-06 10:13:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2025-02-06 10:13:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:13:03,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:03,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:03,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:13:03,532 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:03,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1676444886, now seen corresponding path program 1 times [2025-02-06 10:13:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:03,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460660958] [2025-02-06 10:13:03,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:03,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:13:03,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:13:03,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:03,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:03,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460660958] [2025-02-06 10:13:03,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460660958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:03,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:03,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:13:03,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068505017] [2025-02-06 10:13:03,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:03,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:13:03,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:03,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:13:03,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:03,679 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-06 10:13:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:03,732 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2025-02-06 10:13:03,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:03,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:13:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:03,733 INFO L225 Difference]: With dead ends: 40 [2025-02-06 10:13:03,733 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 10:13:03,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:03,733 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:03,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 10:13:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-02-06 10:13:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2025-02-06 10:13:03,735 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 14 [2025-02-06 10:13:03,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:03,735 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2025-02-06 10:13:03,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-06 10:13:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2025-02-06 10:13:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:13:03,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:03,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:03,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:13:03,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:03,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:03,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1089863957, now seen corresponding path program 1 times [2025-02-06 10:13:03,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:03,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759875245] [2025-02-06 10:13:03,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:03,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:03,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:13:03,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:13:03,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:03,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:03,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:03,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759875245] [2025-02-06 10:13:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759875245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:03,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:03,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:13:03,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948949782] [2025-02-06 10:13:03,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:03,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:13:03,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:03,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:13:03,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:03,824 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-06 10:13:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:03,885 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2025-02-06 10:13:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:03,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:13:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:03,886 INFO L225 Difference]: With dead ends: 39 [2025-02-06 10:13:03,886 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 10:13:03,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:13:03,887 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:03,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 10:13:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-02-06 10:13:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-02-06 10:13:03,888 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 17 [2025-02-06 10:13:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:03,888 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-02-06 10:13:03,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-06 10:13:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2025-02-06 10:13:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:13:03,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:03,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:03,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:13:03,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:03,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1089863958, now seen corresponding path program 1 times [2025-02-06 10:13:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:03,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349692059] [2025-02-06 10:13:03,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:03,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:13:03,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:13:03,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:03,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:04,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349692059] [2025-02-06 10:13:04,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349692059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:04,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:13:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100286460] [2025-02-06 10:13:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:04,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:13:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:04,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:13:04,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:04,025 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-06 10:13:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:04,106 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2025-02-06 10:13:04,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:04,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:13:04,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:04,107 INFO L225 Difference]: With dead ends: 41 [2025-02-06 10:13:04,107 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 10:13:04,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:04,107 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:04,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 10:13:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-02-06 10:13:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2025-02-06 10:13:04,109 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2025-02-06 10:13:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:04,109 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-02-06 10:13:04,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-06 10:13:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2025-02-06 10:13:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:13:04,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:04,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:04,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:13:04,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:04,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash -612757358, now seen corresponding path program 1 times [2025-02-06 10:13:04,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:04,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752523463] [2025-02-06 10:13:04,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:04,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:04,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:13:04,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:13:04,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:04,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:04,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:04,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752523463] [2025-02-06 10:13:04,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752523463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:04,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:04,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:13:04,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900945742] [2025-02-06 10:13:04,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:04,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:13:04,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:04,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:13:04,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:04,288 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:04,386 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-02-06 10:13:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:13:04,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:13:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:04,387 INFO L225 Difference]: With dead ends: 37 [2025-02-06 10:13:04,387 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 10:13:04,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:13:04,387 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:04,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 100 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 10:13:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-02-06 10:13:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-02-06 10:13:04,389 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 19 [2025-02-06 10:13:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:04,389 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-02-06 10:13:04,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-02-06 10:13:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:13:04,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:04,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:04,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:13:04,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:04,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash -612757357, now seen corresponding path program 1 times [2025-02-06 10:13:04,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:04,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857431098] [2025-02-06 10:13:04,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:04,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:04,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:13:04,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:13:04,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:04,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:04,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:04,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857431098] [2025-02-06 10:13:04,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857431098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:04,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:04,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:13:04,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365810013] [2025-02-06 10:13:04,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:04,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:13:04,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:04,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:13:04,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:13:04,661 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:04,767 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2025-02-06 10:13:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:13:04,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:13:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:04,767 INFO L225 Difference]: With dead ends: 36 [2025-02-06 10:13:04,767 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 10:13:04,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:13:04,768 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:04,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 130 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 10:13:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-02-06 10:13:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 34 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-06 10:13:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-02-06 10:13:04,773 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 19 [2025-02-06 10:13:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:04,773 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-02-06 10:13:04,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-02-06 10:13:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:13:04,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:04,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:04,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:13:04,773 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:04,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:04,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1658434080, now seen corresponding path program 1 times [2025-02-06 10:13:04,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:04,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480648766] [2025-02-06 10:13:04,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:04,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:04,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:13:04,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:13:04,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:04,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480648766] [2025-02-06 10:13:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480648766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:04,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:04,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:13:04,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766133963] [2025-02-06 10:13:04,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:04,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:13:04,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:04,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:13:04,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:04,938 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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-06 10:13:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:04,999 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2025-02-06 10:13:04,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:13:04,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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) Word has length 20 [2025-02-06 10:13:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:05,000 INFO L225 Difference]: With dead ends: 35 [2025-02-06 10:13:05,000 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 10:13:05,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:13:05,002 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:05,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 167 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 10:13:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 10:13:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2025-02-06 10:13:05,003 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 20 [2025-02-06 10:13:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:05,004 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2025-02-06 10:13:05,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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-06 10:13:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2025-02-06 10:13:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:13:05,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:05,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:05,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:13:05,004 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:05,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1641643307, now seen corresponding path program 1 times [2025-02-06 10:13:05,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:05,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649537126] [2025-02-06 10:13:05,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:05,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:05,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:13:05,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:13:05,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:05,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649537126] [2025-02-06 10:13:05,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649537126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:05,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:05,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:13:05,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550646829] [2025-02-06 10:13:05,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:05,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:13:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:05,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:13:05,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:05,094 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-06 10:13:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:05,119 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2025-02-06 10:13:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:13:05,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) Word has length 27 [2025-02-06 10:13:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:05,120 INFO L225 Difference]: With dead ends: 35 [2025-02-06 10:13:05,120 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 10:13:05,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:05,120 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:05,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 10:13:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 10:13:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 34 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2025-02-06 10:13:05,122 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 27 [2025-02-06 10:13:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:05,122 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2025-02-06 10:13:05,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-06 10:13:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2025-02-06 10:13:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:13:05,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:05,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:05,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:13:05,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:05,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1641644588, now seen corresponding path program 1 times [2025-02-06 10:13:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:05,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937995579] [2025-02-06 10:13:05,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:05,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:13:05,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:13:05,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:05,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:05,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:05,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937995579] [2025-02-06 10:13:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937995579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:05,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:05,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:13:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720312601] [2025-02-06 10:13:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:05,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:13:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:05,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:13:05,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:13:05,503 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 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-06 10:13:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:05,607 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2025-02-06 10:13:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:13:05,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 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) Word has length 27 [2025-02-06 10:13:05,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:05,608 INFO L225 Difference]: With dead ends: 34 [2025-02-06 10:13:05,608 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 10:13:05,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:13:05,608 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:05,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 10:13:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 10:13:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2025-02-06 10:13:05,615 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 27 [2025-02-06 10:13:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:05,615 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2025-02-06 10:13:05,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 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-06 10:13:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2025-02-06 10:13:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:13:05,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:05,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:05,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:13:05,616 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:05,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1641644587, now seen corresponding path program 1 times [2025-02-06 10:13:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:05,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216378467] [2025-02-06 10:13:05,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:05,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:13:05,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:13:05,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:05,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:05,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216378467] [2025-02-06 10:13:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216378467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:05,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:13:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166278910] [2025-02-06 10:13:05,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:05,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:13:05,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:05,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:13:05,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:13:05,807 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-06 10:13:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:05,878 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2025-02-06 10:13:05,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:13:05,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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) Word has length 27 [2025-02-06 10:13:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:05,879 INFO L225 Difference]: With dead ends: 33 [2025-02-06 10:13:05,879 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 10:13:05,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:13:05,880 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:05,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 10:13:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 10:13:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2025-02-06 10:13:05,881 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 27 [2025-02-06 10:13:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:05,881 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2025-02-06 10:13:05,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-06 10:13:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2025-02-06 10:13:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:13:05,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:05,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:05,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:13:05,882 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:05,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1367449918, now seen corresponding path program 1 times [2025-02-06 10:13:05,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:05,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549490945] [2025-02-06 10:13:05,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:05,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:05,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:13:05,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:13:05,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:05,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:06,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:06,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549490945] [2025-02-06 10:13:06,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549490945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:06,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:06,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:13:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486502551] [2025-02-06 10:13:06,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:06,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:13:06,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:06,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:13:06,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:06,141 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:06,173 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2025-02-06 10:13:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:13:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2025-02-06 10:13:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:06,174 INFO L225 Difference]: With dead ends: 32 [2025-02-06 10:13:06,174 INFO L226 Difference]: Without dead ends: 31 [2025-02-06 10:13:06,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:06,175 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:06,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-06 10:13:06,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-06 10:13:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0) internal successors, (30), 30 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2025-02-06 10:13:06,176 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 29 [2025-02-06 10:13:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:06,176 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2025-02-06 10:13:06,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2025-02-06 10:13:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:13:06,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:06,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:06,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:13:06,177 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-02-06 10:13:06,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash -558727232, now seen corresponding path program 1 times [2025-02-06 10:13:06,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:06,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837279440] [2025-02-06 10:13:06,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:06,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:13:06,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:13:06,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:06,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:06,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:06,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837279440] [2025-02-06 10:13:06,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837279440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:06,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:06,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 10:13:06,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78034301] [2025-02-06 10:13:06,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:06,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 10:13:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:06,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 10:13:06,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:13:06,619 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:06,837 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2025-02-06 10:13:06,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:13:06,837 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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 30 [2025-02-06 10:13:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:06,838 INFO L225 Difference]: With dead ends: 28 [2025-02-06 10:13:06,838 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 10:13:06,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:13:06,838 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:06,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 86 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 10:13:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 10:13:06,839 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-06 10:13:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 10:13:06,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2025-02-06 10:13:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:06,839 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 10:13:06,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 10:13:06,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 10:13:06,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (31 of 32 remaining) [2025-02-06 10:13:06,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (30 of 32 remaining) [2025-02-06 10:13:06,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2025-02-06 10:13:06,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2025-02-06 10:13:06,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2025-02-06 10:13:06,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2025-02-06 10:13:06,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 32 remaining) [2025-02-06 10:13:06,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:13:06,847 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:06,849 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:13:06,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:13:06 BoogieIcfgContainer [2025-02-06 10:13:06,854 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:13:06,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:13:06,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:13:06,854 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:13:06,855 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:01" (3/4) ... [2025-02-06 10:13:06,856 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 10:13:06,865 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-06 10:13:06,865 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-06 10:13:06,866 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 10:13:06,866 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 10:13:06,927 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 10:13:06,927 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 10:13:06,928 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:13:06,928 INFO L158 Benchmark]: Toolchain (without parser) took 5834.37ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 105.1MB in the beginning and 176.0MB in the end (delta: -70.9MB). Peak memory consumption was 170.4MB. Max. memory is 16.1GB. [2025-02-06 10:13:06,928 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:13:06,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 133.47ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:13:06,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.76ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.4MB in the end (delta: 806.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:13:06,930 INFO L158 Benchmark]: Boogie Preprocessor took 55.53ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:13:06,930 INFO L158 Benchmark]: IcfgBuilder took 439.92ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 72.2MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:13:06,930 INFO L158 Benchmark]: TraceAbstraction took 5087.47ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 71.2MB in the beginning and 183.0MB in the end (delta: -111.8MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2025-02-06 10:13:06,930 INFO L158 Benchmark]: Witness Printer took 73.48ms. Allocated memory is still 385.9MB. Free memory was 183.0MB in the beginning and 176.0MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:13:06,931 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.29ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 133.47ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.76ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.4MB in the end (delta: 806.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.53ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 439.92ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 72.2MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5087.47ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 71.2MB in the beginning and 183.0MB in the end (delta: -111.8MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. * Witness Printer took 73.48ms. Allocated memory is still 385.9MB. Free memory was 183.0MB in the beginning and 176.0MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 504 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 504 mSDsluCounter, 1506 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 979 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1494 IncrementalHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 527 mSDtfsCounter, 1494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 12 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 2845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 10:13:06,950 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