./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/nested_structure-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-regression/nested_structure-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 8760dfb1fc705c9d4bd3086e926410b9e088fc0950cc71e69ebbf3367b49d459 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:45:07,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:45:07,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:45:07,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:45:07,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:45:07,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:45:07,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:45:07,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:45:07,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:45:07,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:45:07,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:45:07,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:45:07,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:45:07,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:45:07,609 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:45:07,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:45:07,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:45:07,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:45:07,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:45:07,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:45:07,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:45:07,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:45:07,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:45:07,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:45:07,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:45:07,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:45:07,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:45:07,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:45:07,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:45:07,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:45:07,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:45:07,612 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/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 -> 8760dfb1fc705c9d4bd3086e926410b9e088fc0950cc71e69ebbf3367b49d459 [2025-03-08 22:45:07,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:45:07,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:45:07,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:45:07,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:45:07,846 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:45:07,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/nested_structure-1.i [2025-03-08 22:45:08,959 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8bf41e29/870976e0d9564a5496ca8c5903622f74/FLAGe69937090 [2025-03-08 22:45:09,152 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:45:09,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/nested_structure-1.i [2025-03-08 22:45:09,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8bf41e29/870976e0d9564a5496ca8c5903622f74/FLAGe69937090 [2025-03-08 22:45:09,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8bf41e29/870976e0d9564a5496ca8c5903622f74 [2025-03-08 22:45:09,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:45:09,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:45:09,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:45:09,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:45:09,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:45:09,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea24f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09, skipping insertion in model container [2025-03-08 22:45:09,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:45:09,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:45:09,299 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:45:09,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:45:09,321 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:45:09,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09 WrapperNode [2025-03-08 22:45:09,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:45:09,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:45:09,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:45:09,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:45:09,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,344 INFO L138 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2025-03-08 22:45:09,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:45:09,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:45:09,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:45:09,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:45:09,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,362 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-03-08 22:45:09,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:45:09,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:45:09,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:45:09,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:45:09,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (1/1) ... [2025-03-08 22:45:09,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:45:09,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:09,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:45:09,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:45:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:45:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 22:45:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:45:09,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:45:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:45:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:45:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:45:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 22:45:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:45:09,484 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:45:09,485 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:45:09,608 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#im~0#1.base, main_~#im~0#1.offset);havoc main_~#im~0#1.base, main_~#im~0#1.offset;call ULTIMATE.dealloc(main_~#inner~0#1.base, main_~#inner~0#1.offset);havoc main_~#inner~0#1.base, main_~#inner~0#1.offset;call ULTIMATE.dealloc(main_~#good~0#1.base, main_~#good~0#1.offset);havoc main_~#good~0#1.base, main_~#good~0#1.offset; [2025-03-08 22:45:09,620 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-08 22:45:09,620 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:45:09,631 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:45:09,632 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:45:09,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:45:09 BoogieIcfgContainer [2025-03-08 22:45:09,632 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:45:09,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:45:09,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:45:09,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:45:09,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:45:09" (1/3) ... [2025-03-08 22:45:09,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d13ff75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:45:09, skipping insertion in model container [2025-03-08 22:45:09,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:09" (2/3) ... [2025-03-08 22:45:09,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d13ff75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:45:09, skipping insertion in model container [2025-03-08 22:45:09,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:45:09" (3/3) ... [2025-03-08 22:45:09,641 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_structure-1.i [2025-03-08 22:45:09,652 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:45:09,654 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_structure-1.i that has 1 procedures, 32 locations, 1 initial locations, 0 loop locations, and 14 error locations. [2025-03-08 22:45:09,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:45:09,689 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;@2082a32d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:45:09,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-08 22:45:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:45:09,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:09,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:45:09,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:09,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash 61533, now seen corresponding path program 1 times [2025-03-08 22:45:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:09,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678977956] [2025-03-08 22:45:09,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:09,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:45:09,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:45:09,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:09,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:09,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:09,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678977956] [2025-03-08 22:45:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678977956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:09,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:09,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:45:09,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475720579] [2025-03-08 22:45:09,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:09,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:45:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:09,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:45:09,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:09,889 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-03-08 22:45:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:09,920 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2025-03-08 22:45:09,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:45:09,922 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-03-08 22:45:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:09,926 INFO L225 Difference]: With dead ends: 28 [2025-03-08 22:45:09,926 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 22:45:09,927 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-03-08 22:45:09,928 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 15 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-03-08 22:45:09,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 15 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 22:45:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 22:45:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.7857142857142858) 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-03-08 22:45:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2025-03-08 22:45:09,955 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 3 [2025-03-08 22:45:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:09,955 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2025-03-08 22:45:09,955 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-03-08 22:45:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2025-03-08 22:45:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:45:09,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:09,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:45:09,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:45:09,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash 61534, now seen corresponding path program 1 times [2025-03-08 22:45:09,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:09,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618203417] [2025-03-08 22:45:09,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:09,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:09,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:45:09,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:45:09,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:09,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:10,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618203417] [2025-03-08 22:45:10,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618203417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:10,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:45:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609344429] [2025-03-08 22:45:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:10,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:45:10,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:10,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:45:10,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:10,057 INFO L87 Difference]: Start difference. First operand 26 states and 25 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-03-08 22:45:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:10,074 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2025-03-08 22:45:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:45:10,074 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-03-08 22:45:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:10,075 INFO L225 Difference]: With dead ends: 24 [2025-03-08 22:45:10,075 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 22:45:10,075 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-03-08 22:45:10,075 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 24 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-03-08 22:45:10,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 24 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 22:45:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 22:45:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.6428571428571428) 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-03-08 22:45:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2025-03-08 22:45:10,077 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 3 [2025-03-08 22:45:10,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:10,077 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2025-03-08 22:45:10,077 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-03-08 22:45:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2025-03-08 22:45:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:45:10,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:10,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:45:10,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:45:10,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:10,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:10,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1907518, now seen corresponding path program 1 times [2025-03-08 22:45:10,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:10,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707829060] [2025-03-08 22:45:10,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:10,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:45:10,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:45:10,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:10,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707829060] [2025-03-08 22:45:10,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707829060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:10,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:10,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:45:10,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132970718] [2025-03-08 22:45:10,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:10,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:45:10,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:10,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:45:10,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:45:10,190 INFO L87 Difference]: Start difference. First operand 24 states and 23 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-03-08 22:45:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:10,235 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2025-03-08 22:45:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:45:10,235 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-03-08 22:45:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:10,236 INFO L225 Difference]: With dead ends: 23 [2025-03-08 22:45:10,236 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 22:45:10,236 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-03-08 22:45:10,236 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:10,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 22:45:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 22:45:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.5714285714285714) 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-03-08 22:45:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2025-03-08 22:45:10,238 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 4 [2025-03-08 22:45:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:10,239 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2025-03-08 22:45:10,239 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-03-08 22:45:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2025-03-08 22:45:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:45:10,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:10,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:45:10,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:45:10,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:10,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1907519, now seen corresponding path program 1 times [2025-03-08 22:45:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:10,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-03-08 22:45:10,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:10,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:45:10,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:45:10,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:10,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-03-08 22:45:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121463183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:10,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:10,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:45:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449846860] [2025-03-08 22:45:10,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:10,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:45:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:10,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:45:10,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:45:10,389 INFO L87 Difference]: Start difference. First operand 23 states and 22 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-03-08 22:45:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:10,428 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2025-03-08 22:45:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:45:10,429 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-03-08 22:45:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:10,429 INFO L225 Difference]: With dead ends: 22 [2025-03-08 22:45:10,430 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 22:45:10,430 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-03-08 22:45:10,430 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 32 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-03-08 22:45:10,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 32 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 22:45:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 22:45:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.5) 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-03-08 22:45:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2025-03-08 22:45:10,434 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 4 [2025-03-08 22:45:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:10,434 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2025-03-08 22:45:10,434 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-03-08 22:45:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2025-03-08 22:45:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:45:10,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:10,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:45:10,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:45:10,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:10,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash 59133050, now seen corresponding path program 1 times [2025-03-08 22:45:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:10,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529236694] [2025-03-08 22:45:10,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:10,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:10,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:45:10,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:45:10,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:10,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:10,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:10,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529236694] [2025-03-08 22:45:10,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529236694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:10,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:10,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:45:10,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535931203] [2025-03-08 22:45:10,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:10,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:45:10,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:10,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:45:10,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:45:10,605 INFO L87 Difference]: Start difference. First operand 22 states and 21 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-03-08 22:45:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:10,670 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2025-03-08 22:45:10,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:45:10,670 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-03-08 22:45:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:10,671 INFO L225 Difference]: With dead ends: 21 [2025-03-08 22:45:10,671 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 22:45:10,671 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-03-08 22:45:10,671 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 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-03-08 22:45:10,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 22:45:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-08 22:45:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) 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-03-08 22:45:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2025-03-08 22:45:10,673 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 5 [2025-03-08 22:45:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:10,673 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2025-03-08 22:45:10,673 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-03-08 22:45:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2025-03-08 22:45:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:45:10,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:10,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:45:10,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:45:10,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:10,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash 59133051, now seen corresponding path program 1 times [2025-03-08 22:45:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:10,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103104972] [2025-03-08 22:45:10,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:10,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:45:10,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:45:10,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:10,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:10,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:10,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103104972] [2025-03-08 22:45:10,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103104972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:10,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:10,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:45:10,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547580088] [2025-03-08 22:45:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:10,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:45:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:10,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:45:10,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:45:10,875 INFO L87 Difference]: Start difference. First operand 21 states and 20 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-03-08 22:45:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:10,930 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2025-03-08 22:45:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:45:10,931 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-03-08 22:45:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:10,931 INFO L225 Difference]: With dead ends: 20 [2025-03-08 22:45:10,931 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 22:45:10,932 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-03-08 22:45:10,932 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 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-03-08 22:45:10,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 22:45:10,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 22:45:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.3571428571428572) 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-03-08 22:45:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2025-03-08 22:45:10,936 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 5 [2025-03-08 22:45:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:10,936 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2025-03-08 22:45:10,936 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-03-08 22:45:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2025-03-08 22:45:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:45:10,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:10,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:10,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:45:10,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:10,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:10,938 INFO L85 PathProgramCache]: Analyzing trace with hash 696092154, now seen corresponding path program 1 times [2025-03-08 22:45:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:10,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991424929] [2025-03-08 22:45:10,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:10,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:10,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:45:10,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:45:10,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:10,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991424929] [2025-03-08 22:45:10,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991424929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:10,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:10,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:45:10,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963213331] [2025-03-08 22:45:10,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:10,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:45:10,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:10,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:45:10,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:45:10,976 INFO L87 Difference]: Start difference. First operand 20 states and 19 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-03-08 22:45:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:11,006 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2025-03-08 22:45:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:45:11,007 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-03-08 22:45:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:11,007 INFO L225 Difference]: With dead ends: 19 [2025-03-08 22:45:11,007 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 22:45:11,007 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-03-08 22:45:11,007 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 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-03-08 22:45:11,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 22:45:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-08 22:45:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) 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-03-08 22:45:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2025-03-08 22:45:11,009 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 8 [2025-03-08 22:45:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:11,009 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2025-03-08 22:45:11,009 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-03-08 22:45:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2025-03-08 22:45:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:45:11,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:11,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:11,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:45:11,009 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:11,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:11,011 INFO L85 PathProgramCache]: Analyzing trace with hash 696092155, now seen corresponding path program 1 times [2025-03-08 22:45:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:11,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068500324] [2025-03-08 22:45:11,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:11,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:45:11,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:45:11,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:11,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:11,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068500324] [2025-03-08 22:45:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068500324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:11,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:45:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792182119] [2025-03-08 22:45:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:11,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:45:11,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:11,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:45:11,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:45:11,115 INFO L87 Difference]: Start difference. First operand 19 states and 18 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-03-08 22:45:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:11,154 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2025-03-08 22:45:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:45:11,154 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-03-08 22:45:11,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:11,154 INFO L225 Difference]: With dead ends: 18 [2025-03-08 22:45:11,154 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 22:45:11,154 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-03-08 22:45:11,155 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:11,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:11,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 22:45:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-08 22:45:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) 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-03-08 22:45:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2025-03-08 22:45:11,156 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 8 [2025-03-08 22:45:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:11,156 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2025-03-08 22:45:11,156 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-03-08 22:45:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2025-03-08 22:45:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:45:11,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:11,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:11,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:45:11,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:11,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash 104020276, now seen corresponding path program 1 times [2025-03-08 22:45:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:11,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834907270] [2025-03-08 22:45:11,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:11,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:11,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:45:11,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:45:11,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:11,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:11,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:11,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834907270] [2025-03-08 22:45:11,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834907270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:45:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380908483] [2025-03-08 22:45:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:11,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:45:11,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:11,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:45:11,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:45:11,356 INFO L87 Difference]: Start difference. First operand 18 states and 17 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-03-08 22:45:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:11,415 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2025-03-08 22:45:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:45:11,415 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-03-08 22:45:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:11,415 INFO L225 Difference]: With dead ends: 17 [2025-03-08 22:45:11,415 INFO L226 Difference]: Without dead ends: 17 [2025-03-08 22:45:11,415 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-03-08 22:45:11,416 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:11,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-08 22:45:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-08 22:45:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2025-03-08 22:45:11,417 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 9 [2025-03-08 22:45:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:11,417 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2025-03-08 22:45:11,417 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-03-08 22:45:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2025-03-08 22:45:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:45:11,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:11,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:11,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:45:11,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:11,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash 104020277, now seen corresponding path program 1 times [2025-03-08 22:45:11,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:11,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712239404] [2025-03-08 22:45:11,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:11,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:11,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:45:11,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:45:11,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:11,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:11,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:11,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712239404] [2025-03-08 22:45:11,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712239404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:11,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:45:11,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985356097] [2025-03-08 22:45:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:11,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:45:11,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:11,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:45:11,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:45:11,614 INFO L87 Difference]: Start difference. First operand 17 states and 16 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-03-08 22:45:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:11,663 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2025-03-08 22:45:11,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:45:11,664 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-03-08 22:45:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:11,664 INFO L225 Difference]: With dead ends: 16 [2025-03-08 22:45:11,664 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 22:45:11,664 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-03-08 22:45:11,665 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:11,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 22:45:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-08 22:45:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2025-03-08 22:45:11,666 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 9 [2025-03-08 22:45:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:11,666 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2025-03-08 22:45:11,666 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-03-08 22:45:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2025-03-08 22:45:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:45:11,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:11,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:11,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:45:11,667 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:11,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:11,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2098365290, now seen corresponding path program 1 times [2025-03-08 22:45:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:11,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893582890] [2025-03-08 22:45:11,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:11,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:45:11,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:45:11,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:11,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:11,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:11,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893582890] [2025-03-08 22:45:11,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893582890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:11,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:11,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:45:11,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796959491] [2025-03-08 22:45:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:11,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:45:11,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:11,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:45:11,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:45:11,874 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:11,901 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2025-03-08 22:45:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:45:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 22:45:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:11,901 INFO L225 Difference]: With dead ends: 13 [2025-03-08 22:45:11,901 INFO L226 Difference]: Without dead ends: 13 [2025-03-08 22:45:11,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:45:11,902 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:11,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-08 22:45:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-08 22:45:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2025-03-08 22:45:11,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 12 [2025-03-08 22:45:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:11,903 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2025-03-08 22:45:11,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2025-03-08 22:45:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:45:11,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:11,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:11,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:45:11,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-08 22:45:11,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:11,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2098364491, now seen corresponding path program 1 times [2025-03-08 22:45:11,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:11,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620561856] [2025-03-08 22:45:11,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:11,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:11,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:45:11,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:45:11,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:11,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:12,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:12,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620561856] [2025-03-08 22:45:12,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620561856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:12,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:12,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:45:12,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188849635] [2025-03-08 22:45:12,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:12,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:45:12,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:12,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:45:12,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:45:12,032 INFO L87 Difference]: Start difference. First operand 13 states and 12 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:12,048 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2025-03-08 22:45:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:45:12,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 22:45:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:12,049 INFO L225 Difference]: With dead ends: 12 [2025-03-08 22:45:12,049 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 22:45:12,049 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-03-08 22:45:12,049 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 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-03-08 22:45:12,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 22:45:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 22:45:12,050 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-03-08 22:45:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 22:45:12,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2025-03-08 22:45:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:12,063 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 22:45:12,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-03-08 22:45:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 22:45:12,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (12 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-03-08 22:45:12,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-03-08 22:45:12,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:45:12,068 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:12,071 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:45:12,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:45:12 BoogieIcfgContainer [2025-03-08 22:45:12,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:45:12,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:45:12,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:45:12,075 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:45:12,076 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:45:09" (3/4) ... [2025-03-08 22:45:12,077 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:45:12,083 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 22:45:12,083 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 22:45:12,084 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:45:12,084 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:45:12,137 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:45:12,138 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:45:12,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:45:12,139 INFO L158 Benchmark]: Toolchain (without parser) took 2964.09ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 132.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:45:12,139 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:45:12,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.10ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 122.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:45:12,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.07ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 121.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:45:12,140 INFO L158 Benchmark]: Boogie Preprocessor took 31.33ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 119.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:45:12,140 INFO L158 Benchmark]: IcfgBuilder took 254.78ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 105.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:45:12,140 INFO L158 Benchmark]: TraceAbstraction took 2440.61ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 137.4MB in the end (delta: -32.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:45:12,141 INFO L158 Benchmark]: Witness Printer took 62.90ms. Allocated memory is still 167.8MB. Free memory was 137.4MB in the beginning and 132.1MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:45:12,142 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.28ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 146.10ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 122.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.07ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 121.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.33ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 119.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 254.78ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 105.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2440.61ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 137.4MB in the end (delta: -32.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.90ms. Allocated memory is still 167.8MB. Free memory was 137.4MB in the beginning and 132.1MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 32 edges, 14 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 322 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 361 IncrementalHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 144 mSDtfsCounter, 361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 61, 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.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1128 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-03-08 22:45:12,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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