./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/nested_structure-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/nested_structure-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea326fa3b3c9fd831a506f8385a58b98f853e8c897ae4643e624e28b471a415c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:15:28,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:15:29,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:15:29,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:15:29,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:15:29,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:15:29,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:15:29,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:15:29,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:15:29,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:15:29,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:15:29,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:15:29,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:15:29,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:15:29,050 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:15:29,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:15:29,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:15:29,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:15:29,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:15:29,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:15:29,051 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:15:29,051 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:15:29,051 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:15:29,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:15:29,051 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:15:29,052 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:15:29,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:15:29,052 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:15:29,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:15:29,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:15:29,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:15:29,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:15:29,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:15:29,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:29,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:15:29,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:15:29,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:15:29,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:15:29,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:29,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:15:29,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:15:29,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:15:29,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:15:29,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:15:29,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:15:29,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:15:29,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:15:29,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 -> ea326fa3b3c9fd831a506f8385a58b98f853e8c897ae4643e624e28b471a415c [2025-01-09 22:15:29,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:15:29,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:15:29,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:15:29,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:15:29,345 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:15:29,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/nested_structure-2.i [2025-01-09 22:15:30,685 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13ae8df9b/44223f079f9c492e94be82170393afc6/FLAG733f2e513 [2025-01-09 22:15:30,945 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:15:30,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/nested_structure-2.i [2025-01-09 22:15:30,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13ae8df9b/44223f079f9c492e94be82170393afc6/FLAG733f2e513 [2025-01-09 22:15:30,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13ae8df9b/44223f079f9c492e94be82170393afc6 [2025-01-09 22:15:30,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:15:30,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:15:30,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:15:30,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:15:30,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:15:30,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:15:30" (1/1) ... [2025-01-09 22:15:30,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c6fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:30, skipping insertion in model container [2025-01-09 22:15:30,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:15:30" (1/1) ... [2025-01-09 22:15:30,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:15:31,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:15:31,146 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:15:31,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:15:31,176 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:15:31,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31 WrapperNode [2025-01-09 22:15:31,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:15:31,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:15:31,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:15:31,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:15:31,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,207 INFO L138 Inliner]: procedures = 18, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2025-01-09 22:15:31,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:15:31,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:15:31,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:15:31,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:15:31,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,238 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 3, 4, 4]. 31 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 2, 2]. The 1 writes are split as follows [0, 1, 0, 0]. [2025-01-09 22:15:31,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:15:31,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:15:31,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:15:31,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:15:31,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (1/1) ... [2025-01-09 22:15:31,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:31,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:31,293 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-01-09 22:15:31,296 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-01-09 22:15:31,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:15:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:15:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:15:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 22:15:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:15:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:15:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:15:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 22:15:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:15:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:15:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:15:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:15:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 22:15:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:15:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:15:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:15:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:15:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 22:15:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:15:31,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:15:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:15:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:15:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:15:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 22:15:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:15:31,413 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:15:31,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:15:31,581 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-09 22:15:31,582 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:15:31,588 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:15:31,588 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:15:31,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:31 BoogieIcfgContainer [2025-01-09 22:15:31,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:15:31,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:15:31,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:15:31,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:15:31,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:15:30" (1/3) ... [2025-01-09 22:15:31,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7832ab1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:15:31, skipping insertion in model container [2025-01-09 22:15:31,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:31" (2/3) ... [2025-01-09 22:15:31,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7832ab1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:15:31, skipping insertion in model container [2025-01-09 22:15:31,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:31" (3/3) ... [2025-01-09 22:15:31,598 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_structure-2.i [2025-01-09 22:15:31,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:15:31,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_structure-2.i that has 1 procedures, 33 locations, 1 initial locations, 0 loop locations, and 14 error locations. [2025-01-09 22:15:31,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:15:31,658 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;@5067ed4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:15:31,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-09 22:15:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 32 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-01-09 22:15:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:15:31,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:31,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:15:31,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:31,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:31,671 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2025-01-09 22:15:31,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:31,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932641908] [2025-01-09 22:15:31,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:31,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:15:31,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:15:31,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:31,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:31,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932641908] [2025-01-09 22:15:31,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932641908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:31,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:31,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:15:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121533073] [2025-01-09 22:15:31,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:15:31,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:31,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:15:31,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:31,906 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 32 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) 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-01-09 22:15:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:31,953 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2025-01-09 22:15:31,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:15:31,956 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-01-09 22:15:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:31,961 INFO L225 Difference]: With dead ends: 30 [2025-01-09 22:15:31,962 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 22:15:31,964 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-01-09 22:15:31,968 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:31,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 17 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 22:15:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 22:15:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.6875) internal successors, (27), 27 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-01-09 22:15:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2025-01-09 22:15:31,997 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 3 [2025-01-09 22:15:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:31,997 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2025-01-09 22:15:31,997 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-01-09 22:15:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2025-01-09 22:15:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-09 22:15:31,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:31,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-09 22:15:31,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:15:31,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:31,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-01-09 22:15:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470672737] [2025-01-09 22:15:32,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:32,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:32,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-09 22:15:32,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-09 22:15:32,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:32,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:32,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:32,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470672737] [2025-01-09 22:15:32,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470672737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:32,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:32,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:15:32,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81080388] [2025-01-09 22:15:32,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:32,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:15:32,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:32,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:15:32,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:32,179 INFO L87 Difference]: Start difference. First operand 28 states and 27 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-01-09 22:15:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:32,219 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2025-01-09 22:15:32,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:15:32,220 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-01-09 22:15:32,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:32,221 INFO L225 Difference]: With dead ends: 26 [2025-01-09 22:15:32,221 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 22:15:32,221 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-01-09 22:15:32,222 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:32,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 22:15:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 22:15:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2025-01-09 22:15:32,225 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 3 [2025-01-09 22:15:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:32,225 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2025-01-09 22:15:32,225 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-01-09 22:15:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2025-01-09 22:15:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:15:32,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:32,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:15:32,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:15:32,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:32,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2025-01-09 22:15:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:32,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073268974] [2025-01-09 22:15:32,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:32,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:15:32,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:15:32,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:32,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:32,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073268974] [2025-01-09 22:15:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073268974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:32,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:32,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:15:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478953595] [2025-01-09 22:15:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:32,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:15:32,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:32,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:15:32,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:32,381 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-01-09 22:15:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:32,478 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2025-01-09 22:15:32,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:15:32,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-01-09 22:15:32,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:32,480 INFO L225 Difference]: With dead ends: 25 [2025-01-09 22:15:32,480 INFO L226 Difference]: Without dead ends: 25 [2025-01-09 22:15:32,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:32,481 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:32,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:32,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-09 22:15:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-09 22:15:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.5) internal successors, (24), 24 states have internal predecessors, (24), 0 states have call successors, (0), 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-01-09 22:15:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2025-01-09 22:15:32,485 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 4 [2025-01-09 22:15:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:32,486 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2025-01-09 22:15:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-01-09 22:15:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2025-01-09 22:15:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:15:32,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:32,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:15:32,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:15:32,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:32,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2025-01-09 22:15:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:32,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588992918] [2025-01-09 22:15:32,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:32,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:32,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:15:32,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:15:32,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:32,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:32,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:32,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588992918] [2025-01-09 22:15:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588992918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:32,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:32,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:15:32,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477468457] [2025-01-09 22:15:32,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:32,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:15:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:32,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:15:32,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:32,635 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-01-09 22:15:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:32,691 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2025-01-09 22:15:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:15:32,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-01-09 22:15:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:32,691 INFO L225 Difference]: With dead ends: 24 [2025-01-09 22:15:32,692 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 22:15:32,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:32,692 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:32,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:32,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 22:15:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-09 22:15:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 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-01-09 22:15:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2025-01-09 22:15:32,699 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 4 [2025-01-09 22:15:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:32,699 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2025-01-09 22:15:32,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-01-09 22:15:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2025-01-09 22:15:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:15:32,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:32,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:15:32,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:15:32,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:32,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2025-01-09 22:15:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:32,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240579448] [2025-01-09 22:15:32,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:32,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:15:32,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:15:32,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:32,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:32,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240579448] [2025-01-09 22:15:32,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240579448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:32,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:32,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:15:32,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475208374] [2025-01-09 22:15:32,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:32,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:15:32,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:32,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:15:32,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:32,948 INFO L87 Difference]: Start difference. First operand 24 states and 23 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-01-09 22:15:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:33,035 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2025-01-09 22:15:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:15:33,036 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-01-09 22:15:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:33,036 INFO L225 Difference]: With dead ends: 23 [2025-01-09 22:15:33,036 INFO L226 Difference]: Without dead ends: 23 [2025-01-09 22:15:33,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:15:33,037 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:33,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-09 22:15:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-09 22:15:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 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-01-09 22:15:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2025-01-09 22:15:33,039 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 5 [2025-01-09 22:15:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:33,039 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2025-01-09 22:15:33,039 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-01-09 22:15:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2025-01-09 22:15:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:15:33,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:33,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:15:33,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:15:33,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2025-01-09 22:15:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:33,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444290952] [2025-01-09 22:15:33,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:33,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:33,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:15:33,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:15:33,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:33,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:33,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:33,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444290952] [2025-01-09 22:15:33,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444290952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:33,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:33,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:15:33,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740542298] [2025-01-09 22:15:33,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:33,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:15:33,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:33,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:15:33,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:33,297 INFO L87 Difference]: Start difference. First operand 23 states and 22 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-01-09 22:15:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:33,373 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2025-01-09 22:15:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:15:33,374 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-01-09 22:15:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:33,374 INFO L225 Difference]: With dead ends: 22 [2025-01-09 22:15:33,374 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 22:15:33,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:15:33,375 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 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-01-09 22:15:33,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 22:15:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 22:15:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2025-01-09 22:15:33,377 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 5 [2025-01-09 22:15:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:33,377 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2025-01-09 22:15:33,377 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-01-09 22:15:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2025-01-09 22:15:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:15:33,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:33,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:33,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:15:33,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:33,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:33,382 INFO L85 PathProgramCache]: Analyzing trace with hash 59261549, now seen corresponding path program 1 times [2025-01-09 22:15:33,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:33,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438575007] [2025-01-09 22:15:33,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:33,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:33,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:15:33,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:15:33,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:33,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:33,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:33,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438575007] [2025-01-09 22:15:33,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438575007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:33,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:33,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:15:33,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689208676] [2025-01-09 22:15:33,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:33,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:15:33,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:33,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:15:33,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:33,443 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:33,483 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2025-01-09 22:15:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:15:33,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:15:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:33,484 INFO L225 Difference]: With dead ends: 21 [2025-01-09 22:15:33,484 INFO L226 Difference]: Without dead ends: 21 [2025-01-09 22:15:33,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:33,485 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:33,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:33,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-09 22:15:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-01-09 22:15:33,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 20 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-01-09 22:15:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2025-01-09 22:15:33,487 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 8 [2025-01-09 22:15:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:33,487 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2025-01-09 22:15:33,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2025-01-09 22:15:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:15:33,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:33,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:33,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:15:33,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:33,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:33,489 INFO L85 PathProgramCache]: Analyzing trace with hash 59261550, now seen corresponding path program 1 times [2025-01-09 22:15:33,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:33,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725913023] [2025-01-09 22:15:33,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:33,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:15:33,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:15:33,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:33,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:33,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725913023] [2025-01-09 22:15:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725913023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:33,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:33,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:15:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627892533] [2025-01-09 22:15:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:33,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:15:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:33,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:15:33,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:33,605 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:33,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:33,643 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2025-01-09 22:15:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:15:33,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:15:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:33,648 INFO L225 Difference]: With dead ends: 20 [2025-01-09 22:15:33,648 INFO L226 Difference]: Without dead ends: 20 [2025-01-09 22:15:33,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:15:33,649 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:33,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-09 22:15:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-09 22:15:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 19 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-01-09 22:15:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2025-01-09 22:15:33,651 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 8 [2025-01-09 22:15:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:33,651 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2025-01-09 22:15:33,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2025-01-09 22:15:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:15:33,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:33,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:33,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:15:33,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:33,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1837108008, now seen corresponding path program 1 times [2025-01-09 22:15:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:33,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014874992] [2025-01-09 22:15:33,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:33,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:15:33,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:15:33,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:33,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:33,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:33,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014874992] [2025-01-09 22:15:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014874992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:33,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:15:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789019430] [2025-01-09 22:15:33,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:33,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:15:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:33,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:15:33,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:15:33,807 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:33,877 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2025-01-09 22:15:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:15:33,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:15:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:33,878 INFO L225 Difference]: With dead ends: 19 [2025-01-09 22:15:33,878 INFO L226 Difference]: Without dead ends: 19 [2025-01-09 22:15:33,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:15:33,879 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:33,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-09 22:15:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-01-09 22:15:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2025-01-09 22:15:33,881 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 9 [2025-01-09 22:15:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:33,881 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2025-01-09 22:15:33,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2025-01-09 22:15:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:15:33,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:33,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:33,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:15:33,885 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:33,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1837108009, now seen corresponding path program 1 times [2025-01-09 22:15:33,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:33,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69506672] [2025-01-09 22:15:33,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:33,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:33,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:15:33,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:15:33,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:33,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:34,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:34,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69506672] [2025-01-09 22:15:34,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69506672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:34,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:34,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:15:34,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671496211] [2025-01-09 22:15:34,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:34,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:15:34,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:34,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:15:34,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:15:34,186 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:34,254 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2025-01-09 22:15:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:15:34,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:15:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:34,255 INFO L225 Difference]: With dead ends: 18 [2025-01-09 22:15:34,255 INFO L226 Difference]: Without dead ends: 18 [2025-01-09 22:15:34,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:15:34,255 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:34,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-09 22:15:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-09 22:15:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.0625) internal successors, (17), 17 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-01-09 22:15:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2025-01-09 22:15:34,257 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 9 [2025-01-09 22:15:34,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:34,257 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2025-01-09 22:15:34,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2025-01-09 22:15:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:15:34,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:34,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:34,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:15:34,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:34,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1253225369, now seen corresponding path program 1 times [2025-01-09 22:15:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:34,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523928087] [2025-01-09 22:15:34,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:34,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:15:34,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:15:34,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:34,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523928087] [2025-01-09 22:15:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523928087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:34,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:34,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:15:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782161165] [2025-01-09 22:15:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:34,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:15:34,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:34,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:15:34,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:34,463 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:34,487 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2025-01-09 22:15:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:15:34,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:15:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:34,488 INFO L225 Difference]: With dead ends: 17 [2025-01-09 22:15:34,488 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 22:15:34,488 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-01-09 22:15:34,489 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:34,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:34,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 22:15:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 22:15:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 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-01-09 22:15:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2025-01-09 22:15:34,491 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 13 [2025-01-09 22:15:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:34,491 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2025-01-09 22:15:34,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2025-01-09 22:15:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:15:34,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:34,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:34,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:15:34,492 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:15:34,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash 194879730, now seen corresponding path program 1 times [2025-01-09 22:15:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342895453] [2025-01-09 22:15:34,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:34,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:15:34,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:15:34,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:34,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:34,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:34,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342895453] [2025-01-09 22:15:34,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342895453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:34,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:34,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:15:34,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087300608] [2025-01-09 22:15:34,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:34,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:15:34,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:34,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:15:34,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:15:34,834 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-01-09 22:15:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:34,878 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2025-01-09 22:15:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:15:34,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-01-09 22:15:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:34,879 INFO L225 Difference]: With dead ends: 11 [2025-01-09 22:15:34,879 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 22:15:34,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:15:34,880 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:34,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 22:15:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 22:15:34,881 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-01-09 22:15:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 22:15:34,881 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-01-09 22:15:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:34,881 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 22:15:34,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-01-09 22:15:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 22:15:34,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 22:15:34,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2025-01-09 22:15:34,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-01-09 22:15:34,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-01-09 22:15:34,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-01-09 22:15:34,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-01-09 22:15:34,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-01-09 22:15:34,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-01-09 22:15:34,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2025-01-09 22:15:34,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-01-09 22:15:34,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-01-09 22:15:34,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-01-09 22:15:34,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-01-09 22:15:34,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (1 of 14 remaining) [2025-01-09 22:15:34,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2025-01-09 22:15:34,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:15:34,888 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:34,890 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:15:34,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:15:34 BoogieIcfgContainer [2025-01-09 22:15:34,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:15:34,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:15:34,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:15:34,894 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:15:34,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:31" (3/4) ... [2025-01-09 22:15:34,898 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 22:15:34,907 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 22:15:34,908 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 22:15:34,908 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 22:15:34,908 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 22:15:34,976 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:15:34,976 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:15:34,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:15:34,977 INFO L158 Benchmark]: Toolchain (without parser) took 4000.74ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.9MB in the beginning and 84.1MB in the end (delta: 27.8MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2025-01-09 22:15:34,978 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:15:34,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.75ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 100.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:15:34,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.27ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.9MB in the end (delta: 913.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:15:34,979 INFO L158 Benchmark]: Boogie Preprocessor took 51.65ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 97.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:15:34,979 INFO L158 Benchmark]: RCFGBuilder took 328.50ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 84.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:15:34,979 INFO L158 Benchmark]: TraceAbstraction took 3302.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 84.3MB in the beginning and 89.6MB in the end (delta: -5.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-01-09 22:15:34,980 INFO L158 Benchmark]: Witness Printer took 82.33ms. Allocated memory is still 176.2MB. Free memory was 89.6MB in the beginning and 84.1MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:15:34,981 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.36ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.75ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 100.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.27ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.9MB in the end (delta: 913.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.65ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 97.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 328.50ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 84.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3302.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 84.3MB in the beginning and 89.6MB in the end (delta: -5.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Witness Printer took 82.33ms. Allocated memory is still 176.2MB. Free memory was 89.6MB in the beginning and 84.1MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 38]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 400 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 371 IncrementalHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 167 mSDtfsCounter, 371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 1109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 22:15:35,003 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