./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/duplets.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:19:00,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:19:00,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:19:00,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:19:00,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:19:00,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:19:00,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:19:00,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:19:00,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:19:00,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:19:00,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:19:00,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:19:00,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:19:00,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:19:00,175 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:19:00,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:19:00,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:19:00,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:19:00,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:19:00,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:19:00,176 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:19:00,176 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:19:00,176 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:19:00,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:19:00,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:19:00,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:19:00,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:19:00,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:19:00,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:19:00,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:19:00,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:19:00,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:19:00,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:19:00,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:19:00,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:19:00,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:19:00,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:19:00,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:19:00,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:19:00,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:19:00,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:19:00,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:19:00,178 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2025-02-08 06:19:00,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:19:00,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:19:00,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:19:00,420 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:19:00,420 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:19:00,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2025-02-08 06:19:01,608 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a4b857c1/344f297effef48019cf715909abd5d04/FLAGbe0caf630 [2025-02-08 06:19:01,818 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:19:01,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2025-02-08 06:19:01,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a4b857c1/344f297effef48019cf715909abd5d04/FLAGbe0caf630 [2025-02-08 06:19:02,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a4b857c1/344f297effef48019cf715909abd5d04 [2025-02-08 06:19:02,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:19:02,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:19:02,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:19:02,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:19:02,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:19:02,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02, skipping insertion in model container [2025-02-08 06:19:02,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:19:02,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:19:02,335 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:19:02,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:19:02,383 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:19:02,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02 WrapperNode [2025-02-08 06:19:02,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:19:02,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:19:02,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:19:02,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:19:02,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,409 INFO L138 Inliner]: procedures = 21, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 126 [2025-02-08 06:19:02,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:19:02,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:19:02,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:19:02,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:19:02,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,435 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 5, 7, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 1, 3, 1]. [2025-02-08 06:19:02,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:19:02,452 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:19:02,452 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:19:02,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:19:02,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (1/1) ... [2025-02-08 06:19:02,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:19:02,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:02,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:19:02,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:19:02,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 06:19:02,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 06:19:02,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:19:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:19:02,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:19:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:19:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:19:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:19:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 06:19:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 06:19:02,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 06:19:02,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:19:02,594 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:19:02,595 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:19:02,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: call ULTIMATE.dealloc(main_~#i~2#1.base, main_~#i~2#1.offset);havoc main_~#i~2#1.base, main_~#i~2#1.offset;call ULTIMATE.dealloc(main_~#j~2#1.base, main_~#j~2#1.offset);havoc main_~#j~2#1.base, main_~#j~2#1.offset; [2025-02-08 06:19:02,802 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-02-08 06:19:02,802 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:19:02,814 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:19:02,814 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:19:02,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:19:02 BoogieIcfgContainer [2025-02-08 06:19:02,815 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:19:02,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:19:02,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:19:02,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:19:02,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:19:02" (1/3) ... [2025-02-08 06:19:02,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6482c9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:19:02, skipping insertion in model container [2025-02-08 06:19:02,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:19:02" (2/3) ... [2025-02-08 06:19:02,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6482c9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:19:02, skipping insertion in model container [2025-02-08 06:19:02,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:19:02" (3/3) ... [2025-02-08 06:19:02,828 INFO L128 eAbstractionObserver]: Analyzing ICFG duplets.c [2025-02-08 06:19:02,838 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:19:02,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG duplets.c that has 3 procedures, 96 locations, 1 initial locations, 2 loop locations, and 37 error locations. [2025-02-08 06:19:02,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:19:02,870 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;@31f74ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:19:02,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-02-08 06:19:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 84 states have internal predecessors, (90), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:19:02,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:02,881 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:02,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:02,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash -671896111, now seen corresponding path program 1 times [2025-02-08 06:19:02,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117540381] [2025-02-08 06:19:02,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:02,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:02,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:19:02,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:19:02,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:02,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 06:19:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117540381] [2025-02-08 06:19:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117540381] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471429272] [2025-02-08 06:19:02,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:02,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:02,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:02,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:02,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:19:03,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:19:03,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:19:03,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:03,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:03,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 06:19:03,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 06:19:03,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:19:03,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471429272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:03,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:19:03,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 06:19:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990170827] [2025-02-08 06:19:03,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:03,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 06:19:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:03,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 06:19:03,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 06:19:03,086 INFO L87 Difference]: Start difference. First operand has 96 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 84 states have internal predecessors, (90), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:19:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:03,099 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2025-02-08 06:19:03,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 06:19:03,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2025-02-08 06:19:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:03,104 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:19:03,105 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:19:03,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 06:19:03,108 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:03,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:19:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 06:19:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 80 states have internal predecessors, (84), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-02-08 06:19:03,133 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 24 [2025-02-08 06:19:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-02-08 06:19:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:19:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-02-08 06:19:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:19:03,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:03,135 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:03,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:19:03,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 06:19:03,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:03,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash 851416627, now seen corresponding path program 1 times [2025-02-08 06:19:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:03,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309521336] [2025-02-08 06:19:03,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:03,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:19:03,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:19:03,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:03,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:03,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:03,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309521336] [2025-02-08 06:19:03,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309521336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:03,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:03,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:19:03,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086096615] [2025-02-08 06:19:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:03,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:19:03,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:03,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:19:03,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:03,518 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:19:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:03,585 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2025-02-08 06:19:03,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:03,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2025-02-08 06:19:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:03,586 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:19:03,586 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:19:03,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:03,588 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:03,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 152 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:19:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-08 06:19:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 78 states have internal predecessors, (82), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2025-02-08 06:19:03,596 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 24 [2025-02-08 06:19:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:03,599 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-02-08 06:19:03,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:19:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2025-02-08 06:19:03,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:19:03,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:03,601 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:03,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:19:03,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:03,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:03,603 INFO L85 PathProgramCache]: Analyzing trace with hash 851416628, now seen corresponding path program 1 times [2025-02-08 06:19:03,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:03,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289744323] [2025-02-08 06:19:03,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:03,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:03,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:19:03,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:19:03,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:03,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:19:03,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289744323] [2025-02-08 06:19:03,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289744323] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759411991] [2025-02-08 06:19:03,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:03,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:03,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:19:03,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:19:03,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:19:03,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:03,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:03,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 06:19:03,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:04,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:19:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:19:04,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:19:04,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759411991] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:04,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:04,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 16 [2025-02-08 06:19:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883233096] [2025-02-08 06:19:04,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:04,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 06:19:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:04,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 06:19:04,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:19:04,587 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-08 06:19:08,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 06:19:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:09,126 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2025-02-08 06:19:09,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:19:09,127 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) Word has length 24 [2025-02-08 06:19:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:09,128 INFO L225 Difference]: With dead ends: 125 [2025-02-08 06:19:09,130 INFO L226 Difference]: Without dead ends: 125 [2025-02-08 06:19:09,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:19:09,130 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 344 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:09,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 394 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 396 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-08 06:19:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-08 06:19:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2025-02-08 06:19:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 80 states have internal predecessors, (84), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2025-02-08 06:19:09,142 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 24 [2025-02-08 06:19:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:09,142 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2025-02-08 06:19:09,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-08 06:19:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2025-02-08 06:19:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:19:09,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:09,143 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:09,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:19:09,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:09,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:09,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash 624111716, now seen corresponding path program 1 times [2025-02-08 06:19:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:09,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379437405] [2025-02-08 06:19:09,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:09,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:09,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:19:09,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:19:09,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:09,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:19:09,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:09,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379437405] [2025-02-08 06:19:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379437405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784809428] [2025-02-08 06:19:09,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:09,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:09,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:09,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:19:09,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:19:09,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:19:09,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:09,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:09,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:19:09,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:09,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-02-08 06:19:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:19:10,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:19:10,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784809428] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:10,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:10,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 20 [2025-02-08 06:19:10,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980399104] [2025-02-08 06:19:10,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:10,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:19:10,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:10,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:19:10,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:19:10,599 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-08 06:19:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:11,172 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2025-02-08 06:19:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:19:11,173 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 25 [2025-02-08 06:19:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:11,174 INFO L225 Difference]: With dead ends: 124 [2025-02-08 06:19:11,174 INFO L226 Difference]: Without dead ends: 124 [2025-02-08 06:19:11,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:19:11,175 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 186 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:11,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 567 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:19:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-08 06:19:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 92. [2025-02-08 06:19:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 79 states have internal predecessors, (83), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2025-02-08 06:19:11,184 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 25 [2025-02-08 06:19:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:11,185 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2025-02-08 06:19:11,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-08 06:19:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2025-02-08 06:19:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:19:11,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:11,185 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:11,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:19:11,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:11,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:11,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:11,386 INFO L85 PathProgramCache]: Analyzing trace with hash -39376864, now seen corresponding path program 1 times [2025-02-08 06:19:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956145956] [2025-02-08 06:19:11,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:11,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:19:11,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:19:11,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:11,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:19:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956145956] [2025-02-08 06:19:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956145956] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419465313] [2025-02-08 06:19:11,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:11,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:11,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:11,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:11,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:19:11,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:19:11,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:19:11,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:11,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:11,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 06:19:11,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:11,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:11,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:11,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-02-08 06:19:12,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:12,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:19:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:12,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:19:12,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419465313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:12,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:19:12,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-02-08 06:19:12,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680248072] [2025-02-08 06:19:12,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:12,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:19:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:12,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:19:12,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:19:12,038 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:19:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:12,213 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-02-08 06:19:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:19:12,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-02-08 06:19:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:12,214 INFO L225 Difference]: With dead ends: 99 [2025-02-08 06:19:12,214 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 06:19:12,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:19:12,215 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 75 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:12,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 154 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:12,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 06:19:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-02-08 06:19:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 83 states have internal predecessors, (93), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2025-02-08 06:19:12,219 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 29 [2025-02-08 06:19:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:12,219 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2025-02-08 06:19:12,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:19:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2025-02-08 06:19:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:19:12,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:12,219 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:12,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:19:12,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:12,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:12,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash -39376865, now seen corresponding path program 1 times [2025-02-08 06:19:12,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:12,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917822864] [2025-02-08 06:19:12,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:12,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:12,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:19:12,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:19:12,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:12,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:12,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917822864] [2025-02-08 06:19:12,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917822864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:12,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:12,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:19:12,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601647517] [2025-02-08 06:19:12,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:12,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:19:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:12,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:19:12,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:19:12,526 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:19:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:12,614 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2025-02-08 06:19:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:19:12,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-02-08 06:19:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:12,614 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:19:12,614 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 06:19:12,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:19:12,615 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 65 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:12,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 130 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 06:19:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 06:19:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 78 states have internal predecessors, (86), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2025-02-08 06:19:12,620 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 29 [2025-02-08 06:19:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:12,620 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2025-02-08 06:19:12,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:19:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2025-02-08 06:19:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:19:12,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:12,621 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:12,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:19:12,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:12,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1220682769, now seen corresponding path program 1 times [2025-02-08 06:19:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013380801] [2025-02-08 06:19:12,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:12,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:12,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:19:12,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:19:12,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:12,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:19:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013380801] [2025-02-08 06:19:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013380801] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129396808] [2025-02-08 06:19:13,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:13,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:13,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:13,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:13,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:19:13,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:19:13,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:19:13,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:13,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:13,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 06:19:13,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:13,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:13,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:19:13,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:13,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:13,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-02-08 06:19:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:19:13,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:13,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:19:13,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 91 [2025-02-08 06:19:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:19:14,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129396808] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:14,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:14,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-02-08 06:19:14,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191980674] [2025-02-08 06:19:14,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:14,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 06:19:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:14,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 06:19:14,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-02-08 06:19:14,016 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 26 states, 20 states have (on average 1.8) internal successors, (36), 23 states have internal predecessors, (36), 7 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-08 06:19:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:14,883 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2025-02-08 06:19:14,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:19:14,883 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 1.8) internal successors, (36), 23 states have internal predecessors, (36), 7 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 30 [2025-02-08 06:19:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:14,884 INFO L225 Difference]: With dead ends: 132 [2025-02-08 06:19:14,884 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 06:19:14,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2025-02-08 06:19:14,885 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 363 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:14,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 579 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:19:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 06:19:14,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 94. [2025-02-08 06:19:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 81 states have internal predecessors, (90), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2025-02-08 06:19:14,889 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 30 [2025-02-08 06:19:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:14,889 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2025-02-08 06:19:14,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 1.8) internal successors, (36), 23 states have internal predecessors, (36), 7 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-08 06:19:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2025-02-08 06:19:14,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:19:14,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:14,890 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:14,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:19:15,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:15,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:15,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 795093281, now seen corresponding path program 1 times [2025-02-08 06:19:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:15,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192980331] [2025-02-08 06:19:15,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:15,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:15,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:19:15,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:19:15,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:15,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:19:15,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:15,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192980331] [2025-02-08 06:19:15,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192980331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:15,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274927039] [2025-02-08 06:19:15,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:15,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:15,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:15,323 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:15,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:19:15,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:19:15,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:19:15,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:15,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:15,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 06:19:15,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:19:15,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:19:15,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274927039] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:15,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:15,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-02-08 06:19:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211483524] [2025-02-08 06:19:15,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:15,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 06:19:15,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:15,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 06:19:15,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:19:15,572 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 17 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-08 06:19:15,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:15,760 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2025-02-08 06:19:15,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:19:15,760 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) Word has length 31 [2025-02-08 06:19:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:15,761 INFO L225 Difference]: With dead ends: 126 [2025-02-08 06:19:15,761 INFO L226 Difference]: Without dead ends: 126 [2025-02-08 06:19:15,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:19:15,762 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 230 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:15,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 717 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-08 06:19:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 94. [2025-02-08 06:19:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 81 states have internal predecessors, (89), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2025-02-08 06:19:15,769 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 31 [2025-02-08 06:19:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:15,770 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2025-02-08 06:19:15,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-08 06:19:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2025-02-08 06:19:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:19:15,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:15,770 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:15,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:19:15,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 06:19:15,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:15,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 812977844, now seen corresponding path program 1 times [2025-02-08 06:19:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:15,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687963097] [2025-02-08 06:19:15,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:15,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:15,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:19:15,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:19:15,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:15,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:16,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:16,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687963097] [2025-02-08 06:19:16,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687963097] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:16,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778711864] [2025-02-08 06:19:16,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:16,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:16,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:16,030 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:16,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:19:16,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:19:16,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:19:16,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:16,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:16,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:19:16,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:16,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:19:16,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778711864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:16,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:19:16,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-02-08 06:19:16,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641316923] [2025-02-08 06:19:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:16,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:19:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:16,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:19:16,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:19:16,097 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:16,145 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2025-02-08 06:19:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:19:16,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2025-02-08 06:19:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:16,146 INFO L225 Difference]: With dead ends: 103 [2025-02-08 06:19:16,147 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 06:19:16,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:19:16,148 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 6 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:16,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 247 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 06:19:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2025-02-08 06:19:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 83 states have internal predecessors, (92), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2025-02-08 06:19:16,155 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 31 [2025-02-08 06:19:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:16,155 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2025-02-08 06:19:16,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2025-02-08 06:19:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:19:16,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:16,156 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:16,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 06:19:16,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:16,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:16,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:16,357 INFO L85 PathProgramCache]: Analyzing trace with hash -550068821, now seen corresponding path program 1 times [2025-02-08 06:19:16,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:16,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062022740] [2025-02-08 06:19:16,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:16,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:16,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:19:16,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:19:16,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:16,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:16,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:16,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062022740] [2025-02-08 06:19:16,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062022740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:16,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:16,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:19:16,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973249370] [2025-02-08 06:19:16,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:16,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:19:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:16,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:19:16,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:16,416 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:16,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:16,479 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2025-02-08 06:19:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:16,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2025-02-08 06:19:16,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:16,480 INFO L225 Difference]: With dead ends: 95 [2025-02-08 06:19:16,480 INFO L226 Difference]: Without dead ends: 95 [2025-02-08 06:19:16,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:16,482 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:16,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 140 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-08 06:19:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-08 06:19:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 82 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-02-08 06:19:16,487 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 32 [2025-02-08 06:19:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:16,487 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-02-08 06:19:16,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-02-08 06:19:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:19:16,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:16,488 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:16,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:19:16,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:16,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash -550068820, now seen corresponding path program 1 times [2025-02-08 06:19:16,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:16,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883090942] [2025-02-08 06:19:16,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:16,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:19:16,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:19:16,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:16,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:16,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:16,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883090942] [2025-02-08 06:19:16,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883090942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:16,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:16,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:19:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13398646] [2025-02-08 06:19:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:16,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:19:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:16,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:19:16,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:16,592 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:16,651 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2025-02-08 06:19:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2025-02-08 06:19:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:16,652 INFO L225 Difference]: With dead ends: 94 [2025-02-08 06:19:16,652 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 06:19:16,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:16,652 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:16,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 138 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 06:19:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-08 06:19:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 81 states have internal predecessors, (90), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2025-02-08 06:19:16,655 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 32 [2025-02-08 06:19:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:16,655 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2025-02-08 06:19:16,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2025-02-08 06:19:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:19:16,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:16,656 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:16,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:19:16,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:16,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -430785867, now seen corresponding path program 1 times [2025-02-08 06:19:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687802690] [2025-02-08 06:19:16,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:16,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:19:16,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:19:16,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:16,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:19:16,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:16,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687802690] [2025-02-08 06:19:16,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687802690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:16,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:16,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 06:19:16,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376097243] [2025-02-08 06:19:16,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:16,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:19:16,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:16,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:19:16,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:19:16,995 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:19:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:17,300 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2025-02-08 06:19:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:19:17,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2025-02-08 06:19:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:17,301 INFO L225 Difference]: With dead ends: 124 [2025-02-08 06:19:17,301 INFO L226 Difference]: Without dead ends: 124 [2025-02-08 06:19:17,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:19:17,301 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 82 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:17,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 549 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:19:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-08 06:19:17,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2025-02-08 06:19:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 81 states have internal predecessors, (89), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2025-02-08 06:19:17,307 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 33 [2025-02-08 06:19:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:17,307 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2025-02-08 06:19:17,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:19:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2025-02-08 06:19:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:19:17,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:17,307 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:17,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:19:17,308 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:17,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:17,308 INFO L85 PathProgramCache]: Analyzing trace with hash 127735769, now seen corresponding path program 1 times [2025-02-08 06:19:17,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:17,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512271370] [2025-02-08 06:19:17,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:17,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:17,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:19:17,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:19:17,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:17,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:17,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512271370] [2025-02-08 06:19:17,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512271370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:17,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:17,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:19:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187144602] [2025-02-08 06:19:17,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:17,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:19:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:17,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:19:17,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:17,350 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:17,382 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2025-02-08 06:19:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:17,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2025-02-08 06:19:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:17,383 INFO L225 Difference]: With dead ends: 93 [2025-02-08 06:19:17,383 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 06:19:17,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:17,384 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:17,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 06:19:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-08 06:19:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.543859649122807) internal successors, (88), 80 states have internal predecessors, (88), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2025-02-08 06:19:17,387 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 33 [2025-02-08 06:19:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:17,387 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2025-02-08 06:19:17,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2025-02-08 06:19:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:19:17,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:17,388 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:17,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:19:17,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:17,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash 127735770, now seen corresponding path program 1 times [2025-02-08 06:19:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:17,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292245851] [2025-02-08 06:19:17,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:17,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:17,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:19:17,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:19:17,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:17,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:17,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292245851] [2025-02-08 06:19:17,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292245851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:19:17,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:19:17,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:19:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048145594] [2025-02-08 06:19:17,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:19:17,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:19:17,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:17,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:19:17,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:17,450 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:17,477 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2025-02-08 06:19:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:19:17,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2025-02-08 06:19:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:17,478 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:19:17,478 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:19:17,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:19:17,479 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:17,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 135 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:19:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-08 06:19:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 77 states have internal predecessors, (84), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2025-02-08 06:19:17,482 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 33 [2025-02-08 06:19:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:17,482 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2025-02-08 06:19:17,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2025-02-08 06:19:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 06:19:17,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:17,483 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:17,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:19:17,483 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:17,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash -335086925, now seen corresponding path program 1 times [2025-02-08 06:19:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:17,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849027466] [2025-02-08 06:19:17,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:17,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:17,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:19:17,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:19:17,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:17,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:19:17,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:17,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849027466] [2025-02-08 06:19:17,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849027466] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:17,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532969045] [2025-02-08 06:19:17,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:17,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:17,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:17,859 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:17,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:19:17,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:19:17,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:19:17,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:17,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:17,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 06:19:17,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:17,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-02-08 06:19:18,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:19:18,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:18,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-02-08 06:19:18,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:18,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:18,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:18,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:18,676 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:19:18,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 64 [2025-02-08 06:19:18,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:18,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:18,720 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:19:18,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 64 [2025-02-08 06:19:19,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:19,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:19:19,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 42 [2025-02-08 06:19:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:19:19,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:19,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:19:19,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 409 treesize of output 369 [2025-02-08 06:19:20,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532969045] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:20,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:19:20,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2025-02-08 06:19:20,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12094459] [2025-02-08 06:19:20,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:20,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 06:19:20,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:20,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 06:19:20,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 06:19:20,378 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 06:19:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:22,655 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2025-02-08 06:19:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:19:22,656 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 34 [2025-02-08 06:19:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:22,657 INFO L225 Difference]: With dead ends: 127 [2025-02-08 06:19:22,657 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 06:19:22,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 06:19:22,657 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 248 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:22,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 433 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 06:19:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 06:19:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2025-02-08 06:19:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.5) internal successors, (84), 78 states have internal predecessors, (84), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-02-08 06:19:22,660 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 34 [2025-02-08 06:19:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:22,660 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-02-08 06:19:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 06:19:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-02-08 06:19:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:19:22,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:22,661 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:22,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 06:19:22,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 06:19:22,865 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:22,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:22,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1798322064, now seen corresponding path program 1 times [2025-02-08 06:19:22,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:22,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352661007] [2025-02-08 06:19:22,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:22,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:22,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:19:22,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:19:22,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:22,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:22,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:22,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352661007] [2025-02-08 06:19:22,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352661007] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:22,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376175175] [2025-02-08 06:19:22,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:22,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:22,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:22,924 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:22,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:19:22,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:19:22,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:19:22,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:22,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:22,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 06:19:22,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:22,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:23,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376175175] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:23,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:23,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-08 06:19:23,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231128129] [2025-02-08 06:19:23,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:23,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:19:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:23,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:19:23,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:19:23,027 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:23,059 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2025-02-08 06:19:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:19:23,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-02-08 06:19:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:23,060 INFO L225 Difference]: With dead ends: 108 [2025-02-08 06:19:23,060 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 06:19:23,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:19:23,061 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:23,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 306 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 06:19:23,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2025-02-08 06:19:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.5) internal successors, (99), 88 states have internal predecessors, (99), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2025-02-08 06:19:23,063 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 35 [2025-02-08 06:19:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:23,063 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2025-02-08 06:19:23,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2025-02-08 06:19:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:19:23,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:23,066 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:23,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:19:23,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:23,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:23,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1629096591, now seen corresponding path program 1 times [2025-02-08 06:19:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:23,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207864207] [2025-02-08 06:19:23,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:23,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:19:23,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:19:23,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:23,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:23,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207864207] [2025-02-08 06:19:23,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207864207] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:23,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834279242] [2025-02-08 06:19:23,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:23,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:23,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:23,313 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:23,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:19:23,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:19:23,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:19:23,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:23,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:23,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:19:23,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:23,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834279242] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:23,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:23,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-08 06:19:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023752551] [2025-02-08 06:19:23,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:23,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:19:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:23,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:19:23,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:19:23,422 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:23,451 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-02-08 06:19:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:19:23,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-02-08 06:19:23,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:23,452 INFO L225 Difference]: With dead ends: 102 [2025-02-08 06:19:23,452 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 06:19:23,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:19:23,453 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:23,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 307 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:19:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 06:19:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-08 06:19:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 88 states have internal predecessors, (97), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-02-08 06:19:23,456 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 37 [2025-02-08 06:19:23,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:23,456 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-02-08 06:19:23,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-02-08 06:19:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:19:23,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:23,457 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:23,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 06:19:23,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 06:19:23,659 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2089988869, now seen corresponding path program 2 times [2025-02-08 06:19:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392552656] [2025-02-08 06:19:23,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:19:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:23,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 06:19:23,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:19:23,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:19:23,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 06:19:24,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392552656] [2025-02-08 06:19:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392552656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592253610] [2025-02-08 06:19:24,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:19:24,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:24,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:24,543 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:24,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:19:24,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 06:19:24,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:19:24,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:19:24,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:24,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-08 06:19:24,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:24,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 06:19:24,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:24,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2025-02-08 06:19:25,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:19:25,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:19:25,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 46 [2025-02-08 06:19:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:19:25,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:25,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:19:25,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 503 treesize of output 435 [2025-02-08 06:19:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:19:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592253610] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:27,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:27,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 42 [2025-02-08 06:19:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69443854] [2025-02-08 06:19:27,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:27,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 06:19:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:27,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 06:19:27,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1578, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 06:19:27,418 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 42 states, 34 states have (on average 1.588235294117647) internal successors, (54), 37 states have internal predecessors, (54), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-08 06:19:32,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 06:19:37,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 06:19:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:42,446 INFO L93 Difference]: Finished difference Result 148 states and 176 transitions. [2025-02-08 06:19:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:19:42,447 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.588235294117647) internal successors, (54), 37 states have internal predecessors, (54), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 39 [2025-02-08 06:19:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:42,448 INFO L225 Difference]: With dead ends: 148 [2025-02-08 06:19:42,448 INFO L226 Difference]: Without dead ends: 147 [2025-02-08 06:19:42,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=375, Invalid=2815, Unknown=2, NotChecked=0, Total=3192 [2025-02-08 06:19:42,449 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 235 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:42,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1434 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 952 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2025-02-08 06:19:42,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-08 06:19:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 104. [2025-02-08 06:19:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 90 states have internal predecessors, (98), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2025-02-08 06:19:42,452 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 39 [2025-02-08 06:19:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:42,452 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2025-02-08 06:19:42,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.588235294117647) internal successors, (54), 37 states have internal predecessors, (54), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-08 06:19:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2025-02-08 06:19:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:19:42,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:42,453 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:42,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 06:19:42,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 06:19:42,657 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:42,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1971274796, now seen corresponding path program 2 times [2025-02-08 06:19:42,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:42,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372185404] [2025-02-08 06:19:42,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:19:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:42,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 06:19:42,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:19:42,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:19:42,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 06:19:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372185404] [2025-02-08 06:19:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372185404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873384141] [2025-02-08 06:19:42,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:19:42,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:42,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:42,776 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:42,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:19:42,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 06:19:42,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:19:42,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:19:42,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:42,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 06:19:42,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 06:19:42,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:43,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-02-08 06:19:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 06:19:43,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873384141] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:43,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:43,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2025-02-08 06:19:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060770631] [2025-02-08 06:19:43,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:43,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:19:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:43,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:19:43,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:19:43,082 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-08 06:19:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:43,338 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2025-02-08 06:19:43,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:19:43,339 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 39 [2025-02-08 06:19:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:43,344 INFO L225 Difference]: With dead ends: 103 [2025-02-08 06:19:43,344 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 06:19:43,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:19:43,345 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 74 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:43,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 532 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:43,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 06:19:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-08 06:19:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.411764705882353) internal successors, (96), 89 states have internal predecessors, (96), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2025-02-08 06:19:43,349 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 39 [2025-02-08 06:19:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:43,349 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2025-02-08 06:19:43,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-08 06:19:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2025-02-08 06:19:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:19:43,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:43,349 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:43,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 06:19:43,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:43,554 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:43,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash 979976547, now seen corresponding path program 1 times [2025-02-08 06:19:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:43,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930512783] [2025-02-08 06:19:43,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:43,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:19:43,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:19:43,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:43,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:43,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930512783] [2025-02-08 06:19:43,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930512783] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029497643] [2025-02-08 06:19:43,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:19:43,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:43,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:43,740 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:43,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:19:43,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:19:43,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:19:43,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:19:43,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:43,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 06:19:43,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:44,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:44,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-02-08 06:19:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:44,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029497643] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:44,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:44,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-02-08 06:19:44,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625208736] [2025-02-08 06:19:44,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:44,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:19:44,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:44,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:19:44,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:19:44,257 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-08 06:19:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:44,655 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2025-02-08 06:19:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:19:44,655 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 40 [2025-02-08 06:19:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:44,656 INFO L225 Difference]: With dead ends: 107 [2025-02-08 06:19:44,657 INFO L226 Difference]: Without dead ends: 107 [2025-02-08 06:19:44,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:19:44,658 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 101 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:44,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 696 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:19:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-08 06:19:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2025-02-08 06:19:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 89 states have internal predecessors, (95), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2025-02-08 06:19:44,664 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 40 [2025-02-08 06:19:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:44,664 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2025-02-08 06:19:44,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-08 06:19:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2025-02-08 06:19:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:19:44,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:44,665 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:44,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 06:19:44,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:44,865 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:44,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2002421287, now seen corresponding path program 2 times [2025-02-08 06:19:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:44,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609751383] [2025-02-08 06:19:44,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:19:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:44,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 06:19:44,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:19:44,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:19:44,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:44,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:44,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609751383] [2025-02-08 06:19:44,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609751383] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:44,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286551785] [2025-02-08 06:19:44,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:19:44,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:44,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:44,989 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:44,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:19:45,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 06:19:45,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:19:45,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:19:45,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:45,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 06:19:45,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:45,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:19:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286551785] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:45,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-02-08 06:19:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117634663] [2025-02-08 06:19:45,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:45,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:19:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:45,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:19:45,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:19:45,184 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:45,276 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-02-08 06:19:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:19:45,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2025-02-08 06:19:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:45,277 INFO L225 Difference]: With dead ends: 125 [2025-02-08 06:19:45,277 INFO L226 Difference]: Without dead ends: 125 [2025-02-08 06:19:45,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:19:45,278 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:45,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 306 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-08 06:19:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2025-02-08 06:19:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.369047619047619) internal successors, (115), 105 states have internal predecessors, (115), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2025-02-08 06:19:45,283 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 44 [2025-02-08 06:19:45,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:45,284 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2025-02-08 06:19:45,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2025-02-08 06:19:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 06:19:45,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:45,285 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:45,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:19:45,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-08 06:19:45,486 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:45,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1697350165, now seen corresponding path program 3 times [2025-02-08 06:19:45,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:45,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856203623] [2025-02-08 06:19:45,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:19:45,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:45,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 5 equivalence classes. [2025-02-08 06:19:45,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 48 statements. [2025-02-08 06:19:45,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:19:45,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-08 06:19:45,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:45,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856203623] [2025-02-08 06:19:45,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856203623] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:45,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949458797] [2025-02-08 06:19:45,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:19:45,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:45,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:45,572 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:45,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:19:45,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 5 equivalence classes. [2025-02-08 06:19:45,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 48 statements. [2025-02-08 06:19:45,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:19:45,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:45,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 06:19:45,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-08 06:19:45,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:19:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-08 06:19:45,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949458797] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:45,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:45,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-08 06:19:45,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122929172] [2025-02-08 06:19:45,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:45,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:19:45,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:45,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:19:45,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:19:45,820 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:46,034 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2025-02-08 06:19:46,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:19:46,036 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2025-02-08 06:19:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:46,037 INFO L225 Difference]: With dead ends: 118 [2025-02-08 06:19:46,037 INFO L226 Difference]: Without dead ends: 118 [2025-02-08 06:19:46,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:19:46,038 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 10 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:46,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 497 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:19:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-08 06:19:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-08 06:19:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 104 states have internal predecessors, (113), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:19:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2025-02-08 06:19:46,043 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 48 [2025-02-08 06:19:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:46,043 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2025-02-08 06:19:46,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:19:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2025-02-08 06:19:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:19:46,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:19:46,044 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:46,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 06:19:46,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:46,244 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 34 more)] === [2025-02-08 06:19:46,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:19:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash 78655505, now seen corresponding path program 3 times [2025-02-08 06:19:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:19:46,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331195617] [2025-02-08 06:19:46,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:19:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:19:46,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 5 equivalence classes. [2025-02-08 06:19:46,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:19:46,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-08 06:19:46,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:19:52,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:19:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331195617] [2025-02-08 06:19:52,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331195617] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:19:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463504457] [2025-02-08 06:19:52,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:19:52,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:19:52,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:19:52,885 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:19:52,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 06:19:52,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 5 equivalence classes. [2025-02-08 06:19:53,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:19:53,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-08 06:19:53,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:19:53,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-08 06:19:53,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:19:53,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2025-02-08 06:19:53,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-02-08 06:19:53,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2025-02-08 06:19:55,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2025-02-08 06:19:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 06:19:55,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:20:00,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463504457] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:20:00,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:20:00,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 42 [2025-02-08 06:20:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448570883] [2025-02-08 06:20:00,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:20:00,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 06:20:00,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:20:00,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 06:20:00,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2951, Unknown=1, NotChecked=0, Total=3192 [2025-02-08 06:20:00,806 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand has 42 states, 40 states have (on average 1.5) internal successors, (60), 41 states have internal predecessors, (60), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-08 06:20:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:20:14,531 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2025-02-08 06:20:14,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-08 06:20:14,532 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.5) internal successors, (60), 41 states have internal predecessors, (60), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 49 [2025-02-08 06:20:14,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:20:14,532 INFO L225 Difference]: With dead ends: 52 [2025-02-08 06:20:14,532 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:20:14,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=828, Invalid=6481, Unknown=1, NotChecked=0, Total=7310 [2025-02-08 06:20:14,533 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 169 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:20:14,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 221 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 06:20:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:20:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:20:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:20:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:20:14,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2025-02-08 06:20:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:20:14,534 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:20:14,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.5) internal successors, (60), 41 states have internal predecessors, (60), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-08 06:20:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:20:14,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:20:14,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (36 of 37 remaining) [2025-02-08 06:20:14,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (35 of 37 remaining) [2025-02-08 06:20:14,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (34 of 37 remaining) [2025-02-08 06:20:14,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (33 of 37 remaining) [2025-02-08 06:20:14,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 37 remaining) [2025-02-08 06:20:14,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 37 remaining) [2025-02-08 06:20:14,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 37 remaining) [2025-02-08 06:20:14,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 37 remaining) [2025-02-08 06:20:14,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 37 remaining) [2025-02-08 06:20:14,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 37 remaining) [2025-02-08 06:20:14,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 37 remaining) [2025-02-08 06:20:14,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 37 remaining) [2025-02-08 06:20:14,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 06:20:14,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:20:14,747 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:20:14,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:20:14,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:20:14 BoogieIcfgContainer [2025-02-08 06:20:14,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:20:14,752 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:20:14,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:20:14,753 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:20:14,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:19:02" (3/4) ... [2025-02-08 06:20:14,754 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:20:14,758 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 06:20:14,759 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 06:20:14,761 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-08 06:20:14,762 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-08 06:20:14,762 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 06:20:14,762 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:20:14,825 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:20:14,825 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:20:14,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:20:14,826 INFO L158 Benchmark]: Toolchain (without parser) took 72646.53ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 133.6MB in the beginning and 522.1MB in the end (delta: -388.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-02-08 06:20:14,826 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 124.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:20:14,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.65ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 122.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:20:14,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.76ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 120.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:20:14,827 INFO L158 Benchmark]: Boogie Preprocessor took 41.49ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 118.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:20:14,827 INFO L158 Benchmark]: IcfgBuilder took 362.69ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 95.8MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:20:14,827 INFO L158 Benchmark]: TraceAbstraction took 71935.69ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 95.5MB in the beginning and 531.1MB in the end (delta: -435.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:20:14,827 INFO L158 Benchmark]: Witness Printer took 72.65ms. Allocated memory is still 578.8MB. Free memory was 531.1MB in the beginning and 522.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:20:14,828 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.99ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 124.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.65ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 122.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.76ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 120.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.49ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 118.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 362.69ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 95.8MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 71935.69ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 95.5MB in the beginning and 531.1MB in the end (delta: -435.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.65ms. Allocated memory is still 578.8MB. Free memory was 531.1MB in the beginning and 522.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 48]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 64]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 64]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 64]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 96 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 71.9s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 39.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 2261 SdHoareTripleChecker+Valid, 18.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2221 mSDsluCounter, 8877 SdHoareTripleChecker+Invalid, 18.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7238 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6700 IncrementalHoareTripleChecker+Invalid, 6932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 1639 mSDtfsCounter, 6700 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1266 GetRequests, 818 SyntacticMatches, 28 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3534 ImplicationChecksByTransitivity, 34.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=21, InterpolantAutomatonStates: 227, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 268 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 1334 NumberOfCodeBlocks, 1306 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1676 ConstructedInterpolants, 98 QuantifiedInterpolants, 18129 SizeOfPredicates, 80 NumberOfNonLiveVariables, 2795 ConjunctsInSsa, 335 ConjunctsInUnsatCore, 50 InterpolantComputations, 10 PerfectInterpolantSequences, 1271/1592 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 37 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:20:14,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE