./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:23:57,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:23:57,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:23:57,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:23:57,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:23:57,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:23:57,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:23:57,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:23:57,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:23:57,553 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:23:57,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:23:57,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:23:57,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:23:57,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:23:57,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:23:57,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:57,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:57,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:23:57,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:23:57,557 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2025-01-09 22:23:57,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:23:57,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:23:57,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:23:57,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:23:57,875 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:23:57,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-01-09 22:23:59,162 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9ead7493/699c76af5eb94646b9a4edfdea7d134b/FLAG01d32e3d8 [2025-01-09 22:23:59,550 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:23:59,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-01-09 22:23:59,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9ead7493/699c76af5eb94646b9a4edfdea7d134b/FLAG01d32e3d8 [2025-01-09 22:23:59,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9ead7493/699c76af5eb94646b9a4edfdea7d134b [2025-01-09 22:23:59,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:23:59,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:23:59,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:23:59,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:23:59,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:23:59,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:23:59,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed66158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59, skipping insertion in model container [2025-01-09 22:23:59,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:23:59,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:23:59,870 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:23:59,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:23:59,885 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:23:59,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:23:59,956 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:23:59,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59 WrapperNode [2025-01-09 22:23:59,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:23:59,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:23:59,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:23:59,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:23:59,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:23:59,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:23:59,992 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-01-09 22:23:59,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:23:59,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:23:59,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:23:59,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:24:00,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,018 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [9, 6, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-01-09 22:24:00,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:24:00,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:24:00,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:24:00,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:24:00,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (1/1) ... [2025-01-09 22:24:00,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:24:00,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:00,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:24:00,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:24:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:24:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:24:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:24:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-01-09 22:24:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-01-09 22:24:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:24:00,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:24:00,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:24:00,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:24:00,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:24:00,191 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:24:00,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:24:00,384 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-01-09 22:24:00,384 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:24:00,393 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:24:00,394 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:24:00,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:24:00 BoogieIcfgContainer [2025-01-09 22:24:00,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:24:00,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:24:00,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:24:00,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:24:00,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:23:59" (1/3) ... [2025-01-09 22:24:00,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a77d338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:24:00, skipping insertion in model container [2025-01-09 22:24:00,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:59" (2/3) ... [2025-01-09 22:24:00,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a77d338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:24:00, skipping insertion in model container [2025-01-09 22:24:00,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:24:00" (3/3) ... [2025-01-09 22:24:00,404 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2025-01-09 22:24:00,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:24:00,420 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-01-09 22:24:00,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:24:00,476 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;@787e97d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:24:00,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 22:24:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:24:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:24:00,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:00,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:24:00,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:00,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash -920361850, now seen corresponding path program 1 times [2025-01-09 22:24:00,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:00,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381776298] [2025-01-09 22:24:00,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:00,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:00,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:24:00,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:24:00,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:00,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:00,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381776298] [2025-01-09 22:24:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381776298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:24:00,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192174342] [2025-01-09 22:24:00,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:00,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:24:00,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:00,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:24:00,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:00,848 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:00,970 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2025-01-09 22:24:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:24:00,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:24:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:00,979 INFO L225 Difference]: With dead ends: 124 [2025-01-09 22:24:00,980 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 22:24:00,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:00,984 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 148 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:00,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 22:24:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2025-01-09 22:24:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 22:24:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2025-01-09 22:24:01,042 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 6 [2025-01-09 22:24:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:01,042 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2025-01-09 22:24:01,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2025-01-09 22:24:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:24:01,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:01,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:24:01,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:24:01,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:01,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash -920361849, now seen corresponding path program 1 times [2025-01-09 22:24:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:01,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464910773] [2025-01-09 22:24:01,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:01,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:24:01,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:24:01,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:01,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:01,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:01,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464910773] [2025-01-09 22:24:01,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464910773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:01,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:01,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:01,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051940978] [2025-01-09 22:24:01,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:01,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:01,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:01,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:01,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:01,241 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:01,374 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2025-01-09 22:24:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:24:01,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:24:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:01,377 INFO L225 Difference]: With dead ends: 191 [2025-01-09 22:24:01,377 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 22:24:01,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:01,378 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 82 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:01,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 204 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 22:24:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 168. [2025-01-09 22:24:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-01-09 22:24:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2025-01-09 22:24:01,408 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 6 [2025-01-09 22:24:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:01,408 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2025-01-09 22:24:01,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2025-01-09 22:24:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:24:01,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:01,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:01,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:24:01,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:01,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1533553699, now seen corresponding path program 1 times [2025-01-09 22:24:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693668394] [2025-01-09 22:24:01,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:01,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:24:01,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:24:01,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:01,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:01,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693668394] [2025-01-09 22:24:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693668394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:01,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:01,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333212542] [2025-01-09 22:24:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:01,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:01,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:01,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:01,635 INFO L87 Difference]: Start difference. First operand 168 states and 261 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:01,797 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2025-01-09 22:24:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:01,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:24:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:01,800 INFO L225 Difference]: With dead ends: 208 [2025-01-09 22:24:01,800 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 22:24:01,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:01,801 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:01,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 157 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 22:24:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 171. [2025-01-09 22:24:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-01-09 22:24:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 264 transitions. [2025-01-09 22:24:01,825 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 264 transitions. Word has length 7 [2025-01-09 22:24:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:01,826 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 264 transitions. [2025-01-09 22:24:01,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 264 transitions. [2025-01-09 22:24:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:24:01,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:01,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:01,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:24:01,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:01,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash 295524454, now seen corresponding path program 1 times [2025-01-09 22:24:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:01,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254889246] [2025-01-09 22:24:01,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:01,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:01,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:24:01,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:24:01,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:01,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254889246] [2025-01-09 22:24:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254889246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:02,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:02,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:02,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346224471] [2025-01-09 22:24:02,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:02,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:02,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:02,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:02,018 INFO L87 Difference]: Start difference. First operand 171 states and 264 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:02,146 INFO L93 Difference]: Finished difference Result 193 states and 266 transitions. [2025-01-09 22:24:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:02,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:24:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:02,148 INFO L225 Difference]: With dead ends: 193 [2025-01-09 22:24:02,148 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 22:24:02,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:02,149 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 63 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:02,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 201 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 22:24:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 171. [2025-01-09 22:24:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-01-09 22:24:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2025-01-09 22:24:02,161 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 8 [2025-01-09 22:24:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:02,162 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2025-01-09 22:24:02,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2025-01-09 22:24:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:24:02,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:02,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:02,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:24:02,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:02,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash 571323525, now seen corresponding path program 1 times [2025-01-09 22:24:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:02,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405163113] [2025-01-09 22:24:02,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:02,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:24:02,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:24:02,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:02,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:02,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:02,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405163113] [2025-01-09 22:24:02,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405163113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:02,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:02,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:02,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518584398] [2025-01-09 22:24:02,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:02,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:02,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:02,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:02,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:02,237 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:02,342 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2025-01-09 22:24:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:24:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:02,344 INFO L225 Difference]: With dead ends: 250 [2025-01-09 22:24:02,344 INFO L226 Difference]: Without dead ends: 250 [2025-01-09 22:24:02,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:02,345 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 133 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:02,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 190 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-09 22:24:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2025-01-09 22:24:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-01-09 22:24:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 312 transitions. [2025-01-09 22:24:02,359 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 312 transitions. Word has length 9 [2025-01-09 22:24:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:02,359 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 312 transitions. [2025-01-09 22:24:02,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 312 transitions. [2025-01-09 22:24:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:24:02,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:02,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:02,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:24:02,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:02,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 531160136, now seen corresponding path program 1 times [2025-01-09 22:24:02,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:02,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595897884] [2025-01-09 22:24:02,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:02,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:02,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:24:02,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:24:02,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:02,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:02,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:02,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595897884] [2025-01-09 22:24:02,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595897884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:02,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707798895] [2025-01-09 22:24:02,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:02,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:02,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:02,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:02,454 INFO L87 Difference]: Start difference. First operand 207 states and 312 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:02,548 INFO L93 Difference]: Finished difference Result 245 states and 327 transitions. [2025-01-09 22:24:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:02,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 22:24:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:02,551 INFO L225 Difference]: With dead ends: 245 [2025-01-09 22:24:02,551 INFO L226 Difference]: Without dead ends: 245 [2025-01-09 22:24:02,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:02,552 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 120 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:02,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 210 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-09 22:24:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2025-01-09 22:24:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-01-09 22:24:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2025-01-09 22:24:02,563 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 10 [2025-01-09 22:24:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:02,563 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2025-01-09 22:24:02,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2025-01-09 22:24:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:24:02,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:02,564 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:02,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:24:02,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:02,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:02,565 INFO L85 PathProgramCache]: Analyzing trace with hash 738472334, now seen corresponding path program 1 times [2025-01-09 22:24:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:02,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993179056] [2025-01-09 22:24:02,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:02,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:24:02,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:24:02,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:02,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:02,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:02,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993179056] [2025-01-09 22:24:02,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993179056] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:02,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725293678] [2025-01-09 22:24:02,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:02,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:02,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:02,696 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-01-09 22:24:02,701 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-01-09 22:24:02,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:24:02,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:24:02,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:02,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:02,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:24:02,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:02,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725293678] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:03,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:03,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-01-09 22:24:03,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173675060] [2025-01-09 22:24:03,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:03,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:24:03,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:03,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:24:03,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:24:03,089 INFO L87 Difference]: Start difference. First operand 217 states and 325 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:03,241 INFO L93 Difference]: Finished difference Result 240 states and 324 transitions. [2025-01-09 22:24:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:24:03,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 22:24:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:03,243 INFO L225 Difference]: With dead ends: 240 [2025-01-09 22:24:03,243 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 22:24:03,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:24:03,243 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 233 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:03,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 384 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 22:24:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2025-01-09 22:24:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.5054945054945055) internal successors, (274), 201 states have internal predecessors, (274), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-01-09 22:24:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 319 transitions. [2025-01-09 22:24:03,250 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 319 transitions. Word has length 14 [2025-01-09 22:24:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:03,250 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 319 transitions. [2025-01-09 22:24:03,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 319 transitions. [2025-01-09 22:24:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:24:03,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:03,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:03,261 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-01-09 22:24:03,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:03,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:03,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:03,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1417805820, now seen corresponding path program 1 times [2025-01-09 22:24:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109067490] [2025-01-09 22:24:03,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:03,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:24:03,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:24:03,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:03,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:03,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109067490] [2025-01-09 22:24:03,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109067490] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:03,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669233631] [2025-01-09 22:24:03,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:03,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:03,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:03,581 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-01-09 22:24:03,583 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-01-09 22:24:03,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:24:03,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:24:03,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:03,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:03,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:24:03,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:03,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:03,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669233631] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:03,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:03,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-01-09 22:24:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803368455] [2025-01-09 22:24:03,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:03,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:24:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:03,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:24:03,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:24:03,851 INFO L87 Difference]: Start difference. First operand 220 states and 319 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:04,079 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2025-01-09 22:24:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:24:04,080 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 22:24:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:04,081 INFO L225 Difference]: With dead ends: 258 [2025-01-09 22:24:04,081 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 22:24:04,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:24:04,085 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 124 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:04,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 356 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 22:24:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 228. [2025-01-09 22:24:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 190 states have (on average 1.5) internal successors, (285), 209 states have internal predecessors, (285), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-01-09 22:24:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 330 transitions. [2025-01-09 22:24:04,098 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 330 transitions. Word has length 15 [2025-01-09 22:24:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:04,098 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 330 transitions. [2025-01-09 22:24:04,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 330 transitions. [2025-01-09 22:24:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:24:04,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:04,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:04,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:04,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:04,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:04,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:04,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1002307501, now seen corresponding path program 1 times [2025-01-09 22:24:04,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:04,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965514771] [2025-01-09 22:24:04,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:04,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:04,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:24:04,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:24:04,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:04,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:04,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965514771] [2025-01-09 22:24:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965514771] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517577571] [2025-01-09 22:24:04,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:04,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:04,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:04,547 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-01-09 22:24:04,557 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-01-09 22:24:04,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:24:04,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:24:04,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:04,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:04,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:24:04,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:04,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:05,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517577571] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:05,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:05,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-01-09 22:24:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178877849] [2025-01-09 22:24:05,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:05,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:24:05,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:05,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:24:05,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:24:05,035 INFO L87 Difference]: Start difference. First operand 228 states and 330 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:05,621 INFO L93 Difference]: Finished difference Result 385 states and 531 transitions. [2025-01-09 22:24:05,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:24:05,622 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 22:24:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:05,624 INFO L225 Difference]: With dead ends: 385 [2025-01-09 22:24:05,625 INFO L226 Difference]: Without dead ends: 385 [2025-01-09 22:24:05,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:24:05,626 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 224 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:05,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 617 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:24:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-09 22:24:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 323. [2025-01-09 22:24:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 279 states have (on average 1.5412186379928314) internal successors, (430), 298 states have internal predecessors, (430), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2025-01-09 22:24:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2025-01-09 22:24:05,639 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 16 [2025-01-09 22:24:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:05,640 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2025-01-09 22:24:05,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2025-01-09 22:24:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:24:05,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:05,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:05,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:24:05,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:05,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:05,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1943920271, now seen corresponding path program 1 times [2025-01-09 22:24:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313496930] [2025-01-09 22:24:05,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:05,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:24:05,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:24:05,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:05,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:05,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:05,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313496930] [2025-01-09 22:24:05,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313496930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:05,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:05,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:24:05,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436183237] [2025-01-09 22:24:05,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:05,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:24:05,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:05,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:24:05,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:05,923 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:05,945 INFO L93 Difference]: Finished difference Result 334 states and 480 transitions. [2025-01-09 22:24:05,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:24:05,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:24:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:05,949 INFO L225 Difference]: With dead ends: 334 [2025-01-09 22:24:05,949 INFO L226 Difference]: Without dead ends: 334 [2025-01-09 22:24:05,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:05,949 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 26 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:05,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 113 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-01-09 22:24:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 325. [2025-01-09 22:24:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 284 states have (on average 1.528169014084507) internal successors, (434), 305 states have internal predecessors, (434), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (33), 11 states have call predecessors, (33), 11 states have call successors, (33) [2025-01-09 22:24:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 478 transitions. [2025-01-09 22:24:05,962 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 478 transitions. Word has length 18 [2025-01-09 22:24:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:05,962 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 478 transitions. [2025-01-09 22:24:05,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 478 transitions. [2025-01-09 22:24:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:24:05,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:05,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:05,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:24:05,963 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:05,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:05,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2036164058, now seen corresponding path program 1 times [2025-01-09 22:24:05,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:05,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082849728] [2025-01-09 22:24:05,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:05,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:24:05,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:24:05,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:05,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:06,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:06,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082849728] [2025-01-09 22:24:06,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082849728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:06,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:06,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:06,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529678456] [2025-01-09 22:24:06,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:06,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:24:06,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:06,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:24:06,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:06,011 INFO L87 Difference]: Start difference. First operand 325 states and 478 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:06,019 INFO L93 Difference]: Finished difference Result 251 states and 356 transitions. [2025-01-09 22:24:06,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:24:06,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-09 22:24:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:06,021 INFO L225 Difference]: With dead ends: 251 [2025-01-09 22:24:06,021 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 22:24:06,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:06,021 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:06,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 22:24:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-01-09 22:24:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 216 states have (on average 1.5092592592592593) internal successors, (326), 236 states have internal predecessors, (326), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2025-01-09 22:24:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 356 transitions. [2025-01-09 22:24:06,028 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 356 transitions. Word has length 25 [2025-01-09 22:24:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:06,029 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 356 transitions. [2025-01-09 22:24:06,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 356 transitions. [2025-01-09 22:24:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:24:06,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:06,030 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 22:24:06,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:24:06,030 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:06,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash -72255190, now seen corresponding path program 1 times [2025-01-09 22:24:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784717311] [2025-01-09 22:24:06,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:06,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:24:06,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:24:06,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:06,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:06,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:06,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784717311] [2025-01-09 22:24:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784717311] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:06,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225652917] [2025-01-09 22:24:06,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:06,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:06,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:06,198 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-01-09 22:24:06,200 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-01-09 22:24:06,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:24:06,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:24:06,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:06,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:06,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:24:06,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:06,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:06,440 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-01-09 22:24:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:06,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225652917] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:06,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:06,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2025-01-09 22:24:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992844874] [2025-01-09 22:24:06,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:06,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:24:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:06,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:24:06,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:24:06,622 INFO L87 Difference]: Start difference. First operand 251 states and 356 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:24:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:06,920 INFO L93 Difference]: Finished difference Result 284 states and 381 transitions. [2025-01-09 22:24:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:24:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-01-09 22:24:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:06,922 INFO L225 Difference]: With dead ends: 284 [2025-01-09 22:24:06,922 INFO L226 Difference]: Without dead ends: 284 [2025-01-09 22:24:06,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2025-01-09 22:24:06,922 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 363 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:06,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 183 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-09 22:24:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2025-01-09 22:24:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 235 states have (on average 1.4553191489361703) internal successors, (342), 259 states have internal predecessors, (342), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2025-01-09 22:24:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 376 transitions. [2025-01-09 22:24:06,928 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 376 transitions. Word has length 27 [2025-01-09 22:24:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:06,928 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 376 transitions. [2025-01-09 22:24:06,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:24:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 376 transitions. [2025-01-09 22:24:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:24:06,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:06,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:06,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:07,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 22:24:07,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:07,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1506398064, now seen corresponding path program 1 times [2025-01-09 22:24:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246061604] [2025-01-09 22:24:07,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:07,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:24:07,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:24:07,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:07,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:07,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:07,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246061604] [2025-01-09 22:24:07,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246061604] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:07,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713266183] [2025-01-09 22:24:07,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:07,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:07,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:07,242 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-01-09 22:24:07,244 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-01-09 22:24:07,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:24:07,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:24:07,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:07,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:07,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:24:07,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:07,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:07,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713266183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:07,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:24:07,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-01-09 22:24:07,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221523237] [2025-01-09 22:24:07,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:07,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:24:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:07,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:24:07,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:24:07,379 INFO L87 Difference]: Start difference. First operand 274 states and 376 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:07,425 INFO L93 Difference]: Finished difference Result 293 states and 391 transitions. [2025-01-09 22:24:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:24:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-01-09 22:24:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:07,426 INFO L225 Difference]: With dead ends: 293 [2025-01-09 22:24:07,426 INFO L226 Difference]: Without dead ends: 293 [2025-01-09 22:24:07,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:24:07,427 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 68 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:07,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 186 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-01-09 22:24:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 282. [2025-01-09 22:24:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 243 states have (on average 1.440329218106996) internal successors, (350), 267 states have internal predecessors, (350), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2025-01-09 22:24:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 384 transitions. [2025-01-09 22:24:07,433 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 384 transitions. Word has length 28 [2025-01-09 22:24:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:07,433 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 384 transitions. [2025-01-09 22:24:07,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 384 transitions. [2025-01-09 22:24:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:24:07,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:07,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:07,439 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-01-09 22:24:07,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 22:24:07,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:07,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:07,635 INFO L85 PathProgramCache]: Analyzing trace with hash -717762487, now seen corresponding path program 1 times [2025-01-09 22:24:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:07,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247796212] [2025-01-09 22:24:07,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:07,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:24:07,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:24:07,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:07,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:08,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:08,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247796212] [2025-01-09 22:24:08,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247796212] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:08,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502633863] [2025-01-09 22:24:08,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:08,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:08,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:08,130 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-01-09 22:24:08,135 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-01-09 22:24:08,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:24:08,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:24:08,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:08,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:08,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:24:08,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:08,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:08,427 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-01-09 22:24:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:08,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:08,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502633863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:08,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:08,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 18 [2025-01-09 22:24:08,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54167156] [2025-01-09 22:24:08,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:08,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:24:08,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:08,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:24:08,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:24:08,686 INFO L87 Difference]: Start difference. First operand 282 states and 384 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:24:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:09,168 INFO L93 Difference]: Finished difference Result 289 states and 383 transitions. [2025-01-09 22:24:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:24:09,169 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-01-09 22:24:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:09,170 INFO L225 Difference]: With dead ends: 289 [2025-01-09 22:24:09,170 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 22:24:09,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:24:09,171 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 301 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:09,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 284 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 22:24:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 282. [2025-01-09 22:24:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 243 states have (on average 1.4238683127572016) internal successors, (346), 267 states have internal predecessors, (346), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2025-01-09 22:24:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 380 transitions. [2025-01-09 22:24:09,176 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 380 transitions. Word has length 29 [2025-01-09 22:24:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:09,177 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 380 transitions. [2025-01-09 22:24:09,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:24:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 380 transitions. [2025-01-09 22:24:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:24:09,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:09,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:09,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:09,382 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,SelfDestructingSolverStorable13 [2025-01-09 22:24:09,382 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:09,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash -775800574, now seen corresponding path program 1 times [2025-01-09 22:24:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:09,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523562448] [2025-01-09 22:24:09,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:09,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:09,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:24:09,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:24:09,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:09,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:09,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:09,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523562448] [2025-01-09 22:24:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523562448] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:09,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535613053] [2025-01-09 22:24:09,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:09,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:09,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:09,536 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-01-09 22:24:09,538 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-01-09 22:24:09,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:24:09,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:24:09,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:09,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:09,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 22:24:09,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:09,661 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:24:09,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:24:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:09,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:09,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535613053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:09,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:09,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-01-09 22:24:09,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173602812] [2025-01-09 22:24:09,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:09,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:24:09,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:09,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:24:09,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:24:09,760 INFO L87 Difference]: Start difference. First operand 282 states and 380 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:24:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:10,010 INFO L93 Difference]: Finished difference Result 407 states and 509 transitions. [2025-01-09 22:24:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:24:10,011 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-09 22:24:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:10,012 INFO L225 Difference]: With dead ends: 407 [2025-01-09 22:24:10,013 INFO L226 Difference]: Without dead ends: 407 [2025-01-09 22:24:10,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:24:10,013 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 441 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:10,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 365 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-09 22:24:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 362. [2025-01-09 22:24:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 320 states have (on average 1.378125) internal successors, (441), 345 states have internal predecessors, (441), 8 states have call successors, (8), 8 states have call predecessors, (8), 16 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2025-01-09 22:24:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 474 transitions. [2025-01-09 22:24:10,023 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 474 transitions. Word has length 30 [2025-01-09 22:24:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:10,023 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 474 transitions. [2025-01-09 22:24:10,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:24:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 474 transitions. [2025-01-09 22:24:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:24:10,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:10,026 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:10,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:10,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:10,227 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:10,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1719986027, now seen corresponding path program 1 times [2025-01-09 22:24:10,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:10,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566477131] [2025-01-09 22:24:10,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:10,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:10,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:24:10,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:24:10,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:10,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:10,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:10,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566477131] [2025-01-09 22:24:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566477131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:10,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349730698] [2025-01-09 22:24:10,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:10,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:10,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:10,371 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-01-09 22:24:10,373 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-01-09 22:24:10,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:24:10,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:24:10,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:10,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:10,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:24:10,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:10,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:10,521 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-01-09 22:24:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:10,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:10,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349730698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:10,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:10,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2025-01-09 22:24:10,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544674353] [2025-01-09 22:24:10,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:10,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:24:10,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:10,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:24:10,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:24:10,669 INFO L87 Difference]: Start difference. First operand 362 states and 474 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:24:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:11,144 INFO L93 Difference]: Finished difference Result 428 states and 524 transitions. [2025-01-09 22:24:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:24:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-01-09 22:24:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:11,146 INFO L225 Difference]: With dead ends: 428 [2025-01-09 22:24:11,146 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 22:24:11,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 22:24:11,147 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 508 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:11,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 384 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 22:24:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 378. [2025-01-09 22:24:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 335 states have (on average 1.3850746268656717) internal successors, (464), 361 states have internal predecessors, (464), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-01-09 22:24:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 493 transitions. [2025-01-09 22:24:11,156 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 493 transitions. Word has length 31 [2025-01-09 22:24:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:11,156 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 493 transitions. [2025-01-09 22:24:11,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:24:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 493 transitions. [2025-01-09 22:24:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:24:11,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:11,158 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:11,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:11,359 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,SelfDestructingSolverStorable15 [2025-01-09 22:24:11,360 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:11,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1104147249, now seen corresponding path program 1 times [2025-01-09 22:24:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:11,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354160856] [2025-01-09 22:24:11,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:11,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:24:11,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:24:11,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:11,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:11,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:11,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354160856] [2025-01-09 22:24:11,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354160856] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:11,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64523163] [2025-01-09 22:24:11,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:11,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:11,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:11,546 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-01-09 22:24:11,547 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-01-09 22:24:11,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:24:11,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:24:11,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:11,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:11,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:24:11,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:11,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:11,764 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-01-09 22:24:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:11,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:11,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64523163] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:11,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2025-01-09 22:24:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111711014] [2025-01-09 22:24:11,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:11,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:24:11,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:11,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:24:11,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:24:11,986 INFO L87 Difference]: Start difference. First operand 378 states and 493 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:24:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:12,386 INFO L93 Difference]: Finished difference Result 395 states and 493 transitions. [2025-01-09 22:24:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:24:12,387 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-01-09 22:24:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:12,388 INFO L225 Difference]: With dead ends: 395 [2025-01-09 22:24:12,388 INFO L226 Difference]: Without dead ends: 395 [2025-01-09 22:24:12,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:24:12,389 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 374 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:12,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 286 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-01-09 22:24:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 377. [2025-01-09 22:24:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 337 states have (on average 1.3264094955489614) internal successors, (447), 360 states have internal predecessors, (447), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-01-09 22:24:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 476 transitions. [2025-01-09 22:24:12,397 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 476 transitions. Word has length 35 [2025-01-09 22:24:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:12,397 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 476 transitions. [2025-01-09 22:24:12,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:24:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 476 transitions. [2025-01-09 22:24:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:24:12,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:12,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:12,405 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-01-09 22:24:12,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:12,599 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:12,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1181916468, now seen corresponding path program 1 times [2025-01-09 22:24:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364904341] [2025-01-09 22:24:12,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:12,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:24:12,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:24:12,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:12,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:12,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:12,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364904341] [2025-01-09 22:24:12,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364904341] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:12,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153920677] [2025-01-09 22:24:12,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:12,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:12,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:12,636 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-01-09 22:24:12,638 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-01-09 22:24:12,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:24:12,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:24:12,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:12,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:12,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:24:12,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:12,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:12,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153920677] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:12,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-09 22:24:12,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531467338] [2025-01-09 22:24:12,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:12,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:24:12,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:12,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:24:12,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:12,745 INFO L87 Difference]: Start difference. First operand 377 states and 476 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:12,760 INFO L93 Difference]: Finished difference Result 375 states and 470 transitions. [2025-01-09 22:24:12,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:24:12,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-01-09 22:24:12,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:12,761 INFO L225 Difference]: With dead ends: 375 [2025-01-09 22:24:12,761 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 22:24:12,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:12,762 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:12,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 96 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 22:24:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-01-09 22:24:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 337 states have (on average 1.3086053412462908) internal successors, (441), 358 states have internal predecessors, (441), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-01-09 22:24:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 470 transitions. [2025-01-09 22:24:12,769 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 470 transitions. Word has length 40 [2025-01-09 22:24:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:12,769 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 470 transitions. [2025-01-09 22:24:12,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 470 transitions. [2025-01-09 22:24:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:24:12,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:12,770 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:12,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:12,970 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,SelfDestructingSolverStorable17 [2025-01-09 22:24:12,971 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:12,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:12,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2015295062, now seen corresponding path program 1 times [2025-01-09 22:24:12,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:12,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824961067] [2025-01-09 22:24:12,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:12,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:12,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:24:12,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:24:12,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:12,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824961067] [2025-01-09 22:24:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824961067] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200809179] [2025-01-09 22:24:13,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:13,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:13,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:13,022 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-01-09 22:24:13,023 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-01-09 22:24:13,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:24:13,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:24:13,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:13,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:13,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:24:13,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:13,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:13,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200809179] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:13,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:13,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-09 22:24:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125042365] [2025-01-09 22:24:13,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:13,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:24:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:13,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:24:13,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:13,158 INFO L87 Difference]: Start difference. First operand 375 states and 470 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:13,188 INFO L93 Difference]: Finished difference Result 373 states and 464 transitions. [2025-01-09 22:24:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:24:13,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2025-01-09 22:24:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:13,189 INFO L225 Difference]: With dead ends: 373 [2025-01-09 22:24:13,189 INFO L226 Difference]: Without dead ends: 373 [2025-01-09 22:24:13,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:13,190 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:13,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 75 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-09 22:24:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-01-09 22:24:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 337 states have (on average 1.2908011869436202) internal successors, (435), 356 states have internal predecessors, (435), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-01-09 22:24:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 464 transitions. [2025-01-09 22:24:13,197 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 464 transitions. Word has length 41 [2025-01-09 22:24:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:13,198 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 464 transitions. [2025-01-09 22:24:13,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 464 transitions. [2025-01-09 22:24:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:24:13,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:13,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:13,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:24:13,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:13,400 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:13,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1950362614, now seen corresponding path program 1 times [2025-01-09 22:24:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057877147] [2025-01-09 22:24:13,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:13,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:24:13,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:24:13,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:13,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:13,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057877147] [2025-01-09 22:24:13,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057877147] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:13,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992305122] [2025-01-09 22:24:13,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:13,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:13,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:13,473 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-01-09 22:24:13,475 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-01-09 22:24:13,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:24:13,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:24:13,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:13,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:13,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:24:13,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:13,535 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 6 treesize of output 5 [2025-01-09 22:24:13,565 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:24:13,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:24:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:13,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:13,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992305122] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:13,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:13,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-09 22:24:13,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308179937] [2025-01-09 22:24:13,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:13,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:24:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:13,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:24:13,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:13,615 INFO L87 Difference]: Start difference. First operand 373 states and 464 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:13,666 INFO L93 Difference]: Finished difference Result 401 states and 491 transitions. [2025-01-09 22:24:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:13,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-01-09 22:24:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:13,667 INFO L225 Difference]: With dead ends: 401 [2025-01-09 22:24:13,668 INFO L226 Difference]: Without dead ends: 401 [2025-01-09 22:24:13,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:13,668 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 31 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:13,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 131 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-01-09 22:24:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 373. [2025-01-09 22:24:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 337 states have (on average 1.28486646884273) internal successors, (433), 356 states have internal predecessors, (433), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-01-09 22:24:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 462 transitions. [2025-01-09 22:24:13,677 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 462 transitions. Word has length 42 [2025-01-09 22:24:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:13,677 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 462 transitions. [2025-01-09 22:24:13,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 462 transitions. [2025-01-09 22:24:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:24:13,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:13,678 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:13,704 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-01-09 22:24:13,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:13,880 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:13,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:13,880 INFO L85 PathProgramCache]: Analyzing trace with hash -709967401, now seen corresponding path program 1 times [2025-01-09 22:24:13,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:13,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337994377] [2025-01-09 22:24:13,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:13,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:13,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:24:13,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:24:13,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:13,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:13,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:13,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337994377] [2025-01-09 22:24:13,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337994377] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:13,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955140095] [2025-01-09 22:24:13,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:13,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:13,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:13,922 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-01-09 22:24:13,924 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-01-09 22:24:13,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:24:13,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:24:13,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:13,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:13,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:24:13,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:24:13,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:13,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955140095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:13,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:24:13,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-01-09 22:24:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301808474] [2025-01-09 22:24:13,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:13,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:13,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:13,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:14,000 INFO L87 Difference]: Start difference. First operand 373 states and 462 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:14,015 INFO L93 Difference]: Finished difference Result 366 states and 441 transitions. [2025-01-09 22:24:14,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:14,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-01-09 22:24:14,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:14,016 INFO L225 Difference]: With dead ends: 366 [2025-01-09 22:24:14,016 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 22:24:14,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:14,017 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:14,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 170 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 22:24:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2025-01-09 22:24:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 328 states have (on average 1.2560975609756098) internal successors, (412), 347 states have internal predecessors, (412), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-01-09 22:24:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 441 transitions. [2025-01-09 22:24:14,024 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 441 transitions. Word has length 45 [2025-01-09 22:24:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:14,024 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 441 transitions. [2025-01-09 22:24:14,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 441 transitions. [2025-01-09 22:24:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:24:14,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:14,025 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:14,031 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-01-09 22:24:14,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:14,230 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:14,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:14,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1420213817, now seen corresponding path program 1 times [2025-01-09 22:24:14,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:14,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956958091] [2025-01-09 22:24:14,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:14,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:24:14,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:24:14,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:14,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 22:24:14,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:14,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956958091] [2025-01-09 22:24:14,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956958091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:14,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:14,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762075641] [2025-01-09 22:24:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:14,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:24:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:14,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:24:14,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:14,260 INFO L87 Difference]: Start difference. First operand 364 states and 441 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:14,264 INFO L93 Difference]: Finished difference Result 299 states and 349 transitions. [2025-01-09 22:24:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:24:14,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-09 22:24:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:14,266 INFO L225 Difference]: With dead ends: 299 [2025-01-09 22:24:14,266 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 22:24:14,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:14,267 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:14,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 22:24:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2025-01-09 22:24:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 270 states have (on average 1.2074074074074075) internal successors, (326), 281 states have internal predecessors, (326), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-01-09 22:24:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2025-01-09 22:24:14,272 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 47 [2025-01-09 22:24:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:14,272 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2025-01-09 22:24:14,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2025-01-09 22:24:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:24:14,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:14,273 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:14,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:24:14,273 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:14,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1750915867, now seen corresponding path program 1 times [2025-01-09 22:24:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:14,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997543655] [2025-01-09 22:24:14,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:14,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:14,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:24:14,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:24:14,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:14,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997543655] [2025-01-09 22:24:14,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997543655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019850575] [2025-01-09 22:24:14,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:14,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:14,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:14,321 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-01-09 22:24:14,322 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-01-09 22:24:14,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:24:14,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:24:14,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:14,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:14,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:24:14,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:14,420 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_parse_input_c1_~x~0#1.base_62| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_parse_input_c1_~x~0#1.base_62| (select |c_#valid| |v_parse_input_c1_~x~0#1.base_62|))) (<= |v_parse_input_c1_~x~0#1.base_62| c_~global~0.base))) is different from true [2025-01-09 22:24:14,443 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:24:14,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:24:14,556 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:24:14,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:24:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:24:14,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:14,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019850575] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:14,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:14,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 16 [2025-01-09 22:24:14,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714800822] [2025-01-09 22:24:14,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:14,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:24:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:14,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:24:14,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2025-01-09 22:24:14,665 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:24:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:15,134 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2025-01-09 22:24:15,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:24:15,135 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2025-01-09 22:24:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:15,135 INFO L225 Difference]: With dead ends: 274 [2025-01-09 22:24:15,135 INFO L226 Difference]: Without dead ends: 274 [2025-01-09 22:24:15,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=1053, Unknown=1, NotChecked=70, Total=1406 [2025-01-09 22:24:15,136 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 341 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:15,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 394 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 405 Invalid, 0 Unknown, 168 Unchecked, 0.2s Time] [2025-01-09 22:24:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-09 22:24:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 257. [2025-01-09 22:24:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 235 states have (on average 1.1787234042553192) internal successors, (277), 244 states have internal predecessors, (277), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 22:24:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 292 transitions. [2025-01-09 22:24:15,141 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 292 transitions. Word has length 51 [2025-01-09 22:24:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:15,141 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 292 transitions. [2025-01-09 22:24:15,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:24:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2025-01-09 22:24:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:24:15,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:15,141 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:15,148 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-01-09 22:24:15,342 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,SelfDestructingSolverStorable22 [2025-01-09 22:24:15,342 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:15,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:15,343 INFO L85 PathProgramCache]: Analyzing trace with hash 827255584, now seen corresponding path program 1 times [2025-01-09 22:24:15,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:15,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648937697] [2025-01-09 22:24:15,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:15,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:24:15,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:24:15,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:15,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:15,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:15,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648937697] [2025-01-09 22:24:15,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648937697] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:15,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668744091] [2025-01-09 22:24:15,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:15,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:15,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:15,539 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-01-09 22:24:15,547 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-01-09 22:24:15,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:24:15,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:24:15,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:15,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:15,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:24:15,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:15,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:24:15,696 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 11 treesize of output 11 [2025-01-09 22:24:15,787 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:24:15,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:24:15,813 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:24:15,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:24:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:15,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:15,884 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:24:15,884 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 56 treesize of output 53 [2025-01-09 22:24:16,031 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:24:16,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2025-01-09 22:24:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:16,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668744091] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:16,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:16,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2025-01-09 22:24:16,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220892782] [2025-01-09 22:24:16,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:16,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 22:24:16,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:16,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 22:24:16,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:24:16,159 INFO L87 Difference]: Start difference. First operand 257 states and 292 transitions. Second operand has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:24:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:16,317 INFO L93 Difference]: Finished difference Result 265 states and 300 transitions. [2025-01-09 22:24:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:24:16,318 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2025-01-09 22:24:16,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:16,319 INFO L225 Difference]: With dead ends: 265 [2025-01-09 22:24:16,319 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 22:24:16,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:24:16,320 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 145 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:16,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 142 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 22:24:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 256. [2025-01-09 22:24:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 235 states have (on average 1.174468085106383) internal successors, (276), 243 states have internal predecessors, (276), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 22:24:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 291 transitions. [2025-01-09 22:24:16,324 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 291 transitions. Word has length 51 [2025-01-09 22:24:16,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:16,325 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 291 transitions. [2025-01-09 22:24:16,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:24:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 291 transitions. [2025-01-09 22:24:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:24:16,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:16,325 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:16,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 22:24:16,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 22:24:16,530 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:16,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:16,530 INFO L85 PathProgramCache]: Analyzing trace with hash -124880695, now seen corresponding path program 1 times [2025-01-09 22:24:16,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:16,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744658963] [2025-01-09 22:24:16,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:16,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:24:16,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:24:16,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:16,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:17,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744658963] [2025-01-09 22:24:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744658963] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205927232] [2025-01-09 22:24:17,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:17,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:17,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:17,032 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-01-09 22:24:17,034 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-01-09 22:24:17,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:24:17,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:24:17,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:17,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:17,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:24:17,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:17,238 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:24:17,239 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 11 treesize of output 11 [2025-01-09 22:24:17,431 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:24:17,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:24:17,465 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:24:17,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:24:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:17,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:17,630 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-01-09 22:24:17,630 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 88 treesize of output 81 [2025-01-09 22:24:17,812 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-01-09 22:24:17,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2025-01-09 22:24:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:18,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205927232] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:18,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:24:18,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 14] total 45 [2025-01-09 22:24:18,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934246721] [2025-01-09 22:24:18,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:18,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 22:24:18,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:18,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 22:24:18,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1851, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 22:24:18,098 INFO L87 Difference]: Start difference. First operand 256 states and 291 transitions. Second operand has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:24:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:18,426 INFO L93 Difference]: Finished difference Result 266 states and 299 transitions. [2025-01-09 22:24:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:24:18,427 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2025-01-09 22:24:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:18,427 INFO L225 Difference]: With dead ends: 266 [2025-01-09 22:24:18,428 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 22:24:18,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=427, Invalid=2329, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 22:24:18,428 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 420 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:18,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 186 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:24:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 22:24:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2025-01-09 22:24:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 235 states have (on average 1.1702127659574468) internal successors, (275), 243 states have internal predecessors, (275), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 22:24:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 290 transitions. [2025-01-09 22:24:18,432 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 290 transitions. Word has length 52 [2025-01-09 22:24:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:18,433 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 290 transitions. [2025-01-09 22:24:18,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 37 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:24:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 290 transitions. [2025-01-09 22:24:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:24:18,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:18,433 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:18,444 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-01-09 22:24:18,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:18,638 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:18,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:18,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2017261651, now seen corresponding path program 1 times [2025-01-09 22:24:18,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:18,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369186465] [2025-01-09 22:24:18,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:18,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:18,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:24:18,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:24:18,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:18,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:24:18,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:18,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369186465] [2025-01-09 22:24:18,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369186465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:18,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601396239] [2025-01-09 22:24:18,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:18,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:18,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:18,781 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:24:18,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 22:24:18,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 22:24:18,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:24:18,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:18,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:18,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:24:18,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:18,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:18,917 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-01-09 22:24:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:24:18,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:19,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601396239] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:19,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:19,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2025-01-09 22:24:19,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776872119] [2025-01-09 22:24:19,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:19,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:24:19,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:19,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:24:19,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:24:19,128 INFO L87 Difference]: Start difference. First operand 256 states and 290 transitions. Second operand has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:24:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:19,458 INFO L93 Difference]: Finished difference Result 267 states and 295 transitions. [2025-01-09 22:24:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:24:19,458 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2025-01-09 22:24:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:19,459 INFO L225 Difference]: With dead ends: 267 [2025-01-09 22:24:19,459 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 22:24:19,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:24:19,460 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 279 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:19,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 227 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 22:24:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 255. [2025-01-09 22:24:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 242 states have internal predecessors, (269), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 22:24:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 284 transitions. [2025-01-09 22:24:19,468 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 284 transitions. Word has length 52 [2025-01-09 22:24:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:19,468 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 284 transitions. [2025-01-09 22:24:19,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:24:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 284 transitions. [2025-01-09 22:24:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:24:19,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:19,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:19,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-09 22:24:19,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:19,673 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:19,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:19,674 INFO L85 PathProgramCache]: Analyzing trace with hash 248737707, now seen corresponding path program 1 times [2025-01-09 22:24:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:19,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223296053] [2025-01-09 22:24:19,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:19,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:24:19,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:24:19,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:19,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:20,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:20,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223296053] [2025-01-09 22:24:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223296053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:20,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115803111] [2025-01-09 22:24:20,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:20,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:20,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:20,076 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:24:20,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-09 22:24:20,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 22:24:20,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:24:20,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:20,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:20,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:24:20,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:20,297 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:24:20,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:24:20,623 INFO L349 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2025-01-09 22:24:20,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2025-01-09 22:24:20,723 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-01-09 22:24:20,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2025-01-09 22:24:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:20,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:20,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115803111] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:20,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:20,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-01-09 22:24:20,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487923336] [2025-01-09 22:24:20,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:20,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:24:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:20,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:24:20,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:24:20,875 INFO L87 Difference]: Start difference. First operand 255 states and 284 transitions. Second operand has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:24:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:21,512 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2025-01-09 22:24:21,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:24:21,512 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2025-01-09 22:24:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:21,513 INFO L225 Difference]: With dead ends: 263 [2025-01-09 22:24:21,513 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 22:24:21,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:24:21,514 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 223 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:21,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 222 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:24:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 22:24:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2025-01-09 22:24:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 235 states have (on average 1.1404255319148937) internal successors, (268), 241 states have internal predecessors, (268), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 22:24:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 283 transitions. [2025-01-09 22:24:21,519 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 283 transitions. Word has length 54 [2025-01-09 22:24:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:21,519 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 283 transitions. [2025-01-09 22:24:21,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:24:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 283 transitions. [2025-01-09 22:24:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 22:24:21,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:21,521 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:21,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-09 22:24:21,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 22:24:21,728 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:21,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash -520337758, now seen corresponding path program 1 times [2025-01-09 22:24:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:21,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638614272] [2025-01-09 22:24:21,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:21,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:21,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 22:24:21,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 22:24:21,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:21,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:22,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:22,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638614272] [2025-01-09 22:24:22,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638614272] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:22,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322385755] [2025-01-09 22:24:22,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:22,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:22,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:22,347 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:24:22,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-09 22:24:22,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 22:24:22,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 22:24:22,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:22,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:22,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 22:24:22,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:22,767 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:24:22,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:24:23,283 INFO L349 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2025-01-09 22:24:23,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2025-01-09 22:24:23,415 INFO L349 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2025-01-09 22:24:23,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 64 [2025-01-09 22:24:23,489 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-01-09 22:24:23,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2025-01-09 22:24:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:23,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322385755] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:23,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 25 [2025-01-09 22:24:23,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220199017] [2025-01-09 22:24:23,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:23,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:24:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:23,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:24:23,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:24:23,720 INFO L87 Difference]: Start difference. First operand 254 states and 283 transitions. Second operand has 27 states, 24 states have (on average 4.583333333333333) internal successors, (110), 23 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:24:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:24,809 INFO L93 Difference]: Finished difference Result 271 states and 297 transitions. [2025-01-09 22:24:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 22:24:24,810 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 4.583333333333333) internal successors, (110), 23 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 60 [2025-01-09 22:24:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:24,811 INFO L225 Difference]: With dead ends: 271 [2025-01-09 22:24:24,811 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 22:24:24,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=524, Invalid=2668, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 22:24:24,812 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 322 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:24,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 499 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:24:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 22:24:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2025-01-09 22:24:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 235 states have (on average 1.1361702127659574) internal successors, (267), 240 states have internal predecessors, (267), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 22:24:24,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 282 transitions. [2025-01-09 22:24:24,815 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 282 transitions. Word has length 60 [2025-01-09 22:24:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:24,816 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 282 transitions. [2025-01-09 22:24:24,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 4.583333333333333) internal successors, (110), 23 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:24:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 282 transitions. [2025-01-09 22:24:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 22:24:24,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:24,818 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:24,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-09 22:24:25,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:25,019 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:25,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1049398727, now seen corresponding path program 1 times [2025-01-09 22:24:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:25,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694270911] [2025-01-09 22:24:25,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:25,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:25,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 22:24:25,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:24:25,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:25,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694270911] [2025-01-09 22:24:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694270911] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121009732] [2025-01-09 22:24:25,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:25,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:25,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:25,495 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:24:25,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-09 22:24:25,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 22:24:25,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:24:25,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:25,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:25,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 22:24:25,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:25,814 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:24:25,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:24:25,817 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-01-09 22:24:25,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:24:25,999 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-01-09 22:24:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 22:24:26,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:26,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121009732] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:26,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:26,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 23 [2025-01-09 22:24:26,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248578233] [2025-01-09 22:24:26,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:26,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:24:26,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:26,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:24:26,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:24:26,345 INFO L87 Difference]: Start difference. First operand 253 states and 282 transitions. Second operand has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:24:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:27,102 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2025-01-09 22:24:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:24:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2025-01-09 22:24:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:27,103 INFO L225 Difference]: With dead ends: 278 [2025-01-09 22:24:27,103 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 22:24:27,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=1952, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 22:24:27,104 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 277 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:27,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 230 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:24:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 22:24:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 252. [2025-01-09 22:24:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 235 states have (on average 1.1319148936170214) internal successors, (266), 239 states have internal predecessors, (266), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 22:24:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 281 transitions. [2025-01-09 22:24:27,107 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 281 transitions. Word has length 61 [2025-01-09 22:24:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:27,108 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 281 transitions. [2025-01-09 22:24:27,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:24:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 281 transitions. [2025-01-09 22:24:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 22:24:27,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:27,108 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:27,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:27,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 22:24:27,313 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:27,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1213223649, now seen corresponding path program 1 times [2025-01-09 22:24:27,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:27,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177125674] [2025-01-09 22:24:27,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:27,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:27,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 22:24:27,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:24:27,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:27,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:27,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:24:27,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177125674] [2025-01-09 22:24:27,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177125674] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:27,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919618361] [2025-01-09 22:24:27,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:27,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:27,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:27,454 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:24:27,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-09 22:24:27,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 22:24:27,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:24:27,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:27,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:27,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:24:27,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:27,527 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 6 treesize of output 5 [2025-01-09 22:24:27,620 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:24:27,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2025-01-09 22:24:27,640 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:24:27,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:24:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:27,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:27,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919618361] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:24:27,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:27,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-01-09 22:24:27,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101270665] [2025-01-09 22:24:27,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:27,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:24:27,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:24:27,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:24:27,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:24:27,705 INFO L87 Difference]: Start difference. First operand 252 states and 281 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:24:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:27,834 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2025-01-09 22:24:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:24:27,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2025-01-09 22:24:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:27,835 INFO L225 Difference]: With dead ends: 263 [2025-01-09 22:24:27,835 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 22:24:27,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:24:27,836 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 29 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:27,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 218 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 22:24:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 207. [2025-01-09 22:24:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-09 22:24:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 231 transitions. [2025-01-09 22:24:27,839 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 231 transitions. Word has length 66 [2025-01-09 22:24:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:27,840 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 231 transitions. [2025-01-09 22:24:27,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:24:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 231 transitions. [2025-01-09 22:24:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 22:24:27,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:27,840 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:27,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:28,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:28,041 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:28,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1024292242, now seen corresponding path program 1 times [2025-01-09 22:24:28,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:24:28,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570977851] [2025-01-09 22:24:28,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:28,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:24:28,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 22:24:28,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 22:24:28,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:28,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:24:28,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:24:28,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 22:24:28,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 22:24:28,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:28,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:24:28,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 22:24:28,090 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:24:28,090 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2025-01-09 22:24:28,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2025-01-09 22:24:28,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2025-01-09 22:24:28,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2025-01-09 22:24:28,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2025-01-09 22:24:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2025-01-09 22:24:28,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2025-01-09 22:24:28,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2025-01-09 22:24:28,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2025-01-09 22:24:28,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2025-01-09 22:24:28,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 22:24:28,095 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:28,145 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:24:28,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:24:28 BoogieIcfgContainer [2025-01-09 22:24:28,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:24:28,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:24:28,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:24:28,148 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:24:28,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:24:00" (3/4) ... [2025-01-09 22:24:28,149 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 22:24:28,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:24:28,151 INFO L158 Benchmark]: Toolchain (without parser) took 28563.73ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 109.4MB in the beginning and 159.2MB in the end (delta: -49.8MB). Peak memory consumption was 232.2MB. Max. memory is 16.1GB. [2025-01-09 22:24:28,151 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:24:28,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.89ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 89.4MB in the end (delta: 19.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:24:28,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.57ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 87.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:24:28,152 INFO L158 Benchmark]: Boogie Preprocessor took 42.57ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 85.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:24:28,153 INFO L158 Benchmark]: RCFGBuilder took 358.34ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 69.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:24:28,153 INFO L158 Benchmark]: TraceAbstraction took 27750.48ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 68.5MB in the beginning and 159.2MB in the end (delta: -90.7MB). Peak memory consumption was 190.3MB. Max. memory is 16.1GB. [2025-01-09 22:24:28,153 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 419.4MB. Free memory was 159.2MB in the beginning and 159.2MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:24:28,153 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.89ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 89.4MB in the end (delta: 19.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.57ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 87.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.57ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 85.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 358.34ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 69.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27750.48ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 68.5MB in the beginning and 159.2MB in the end (delta: -90.7MB). Peak memory consumption was 190.3MB. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 419.4MB. Free memory was 159.2MB in the beginning and 159.2MB in the end (delta: 87.1kB). 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 - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, input={3:0}, state=0] [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L722] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L723] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, input={4:0}, state=1] [L692] COND FALSE !(i < 2) [L723] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L724] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, input={5:0}, state=1] [L692] COND FALSE !(i < 2) [L724] RET parse_input("c2") VAL [commands={6:0}, global={7:0}, state=1] [L725] return 0; VAL [\result=0, commands={6:0}, global={7:0}, state=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 27.7s, OverallIterations: 31, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5462 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5462 mSDsluCounter, 7019 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 168 IncrementalHoareTripleChecker+Unchecked, 5512 mSDsCounter, 642 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6249 IncrementalHoareTripleChecker+Invalid, 7059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 642 mSolverCounterUnsat, 1507 mSDtfsCounter, 6249 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1628 GetRequests, 1088 SyntacticMatches, 8 SemanticMatches, 532 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3636 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred in iteration=16, InterpolantAutomatonStates: 296, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 631 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 1883 NumberOfCodeBlocks, 1883 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2028 ConstructedInterpolants, 119 QuantifiedInterpolants, 22399 SizeOfPredicates, 80 NumberOfNonLiveVariables, 5374 ConjunctsInSsa, 412 ConjunctsInUnsatCore, 59 InterpolantComputations, 11 PerfectInterpolantSequences, 413/1020 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 22:24:28,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:24:30,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:24:30,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-09 22:24:30,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:24:30,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:24:30,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:24:30,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:24:30,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:24:30,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:24:30,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:24:30,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:24:30,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:24:30,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:24:30,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:24:30,395 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:24:30,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:24:30,395 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:24:30,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:24:30,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:24:30,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:24:30,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:24:30,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:24:30,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:24:30,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:24:30,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:24:30,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:24:30,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:24:30,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:24:30,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:24:30,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:24:30,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:24:30,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:24:30,397 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 22:24:30,397 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 22:24:30,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:24:30,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:24:30,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:24:30,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:24:30,398 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2025-01-09 22:24:30,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:24:30,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:24:30,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:24:30,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:24:30,724 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:24:30,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-01-09 22:24:31,977 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95ff55fc2/a015f04bc6a74b92a4050678efb8744c/FLAGb7ddeea42 [2025-01-09 22:24:32,221 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:24:32,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-01-09 22:24:32,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95ff55fc2/a015f04bc6a74b92a4050678efb8744c/FLAGb7ddeea42 [2025-01-09 22:24:32,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95ff55fc2/a015f04bc6a74b92a4050678efb8744c [2025-01-09 22:24:32,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:24:32,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:24:32,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:24:32,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:24:32,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:24:32,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53466432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32, skipping insertion in model container [2025-01-09 22:24:32,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:24:32,512 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:24:32,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:24:32,532 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:24:32,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:24:32,605 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:24:32,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32 WrapperNode [2025-01-09 22:24:32,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:24:32,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:24:32,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:24:32,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:24:32,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,647 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 93 [2025-01-09 22:24:32,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:24:32,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:24:32,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:24:32,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:24:32,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,672 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2025-01-09 22:24:32,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:24:32,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:24:32,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:24:32,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:24:32,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (1/1) ... [2025-01-09 22:24:32,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:24:32,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:32,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:24:32,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:24:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 22:24:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 22:24:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 22:24:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-01-09 22:24:32,747 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-01-09 22:24:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:24:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:24:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:24:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:24:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:24:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:24:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:24:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:24:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:24:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 22:24:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 22:24:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 22:24:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:24:32,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:24:32,824 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:24:32,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:24:33,016 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-01-09 22:24:33,016 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:24:33,028 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:24:33,029 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:24:33,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:24:33 BoogieIcfgContainer [2025-01-09 22:24:33,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:24:33,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:24:33,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:24:33,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:24:33,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:24:32" (1/3) ... [2025-01-09 22:24:33,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed827a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:24:33, skipping insertion in model container [2025-01-09 22:24:33,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:24:32" (2/3) ... [2025-01-09 22:24:33,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed827a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:24:33, skipping insertion in model container [2025-01-09 22:24:33,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:24:33" (3/3) ... [2025-01-09 22:24:33,037 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2025-01-09 22:24:33,047 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:24:33,049 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-01-09 22:24:33,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:24:33,083 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;@9770f9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:24:33,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 22:24:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:24:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:24:33,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:33,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:24:33,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:33,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:33,098 INFO L85 PathProgramCache]: Analyzing trace with hash -920361850, now seen corresponding path program 1 times [2025-01-09 22:24:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:33,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911349856] [2025-01-09 22:24:33,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:33,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:33,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:33,113 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-01-09 22:24:33,117 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-01-09 22:24:33,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:24:33,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:24:33,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:33,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:33,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:24:33,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:33,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:33,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:33,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911349856] [2025-01-09 22:24:33,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911349856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:33,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:33,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 22:24:33,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326428157] [2025-01-09 22:24:33,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:33,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:24:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:33,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:24:33,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:33,344 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:33,438 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2025-01-09 22:24:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:24:33,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:24:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:33,447 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:24:33,447 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:24:33,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:33,452 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 52 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:33,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 101 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:24:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2025-01-09 22:24:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 76 states have internal predecessors, (97), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 22:24:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2025-01-09 22:24:33,490 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 6 [2025-01-09 22:24:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:33,490 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2025-01-09 22:24:33,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2025-01-09 22:24:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:24:33,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:33,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:24:33,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:33,692 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 [2025-01-09 22:24:33,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:33,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash -920361849, now seen corresponding path program 1 times [2025-01-09 22:24:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128416702] [2025-01-09 22:24:33,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:33,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:33,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:33,697 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-01-09 22:24:33,698 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-01-09 22:24:33,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:24:33,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:24:33,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:33,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:33,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 22:24:33,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:33,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:33,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:33,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128416702] [2025-01-09 22:24:33,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128416702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:33,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:33,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:24:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606120] [2025-01-09 22:24:33,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:33,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:24:33,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:33,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:24:33,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:33,855 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:33,980 INFO L93 Difference]: Finished difference Result 180 states and 242 transitions. [2025-01-09 22:24:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:24:33,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:24:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:33,981 INFO L225 Difference]: With dead ends: 180 [2025-01-09 22:24:33,982 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 22:24:33,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:33,983 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 86 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:33,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 139 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 22:24:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2025-01-09 22:24:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.7394957983193278) internal successors, (207), 138 states have internal predecessors, (207), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-01-09 22:24:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 238 transitions. [2025-01-09 22:24:34,001 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 238 transitions. Word has length 6 [2025-01-09 22:24:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:34,001 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 238 transitions. [2025-01-09 22:24:34,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 238 transitions. [2025-01-09 22:24:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:24:34,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:34,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:34,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:34,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:34,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:34,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1533553699, now seen corresponding path program 1 times [2025-01-09 22:24:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:34,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358806383] [2025-01-09 22:24:34,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:34,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:34,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:34,206 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-01-09 22:24:34,208 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-01-09 22:24:34,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:24:34,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:24:34,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:34,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:34,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:24:34,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:34,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:34,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358806383] [2025-01-09 22:24:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358806383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:34,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:34,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:34,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030920791] [2025-01-09 22:24:34,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:34,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:34,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:34,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:34,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:34,430 INFO L87 Difference]: Start difference. First operand 152 states and 238 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:34,577 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-01-09 22:24:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:24:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:34,579 INFO L225 Difference]: With dead ends: 192 [2025-01-09 22:24:34,579 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 22:24:34,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:34,579 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 80 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:34,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 159 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 22:24:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 155. [2025-01-09 22:24:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.721311475409836) internal successors, (210), 141 states have internal predecessors, (210), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-01-09 22:24:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 241 transitions. [2025-01-09 22:24:34,588 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 241 transitions. Word has length 7 [2025-01-09 22:24:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:34,589 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 241 transitions. [2025-01-09 22:24:34,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2025-01-09 22:24:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:24:34,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:34,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:34,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:24:34,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:34,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:34,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash 295524454, now seen corresponding path program 1 times [2025-01-09 22:24:34,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:34,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678892502] [2025-01-09 22:24:34,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:34,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:34,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:34,798 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-01-09 22:24:34,801 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-01-09 22:24:34,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:24:34,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:24:34,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:34,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:34,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:24:34,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:34,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:34,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678892502] [2025-01-09 22:24:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678892502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506071658] [2025-01-09 22:24:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:34,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:34,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:34,980 INFO L87 Difference]: Start difference. First operand 155 states and 241 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:35,126 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2025-01-09 22:24:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:35,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:24:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:35,129 INFO L225 Difference]: With dead ends: 182 [2025-01-09 22:24:35,129 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 22:24:35,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:35,129 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 68 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:35,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 205 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 22:24:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 155. [2025-01-09 22:24:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.7049180327868851) internal successors, (208), 141 states have internal predecessors, (208), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-01-09 22:24:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2025-01-09 22:24:35,148 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 8 [2025-01-09 22:24:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:35,149 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2025-01-09 22:24:35,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2025-01-09 22:24:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:24:35,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:35,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:35,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:35,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:35,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:35,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:35,350 INFO L85 PathProgramCache]: Analyzing trace with hash 571323525, now seen corresponding path program 1 times [2025-01-09 22:24:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:35,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59526980] [2025-01-09 22:24:35,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:35,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:35,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:35,356 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-01-09 22:24:35,357 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-01-09 22:24:35,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:24:35,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:24:35,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:35,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:35,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:24:35,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:35,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:35,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:35,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59526980] [2025-01-09 22:24:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59526980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:35,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:35,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:35,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009450574] [2025-01-09 22:24:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:35,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:35,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:35,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:35,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:35,451 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:35,558 INFO L93 Difference]: Finished difference Result 234 states and 321 transitions. [2025-01-09 22:24:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:35,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:24:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:35,560 INFO L225 Difference]: With dead ends: 234 [2025-01-09 22:24:35,560 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 22:24:35,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:35,560 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 172 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:35,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 170 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 22:24:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 191. [2025-01-09 22:24:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.6538461538461537) internal successors, (258), 176 states have internal predecessors, (258), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-01-09 22:24:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 289 transitions. [2025-01-09 22:24:35,569 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 289 transitions. Word has length 9 [2025-01-09 22:24:35,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:35,569 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 289 transitions. [2025-01-09 22:24:35,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 289 transitions. [2025-01-09 22:24:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:24:35,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:35,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:35,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:24:35,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:35,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:35,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash 531160136, now seen corresponding path program 1 times [2025-01-09 22:24:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:35,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028109604] [2025-01-09 22:24:35,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:35,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:35,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:35,773 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-01-09 22:24:35,786 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-01-09 22:24:35,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:24:35,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:24:35,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:35,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:35,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:24:35,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:35,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:35,906 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:35,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028109604] [2025-01-09 22:24:35,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028109604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:35,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:35,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155715846] [2025-01-09 22:24:35,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:35,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:24:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:35,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:24:35,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:35,906 INFO L87 Difference]: Start difference. First operand 191 states and 289 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:36,034 INFO L93 Difference]: Finished difference Result 231 states and 304 transitions. [2025-01-09 22:24:36,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:36,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 22:24:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:36,036 INFO L225 Difference]: With dead ends: 231 [2025-01-09 22:24:36,036 INFO L226 Difference]: Without dead ends: 231 [2025-01-09 22:24:36,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:24:36,038 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:36,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 204 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-01-09 22:24:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 201. [2025-01-09 22:24:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 165 states have (on average 1.6424242424242423) internal successors, (271), 186 states have internal predecessors, (271), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-01-09 22:24:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2025-01-09 22:24:36,045 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 10 [2025-01-09 22:24:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:36,045 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2025-01-09 22:24:36,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2025-01-09 22:24:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:24:36,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:36,045 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:36,051 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-01-09 22:24:36,245 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 [2025-01-09 22:24:36,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:36,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:36,247 INFO L85 PathProgramCache]: Analyzing trace with hash 738472334, now seen corresponding path program 1 times [2025-01-09 22:24:36,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354466586] [2025-01-09 22:24:36,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:36,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:36,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:36,253 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-01-09 22:24:36,258 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-01-09 22:24:36,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:24:36,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:24:36,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:36,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:36,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:24:36,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:36,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:36,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:36,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354466586] [2025-01-09 22:24:36,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354466586] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:36,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:36,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-01-09 22:24:36,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893025094] [2025-01-09 22:24:36,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:36,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:24:36,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:36,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:24:36,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:24:36,658 INFO L87 Difference]: Start difference. First operand 201 states and 302 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:37,023 INFO L93 Difference]: Finished difference Result 269 states and 359 transitions. [2025-01-09 22:24:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:24:37,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 22:24:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:37,025 INFO L225 Difference]: With dead ends: 269 [2025-01-09 22:24:37,025 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 22:24:37,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:24:37,025 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 132 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:37,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 321 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:24:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 22:24:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2025-01-09 22:24:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 195 states have (on average 1.6358974358974359) internal successors, (319), 216 states have internal predecessors, (319), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-01-09 22:24:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 350 transitions. [2025-01-09 22:24:37,033 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 350 transitions. Word has length 14 [2025-01-09 22:24:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:37,033 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 350 transitions. [2025-01-09 22:24:37,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 350 transitions. [2025-01-09 22:24:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:24:37,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:37,033 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:37,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:24:37,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:37,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:37,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:37,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1417805820, now seen corresponding path program 1 times [2025-01-09 22:24:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:37,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047286922] [2025-01-09 22:24:37,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:37,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:37,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:37,237 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-01-09 22:24:37,239 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-01-09 22:24:37,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:24:37,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:24:37,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:37,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:37,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:24:37,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:37,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:37,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:37,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047286922] [2025-01-09 22:24:37,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047286922] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:37,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:37,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-01-09 22:24:37,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761311871] [2025-01-09 22:24:37,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:37,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:24:37,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:37,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:24:37,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:24:37,846 INFO L87 Difference]: Start difference. First operand 231 states and 350 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:39,036 INFO L93 Difference]: Finished difference Result 353 states and 485 transitions. [2025-01-09 22:24:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:24:39,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 22:24:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:39,038 INFO L225 Difference]: With dead ends: 353 [2025-01-09 22:24:39,038 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 22:24:39,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:24:39,039 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 324 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:39,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 315 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:24:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 22:24:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 269. [2025-01-09 22:24:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 233 states have (on average 1.6351931330472103) internal successors, (381), 254 states have internal predecessors, (381), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-01-09 22:24:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 412 transitions. [2025-01-09 22:24:39,046 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 412 transitions. Word has length 15 [2025-01-09 22:24:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:39,046 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 412 transitions. [2025-01-09 22:24:39,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 412 transitions. [2025-01-09 22:24:39,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:24:39,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:39,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:39,057 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-01-09 22:24:39,247 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 [2025-01-09 22:24:39,247 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:39,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1002307501, now seen corresponding path program 1 times [2025-01-09 22:24:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:39,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253659474] [2025-01-09 22:24:39,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:39,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:39,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:39,251 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-01-09 22:24:39,255 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-01-09 22:24:39,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:24:39,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:24:39,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:39,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:39,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:24:39,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:39,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:40,438 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253659474] [2025-01-09 22:24:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253659474] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:40,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-01-09 22:24:40,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907641064] [2025-01-09 22:24:40,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:40,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:24:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:40,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:24:40,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:24:40,440 INFO L87 Difference]: Start difference. First operand 269 states and 412 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:41,532 INFO L93 Difference]: Finished difference Result 492 states and 681 transitions. [2025-01-09 22:24:41,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:24:41,533 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 22:24:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:41,536 INFO L225 Difference]: With dead ends: 492 [2025-01-09 22:24:41,538 INFO L226 Difference]: Without dead ends: 492 [2025-01-09 22:24:41,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:24:41,539 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 369 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:41,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 341 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:24:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-01-09 22:24:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 371. [2025-01-09 22:24:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 331 states have (on average 1.6676737160120847) internal successors, (552), 352 states have internal predecessors, (552), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-09 22:24:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 594 transitions. [2025-01-09 22:24:41,557 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 594 transitions. Word has length 16 [2025-01-09 22:24:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:41,560 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 594 transitions. [2025-01-09 22:24:41,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 594 transitions. [2025-01-09 22:24:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:24:41,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:41,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:41,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:24:41,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:41,762 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:41,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1943920271, now seen corresponding path program 1 times [2025-01-09 22:24:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870072907] [2025-01-09 22:24:41,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:41,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:41,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:41,766 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-01-09 22:24:41,768 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-01-09 22:24:41,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:24:41,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:24:41,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:41,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:41,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 22:24:41,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:41,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:41,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:41,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870072907] [2025-01-09 22:24:41,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870072907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:41,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:41,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:24:41,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68999286] [2025-01-09 22:24:41,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:41,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:24:41,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:41,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:24:41,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:41,820 INFO L87 Difference]: Start difference. First operand 371 states and 594 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:41,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:41,827 INFO L93 Difference]: Finished difference Result 370 states and 590 transitions. [2025-01-09 22:24:41,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:24:41,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:24:41,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:41,829 INFO L225 Difference]: With dead ends: 370 [2025-01-09 22:24:41,829 INFO L226 Difference]: Without dead ends: 370 [2025-01-09 22:24:41,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:41,829 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:41,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-01-09 22:24:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-01-09 22:24:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 331 states have (on average 1.6555891238670695) internal successors, (548), 351 states have internal predecessors, (548), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-09 22:24:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 590 transitions. [2025-01-09 22:24:41,838 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 590 transitions. Word has length 18 [2025-01-09 22:24:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:41,838 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 590 transitions. [2025-01-09 22:24:41,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 590 transitions. [2025-01-09 22:24:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:24:41,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:41,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:41,847 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-01-09 22:24:42,039 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 [2025-01-09 22:24:42,039 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:42,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash 132632823, now seen corresponding path program 1 times [2025-01-09 22:24:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:42,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672722706] [2025-01-09 22:24:42,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:42,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:42,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:42,042 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-01-09 22:24:42,043 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-01-09 22:24:42,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:24:42,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:24:42,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:42,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:42,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:24:42,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:42,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:42,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:42,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672722706] [2025-01-09 22:24:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672722706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:42,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 22:24:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168349183] [2025-01-09 22:24:42,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:42,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:24:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:42,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:24:42,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:42,115 INFO L87 Difference]: Start difference. First operand 370 states and 590 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:42,131 INFO L93 Difference]: Finished difference Result 512 states and 817 transitions. [2025-01-09 22:24:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:24:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 22:24:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:42,133 INFO L225 Difference]: With dead ends: 512 [2025-01-09 22:24:42,133 INFO L226 Difference]: Without dead ends: 512 [2025-01-09 22:24:42,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:42,134 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:42,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 112 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-01-09 22:24:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 497. [2025-01-09 22:24:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 449 states have (on average 1.6547884187082404) internal successors, (743), 471 states have internal predecessors, (743), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2025-01-09 22:24:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 815 transitions. [2025-01-09 22:24:42,145 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 815 transitions. Word has length 19 [2025-01-09 22:24:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:42,146 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 815 transitions. [2025-01-09 22:24:42,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 815 transitions. [2025-01-09 22:24:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:24:42,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:42,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:42,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:24:42,351 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 [2025-01-09 22:24:42,351 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:42,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash 131986327, now seen corresponding path program 1 times [2025-01-09 22:24:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1851122083] [2025-01-09 22:24:42,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:42,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:42,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:42,354 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-01-09 22:24:42,355 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-01-09 22:24:42,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:24:42,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:24:42,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:42,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:42,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:24:42,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:42,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:42,409 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:42,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851122083] [2025-01-09 22:24:42,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851122083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:42,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:42,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:42,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686196932] [2025-01-09 22:24:42,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:42,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:24:42,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:42,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:24:42,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:42,410 INFO L87 Difference]: Start difference. First operand 497 states and 815 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:42,414 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2025-01-09 22:24:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:24:42,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 22:24:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:42,416 INFO L225 Difference]: With dead ends: 356 [2025-01-09 22:24:42,416 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 22:24:42,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:42,417 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:42,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 22:24:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-01-09 22:24:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 320 states have (on average 1.58125) internal successors, (506), 335 states have internal predecessors, (506), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-01-09 22:24:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 554 transitions. [2025-01-09 22:24:42,425 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 554 transitions. Word has length 19 [2025-01-09 22:24:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:42,425 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 554 transitions. [2025-01-09 22:24:42,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 554 transitions. [2025-01-09 22:24:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:24:42,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:42,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:42,434 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-01-09 22:24:42,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:42,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:42,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash -183349689, now seen corresponding path program 1 times [2025-01-09 22:24:42,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:42,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056717746] [2025-01-09 22:24:42,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:42,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:42,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:42,633 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-01-09 22:24:42,634 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-01-09 22:24:42,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:24:42,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:24:42,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:42,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:42,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:24:42,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:42,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:42,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056717746] [2025-01-09 22:24:42,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056717746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:42,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:42,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098183004] [2025-01-09 22:24:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:42,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:24:42,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:42,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:24:42,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:24:42,718 INFO L87 Difference]: Start difference. First operand 356 states and 554 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:42,738 INFO L93 Difference]: Finished difference Result 328 states and 476 transitions. [2025-01-09 22:24:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:42,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 22:24:42,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:42,740 INFO L225 Difference]: With dead ends: 328 [2025-01-09 22:24:42,740 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 22:24:42,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:24:42,740 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:42,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 22:24:42,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 315. [2025-01-09 22:24:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 282 states have (on average 1.5390070921985815) internal successors, (434), 297 states have internal predecessors, (434), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-01-09 22:24:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 470 transitions. [2025-01-09 22:24:42,754 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 470 transitions. Word has length 20 [2025-01-09 22:24:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:42,754 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 470 transitions. [2025-01-09 22:24:42,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 470 transitions. [2025-01-09 22:24:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:24:42,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:42,755 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-09 22:24:42,769 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-01-09 22:24:42,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:42,955 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:42,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash 447088533, now seen corresponding path program 2 times [2025-01-09 22:24:42,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:42,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776710229] [2025-01-09 22:24:42,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:24:42,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:42,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:42,958 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-01-09 22:24:42,960 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-01-09 22:24:43,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-09 22:24:43,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:24:43,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:24:43,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:43,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:24:43,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:43,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:43,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776710229] [2025-01-09 22:24:43,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776710229] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:43,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:43,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-09 22:24:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253034621] [2025-01-09 22:24:43,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:43,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:24:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:43,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:24:43,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:24:43,112 INFO L87 Difference]: Start difference. First operand 315 states and 470 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:43,180 INFO L93 Difference]: Finished difference Result 282 states and 393 transitions. [2025-01-09 22:24:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:24:43,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 22:24:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:43,182 INFO L225 Difference]: With dead ends: 282 [2025-01-09 22:24:43,182 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 22:24:43,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:24:43,182 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:43,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 252 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:24:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 22:24:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2025-01-09 22:24:43,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 235 states have (on average 1.4638297872340424) internal successors, (344), 250 states have internal predecessors, (344), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-01-09 22:24:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 380 transitions. [2025-01-09 22:24:43,189 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 380 transitions. Word has length 22 [2025-01-09 22:24:43,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:43,190 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 380 transitions. [2025-01-09 22:24:43,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:24:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 380 transitions. [2025-01-09 22:24:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:24:43,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:43,191 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:43,199 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-01-09 22:24:43,391 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 [2025-01-09 22:24:43,392 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:43,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2036164058, now seen corresponding path program 1 times [2025-01-09 22:24:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:43,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139980388] [2025-01-09 22:24:43,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:43,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:43,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:43,395 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-01-09 22:24:43,396 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-01-09 22:24:43,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:24:43,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:24:43,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:43,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:43,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 22:24:43,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:43,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:24:43,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:43,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139980388] [2025-01-09 22:24:43,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139980388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:24:43,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:24:43,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:24:43,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346855273] [2025-01-09 22:24:43,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:24:43,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:24:43,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:43,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:24:43,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:43,454 INFO L87 Difference]: Start difference. First operand 268 states and 380 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:43,459 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2025-01-09 22:24:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:24:43,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-09 22:24:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:43,460 INFO L225 Difference]: With dead ends: 197 [2025-01-09 22:24:43,460 INFO L226 Difference]: Without dead ends: 197 [2025-01-09 22:24:43,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:24:43,461 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:43,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:24:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-01-09 22:24:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-01-09 22:24:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 170 states have (on average 1.4294117647058824) internal successors, (243), 184 states have internal predecessors, (243), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2025-01-09 22:24:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 265 transitions. [2025-01-09 22:24:43,464 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 265 transitions. Word has length 25 [2025-01-09 22:24:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:43,464 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 265 transitions. [2025-01-09 22:24:43,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:24:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 265 transitions. [2025-01-09 22:24:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:24:43,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:43,465 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 22:24:43,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 22:24:43,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:43,666 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:43,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash -72255190, now seen corresponding path program 1 times [2025-01-09 22:24:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978647910] [2025-01-09 22:24:43,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:43,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:43,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:43,672 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-01-09 22:24:43,675 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-01-09 22:24:43,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:24:43,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:24:43,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:43,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:43,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:24:43,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:43,885 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-09 22:24:43,886 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 13 treesize of output 13 [2025-01-09 22:24:43,992 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-01-09 22:24:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:44,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:44,149 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-01-09 22:24:44,149 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 15 treesize of output 14 [2025-01-09 22:24:48,547 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-01-09 22:24:48,548 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 15 treesize of output 14 [2025-01-09 22:24:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:48,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:48,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978647910] [2025-01-09 22:24:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978647910] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:48,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:48,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2025-01-09 22:24:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007131302] [2025-01-09 22:24:48,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:48,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:24:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:48,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:24:48,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=3, NotChecked=0, Total=110 [2025-01-09 22:24:48,621 INFO L87 Difference]: Start difference. First operand 197 states and 265 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:24:52,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:24:55,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:55,839 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2025-01-09 22:24:55,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:24:55,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-01-09 22:24:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:55,844 INFO L225 Difference]: With dead ends: 220 [2025-01-09 22:24:55,844 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 22:24:55,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=119, Invalid=217, Unknown=6, NotChecked=0, Total=342 [2025-01-09 22:24:55,845 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 156 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 33 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:55,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 77 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 92 Invalid, 10 Unknown, 0 Unchecked, 6.0s Time] [2025-01-09 22:24:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 22:24:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 208. [2025-01-09 22:24:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 195 states have internal predecessors, (241), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2025-01-09 22:24:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 265 transitions. [2025-01-09 22:24:55,854 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 265 transitions. Word has length 27 [2025-01-09 22:24:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:55,858 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 265 transitions. [2025-01-09 22:24:55,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:24:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 265 transitions. [2025-01-09 22:24:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:24:55,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:55,858 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:55,874 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-01-09 22:24:56,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:56,060 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:24:56,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:24:56,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1506398064, now seen corresponding path program 1 times [2025-01-09 22:24:56,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:24:56,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215028240] [2025-01-09 22:24:56,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:24:56,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:24:56,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:24:56,064 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:24:56,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 22:24:56,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:24:56,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:24:56,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:24:56,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:24:56,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:24:56,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:24:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:56,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:24:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:24:57,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:24:57,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215028240] [2025-01-09 22:24:57,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215028240] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:24:57,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:24:57,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-09 22:24:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775924825] [2025-01-09 22:24:57,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:24:57,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:24:57,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:24:57,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:24:57,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:24:57,956 INFO L87 Difference]: Start difference. First operand 208 states and 265 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:24:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:24:59,818 INFO L93 Difference]: Finished difference Result 313 states and 367 transitions. [2025-01-09 22:24:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:24:59,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-01-09 22:24:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:24:59,821 INFO L225 Difference]: With dead ends: 313 [2025-01-09 22:24:59,821 INFO L226 Difference]: Without dead ends: 313 [2025-01-09 22:24:59,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:24:59,822 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 216 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:24:59,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 213 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 22:24:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-01-09 22:24:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 280. [2025-01-09 22:24:59,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 250 states have (on average 1.296) internal successors, (324), 265 states have internal predecessors, (324), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-01-09 22:24:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 347 transitions. [2025-01-09 22:24:59,828 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 347 transitions. Word has length 28 [2025-01-09 22:24:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:24:59,828 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 347 transitions. [2025-01-09 22:24:59,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:24:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 347 transitions. [2025-01-09 22:24:59,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:24:59,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:24:59,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:24:59,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-09 22:25:00,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:25:00,034 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:25:00,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:25:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash -717762487, now seen corresponding path program 1 times [2025-01-09 22:25:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:25:00,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1892288434] [2025-01-09 22:25:00,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:25:00,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:25:00,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:25:00,037 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:25:00,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-09 22:25:00,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:25:00,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:25:00,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:25:00,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:25:00,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:25:00,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:25:02,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:25:02,226 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-01-09 22:25:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:25:02,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:25:07,924 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:25:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892288434] [2025-01-09 22:25:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892288434] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:25:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [784197824] [2025-01-09 22:25:07,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:25:07,925 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 22:25:07,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 22:25:07,927 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 22:25:07,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-01-09 22:25:07,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:25:08,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:25:08,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:25:08,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:25:08,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:25:08,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:25:10,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:25:10,110 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-01-09 22:25:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:25:10,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:25:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [784197824] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:25:15,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:25:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2025-01-09 22:25:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393265319] [2025-01-09 22:25:15,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:25:15,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:25:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:25:15,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:25:15,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2025-01-09 22:25:15,145 INFO L87 Difference]: Start difference. First operand 280 states and 347 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:25:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:25:18,417 INFO L93 Difference]: Finished difference Result 294 states and 354 transitions. [2025-01-09 22:25:18,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:25:18,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-01-09 22:25:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:25:18,420 INFO L225 Difference]: With dead ends: 294 [2025-01-09 22:25:18,420 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 22:25:18,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=152, Invalid=399, Unknown=1, NotChecked=0, Total=552 [2025-01-09 22:25:18,421 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 129 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:25:18,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 113 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 22:25:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 22:25:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 280. [2025-01-09 22:25:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 250 states have (on average 1.28) internal successors, (320), 265 states have internal predecessors, (320), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-01-09 22:25:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 343 transitions. [2025-01-09 22:25:18,425 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 343 transitions. Word has length 29 [2025-01-09 22:25:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:25:18,425 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 343 transitions. [2025-01-09 22:25:18,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:25:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 343 transitions. [2025-01-09 22:25:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:25:18,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:25:18,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:25:18,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-09 22:25:18,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2025-01-09 22:25:18,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 22:25:18,829 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:25:18,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:25:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash 546300317, now seen corresponding path program 1 times [2025-01-09 22:25:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:25:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083592861] [2025-01-09 22:25:18,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:25:18,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:25:18,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:25:18,831 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:25:18,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-09 22:25:18,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:25:18,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:25:18,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:25:18,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:25:18,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:25:18,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:25:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:25:19,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:25:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:25:20,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:25:20,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083592861] [2025-01-09 22:25:20,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083592861] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:25:20,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:25:20,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-01-09 22:25:20,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578362601] [2025-01-09 22:25:20,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:25:20,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:25:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:25:20,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:25:20,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:25:20,736 INFO L87 Difference]: Start difference. First operand 280 states and 343 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:25:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:25:22,381 INFO L93 Difference]: Finished difference Result 294 states and 343 transitions. [2025-01-09 22:25:22,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:25:22,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-01-09 22:25:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:25:22,383 INFO L225 Difference]: With dead ends: 294 [2025-01-09 22:25:22,384 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 22:25:22,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:25:22,384 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 262 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:25:22,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 207 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 22:25:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 22:25:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 280. [2025-01-09 22:25:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 250 states have (on average 1.248) internal successors, (312), 265 states have internal predecessors, (312), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-01-09 22:25:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2025-01-09 22:25:22,388 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 29 [2025-01-09 22:25:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:25:22,388 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2025-01-09 22:25:22,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:25:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2025-01-09 22:25:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:25:22,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:25:22,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:25:22,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-09 22:25:22,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:25:22,590 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:25:22,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:25:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1181916468, now seen corresponding path program 1 times [2025-01-09 22:25:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:25:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331534649] [2025-01-09 22:25:22,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:25:22,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:25:22,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:25:22,594 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:25:22,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-09 22:25:22,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:25:22,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:25:22,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:25:22,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:25:22,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:25:22,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:25:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:25:23,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:25:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:25:23,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:25:23,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331534649] [2025-01-09 22:25:23,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331534649] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:25:23,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:25:23,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2025-01-09 22:25:23,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816116101] [2025-01-09 22:25:23,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:25:23,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:25:23,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:25:23,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:25:23,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:25:23,393 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:25:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:25:23,492 INFO L93 Difference]: Finished difference Result 279 states and 334 transitions. [2025-01-09 22:25:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:25:23,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-01-09 22:25:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:25:23,497 INFO L225 Difference]: With dead ends: 279 [2025-01-09 22:25:23,497 INFO L226 Difference]: Without dead ends: 279 [2025-01-09 22:25:23,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:25:23,498 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 33 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:25:23,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 80 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:25:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-09 22:25:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-01-09 22:25:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 250 states have (on average 1.244) internal successors, (311), 264 states have internal predecessors, (311), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-01-09 22:25:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 334 transitions. [2025-01-09 22:25:23,508 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 334 transitions. Word has length 40 [2025-01-09 22:25:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:25:23,509 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 334 transitions. [2025-01-09 22:25:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:25:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 334 transitions. [2025-01-09 22:25:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:25:23,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:25:23,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:25:23,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-09 22:25:23,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:25:23,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:25:23,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:25:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2015295062, now seen corresponding path program 1 times [2025-01-09 22:25:23,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:25:23,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791919600] [2025-01-09 22:25:23,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:25:23,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:25:23,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:25:23,714 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:25:23,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-09 22:25:23,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:25:23,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:25:23,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:25:23,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:25:23,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:25:23,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:25:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:25:24,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:25:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:25:24,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:25:24,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791919600] [2025-01-09 22:25:24,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791919600] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:25:24,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:25:24,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2025-01-09 22:25:24,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345386331] [2025-01-09 22:25:24,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:25:24,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:25:24,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:25:24,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:25:24,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:25:24,773 INFO L87 Difference]: Start difference. First operand 279 states and 334 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:25:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:25:24,996 INFO L93 Difference]: Finished difference Result 278 states and 333 transitions. [2025-01-09 22:25:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:25:24,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2025-01-09 22:25:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:25:25,000 INFO L225 Difference]: With dead ends: 278 [2025-01-09 22:25:25,000 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 22:25:25,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:25:25,005 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:25:25,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 69 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:25:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 22:25:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-01-09 22:25:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 250 states have (on average 1.24) internal successors, (310), 263 states have internal predecessors, (310), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-01-09 22:25:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 333 transitions. [2025-01-09 22:25:25,013 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 333 transitions. Word has length 41 [2025-01-09 22:25:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:25:25,014 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 333 transitions. [2025-01-09 22:25:25,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:25:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 333 transitions. [2025-01-09 22:25:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:25:25,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:25:25,014 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:25:25,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-01-09 22:25:25,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:25:25,215 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-01-09 22:25:25,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:25:25,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1156622474, now seen corresponding path program 1 times [2025-01-09 22:25:25,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:25:25,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742193511] [2025-01-09 22:25:25,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:25:25,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:25:25,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:25:25,217 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:25:25,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-09 22:25:25,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:25:25,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:25:25,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:25:25,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:25:25,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 22:25:25,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:25:26,287 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-09 22:25:26,290 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 13 treesize of output 13 [2025-01-09 22:25:26,804 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