./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-48c9605-m [2025-02-08 06:26:56,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:26:56,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:26:56,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:26:56,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:26:56,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:26:56,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:26:56,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:26:56,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:26:56,802 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:26:56,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:26:56,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:26:56,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:26:56,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:26:56,803 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:26:56,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:26:56,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:26:56,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:26:56,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:26:56,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:26:56,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:26:56,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:26:56,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:26:56,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:26:56,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:26:56,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:26:56,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:26:56,805 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-02-08 06:26:57,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:26:57,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:26:57,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:26:57,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:26:57,098 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:26:57,100 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-02-08 06:26:58,429 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d43bebdba/ed4b905f3e414c04a14d81be54036878/FLAG89c6ca397 [2025-02-08 06:26:58,803 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:26:58,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-02-08 06:26:58,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d43bebdba/ed4b905f3e414c04a14d81be54036878/FLAG89c6ca397 [2025-02-08 06:26:59,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d43bebdba/ed4b905f3e414c04a14d81be54036878 [2025-02-08 06:26:59,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:26:59,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:26:59,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:26:59,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:26:59,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:26:59,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d795288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59, skipping insertion in model container [2025-02-08 06:26:59,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:26:59,312 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:26:59,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:26:59,325 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:26:59,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:26:59,421 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:26:59,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59 WrapperNode [2025-02-08 06:26:59,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:26:59,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:26:59,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:26:59,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:26:59,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,475 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-02-08 06:26:59,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:26:59,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:26:59,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:26:59,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:26:59,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,520 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 [6, 9, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-02-08 06:26:59,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:26:59,538 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:26:59,538 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:26:59,538 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:26:59,539 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (1/1) ... [2025-02-08 06:26:59,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:26:59,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:59,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:26:59,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:26:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-02-08 06:26:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:26:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:26:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:26:59,688 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:26:59,689 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:26:59,875 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L695: havoc ##fun~~TO~VOID_#in~#fp#1.base, ##fun~~TO~VOID_#in~#fp#1.offset;assume { :end_inline_##fun~~TO~VOID } true;havoc #t~mem5#1.base, #t~mem5#1.offset; [2025-02-08 06:26:59,918 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-08 06:26:59,918 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:26:59,929 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:26:59,931 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:26:59,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:59 BoogieIcfgContainer [2025-02-08 06:26:59,931 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:26:59,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:26:59,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:26:59,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:26:59,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:26:59" (1/3) ... [2025-02-08 06:26:59,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e0bb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:26:59, skipping insertion in model container [2025-02-08 06:26:59,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:59" (2/3) ... [2025-02-08 06:26:59,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e0bb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:26:59, skipping insertion in model container [2025-02-08 06:26:59,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:59" (3/3) ... [2025-02-08 06:26:59,943 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2025-02-08 06:26:59,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:26:59,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-02-08 06:26:59,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:27:00,001 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;@38248c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:27:00,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-08 06:27:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 32 states have (on average 1.84375) internal successors, (59), 55 states have internal predecessors, (59), 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-02-08 06:27:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:27:00,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:00,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:27:00,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:00,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:00,016 INFO L85 PathProgramCache]: Analyzing trace with hash 89875439, now seen corresponding path program 1 times [2025-02-08 06:27:00,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:00,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441457917] [2025-02-08 06:27:00,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:00,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:00,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:27:00,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:27:00,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:00,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:00,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441457917] [2025-02-08 06:27:00,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441457917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:00,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:00,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:27:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066765828] [2025-02-08 06:27:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:00,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:27:00,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:00,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:27:00,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:27:00,369 INFO L87 Difference]: Start difference. First operand has 60 states, 32 states have (on average 1.84375) internal successors, (59), 55 states have internal predecessors, (59), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:27:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:00,437 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2025-02-08 06:27:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:27:00,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-02-08 06:27:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:00,444 INFO L225 Difference]: With dead ends: 59 [2025-02-08 06:27:00,444 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 06:27:00,446 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-02-08 06:27:00,448 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 52 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:00,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 55 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:27:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 06:27:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 06:27:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.6) internal successors, (48), 46 states have internal predecessors, (48), 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-02-08 06:27:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2025-02-08 06:27:00,479 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 5 [2025-02-08 06:27:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:00,479 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2025-02-08 06:27:00,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:27:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2025-02-08 06:27:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:27:00,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:00,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:27:00,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:27:00,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:00,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash 89875440, now seen corresponding path program 1 times [2025-02-08 06:27:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:00,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293276082] [2025-02-08 06:27:00,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:00,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:00,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:27:00,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:27:00,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:00,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:00,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293276082] [2025-02-08 06:27:00,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293276082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:00,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:00,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:27:00,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172339275] [2025-02-08 06:27:00,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:00,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:27:00,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:00,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:27:00,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:27:00,695 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:27:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:00,812 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2025-02-08 06:27:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:27:00,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-02-08 06:27:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:00,813 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:27:00,814 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 06:27:00,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:27:00,815 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 76 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:00,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 87 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 06:27:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2025-02-08 06:27:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.6) internal successors, (64), 56 states have internal predecessors, (64), 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-02-08 06:27:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2025-02-08 06:27:00,826 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 5 [2025-02-08 06:27:00,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:00,826 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2025-02-08 06:27:00,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:27:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2025-02-08 06:27:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:27:00,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:00,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:27:00,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:27:00,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:00,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1508828667, now seen corresponding path program 1 times [2025-02-08 06:27:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:00,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541055957] [2025-02-08 06:27:00,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:00,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:00,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:27:00,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:27:00,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:00,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:01,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:01,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541055957] [2025-02-08 06:27:01,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541055957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:01,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:01,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:27:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303261880] [2025-02-08 06:27:01,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:01,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:27:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:01,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:27:01,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:27:01,107 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-02-08 06:27:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:01,218 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2025-02-08 06:27:01,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:27:01,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-02-08 06:27:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:01,221 INFO L225 Difference]: With dead ends: 65 [2025-02-08 06:27:01,221 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 06:27:01,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:27:01,222 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 75 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:01,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 91 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 06:27:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2025-02-08 06:27:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.575) 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-02-08 06:27:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2025-02-08 06:27:01,231 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 6 [2025-02-08 06:27:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:01,231 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2025-02-08 06:27:01,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-02-08 06:27:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2025-02-08 06:27:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:27:01,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:01,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:01,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:27:01,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:01,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash 470951597, now seen corresponding path program 1 times [2025-02-08 06:27:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088286307] [2025-02-08 06:27:01,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:01,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:27:01,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:27:01,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:01,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:01,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:01,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088286307] [2025-02-08 06:27:01,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088286307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:01,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:27:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629036658] [2025-02-08 06:27:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:01,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:27:01,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:01,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:27:01,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:27:01,505 INFO L87 Difference]: Start difference. First operand 61 states and 69 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-02-08 06:27:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:01,656 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2025-02-08 06:27:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:27:01,657 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-02-08 06:27:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:01,657 INFO L225 Difference]: With dead ends: 64 [2025-02-08 06:27:01,659 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 06:27:01,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:27:01,660 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 71 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:01,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 06:27:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2025-02-08 06:27:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 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-02-08 06:27:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2025-02-08 06:27:01,670 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 7 [2025-02-08 06:27:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:01,671 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-02-08 06:27:01,671 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-02-08 06:27:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2025-02-08 06:27:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:27:01,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:01,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:01,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:27:01,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:01,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1714597635, now seen corresponding path program 1 times [2025-02-08 06:27:01,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:01,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215612064] [2025-02-08 06:27:01,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:01,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:01,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:27:01,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:27:01,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:01,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:01,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:01,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215612064] [2025-02-08 06:27:01,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215612064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:01,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:01,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:27:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298817215] [2025-02-08 06:27:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:01,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:27:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:01,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:27:01,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:27:01,763 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-02-08 06:27:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:01,856 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2025-02-08 06:27:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:27:01,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-02-08 06:27:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:01,858 INFO L225 Difference]: With dead ends: 108 [2025-02-08 06:27:01,858 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 06:27:01,858 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-02-08 06:27:01,859 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 144 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:01,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 98 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 06:27:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 83. [2025-02-08 06:27:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.540983606557377) internal successors, (94), 77 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2025-02-08 06:27:01,875 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 8 [2025-02-08 06:27:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:01,875 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2025-02-08 06:27:01,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-02-08 06:27:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2025-02-08 06:27:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:27:01,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:01,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:01,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:27:01,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:01,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1612919147, now seen corresponding path program 1 times [2025-02-08 06:27:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:01,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95630180] [2025-02-08 06:27:01,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:01,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:27:01,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:27:01,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:01,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:01,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:01,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95630180] [2025-02-08 06:27:01,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95630180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:01,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:01,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:27:01,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262249833] [2025-02-08 06:27:01,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:01,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:27:01,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:01,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:27:01,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:27:02,000 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) 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-02-08 06:27:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:02,088 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2025-02-08 06:27:02,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:27:02,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) 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-02-08 06:27:02,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:02,090 INFO L225 Difference]: With dead ends: 105 [2025-02-08 06:27:02,090 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 06:27:02,090 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-02-08 06:27:02,091 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 107 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:02,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 115 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:02,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 06:27:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2025-02-08 06:27:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 77 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2025-02-08 06:27:02,101 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 9 [2025-02-08 06:27:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:02,101 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-02-08 06:27:02,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) 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-02-08 06:27:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2025-02-08 06:27:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:27:02,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:02,102 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:02,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:27:02,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:02,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1326187263, now seen corresponding path program 1 times [2025-02-08 06:27:02,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:02,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638767002] [2025-02-08 06:27:02,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:02,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:02,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:27:02,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:27:02,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:02,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638767002] [2025-02-08 06:27:02,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638767002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377073820] [2025-02-08 06:27:02,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:02,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:02,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:02,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:02,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:27:02,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:27:02,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:27:02,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:02,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:02,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 06:27:02,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:02,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377073820] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:02,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:02,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-02-08 06:27:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104624955] [2025-02-08 06:27:02,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:02,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:27:02,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:02,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:27:02,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:27:02,648 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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-02-08 06:27:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:02,780 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2025-02-08 06:27:02,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:27:02,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 13 [2025-02-08 06:27:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:02,782 INFO L225 Difference]: With dead ends: 86 [2025-02-08 06:27:02,782 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 06:27:02,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:27:02,783 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 126 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:02,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 217 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 06:27:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2025-02-08 06:27:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.40625) internal successors, (90), 77 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2025-02-08 06:27:02,788 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 13 [2025-02-08 06:27:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:02,789 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2025-02-08 06:27:02,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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-02-08 06:27:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2025-02-08 06:27:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:27:02,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:02,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:02,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:27:02,994 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-02-08 06:27:02,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:02,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1837867818, now seen corresponding path program 1 times [2025-02-08 06:27:02,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:02,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099914973] [2025-02-08 06:27:02,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:02,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:03,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:27:03,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:27:03,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:03,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:03,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099914973] [2025-02-08 06:27:03,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099914973] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:03,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362226526] [2025-02-08 06:27:03,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:03,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:03,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:03,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:03,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:27:03,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:27:03,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:27:03,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:03,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:03,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 06:27:03,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:03,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:03,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362226526] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:03,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:03,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-02-08 06:27:03,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503196257] [2025-02-08 06:27:03,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:03,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:27:03,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:03,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:27:03,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:27:03,518 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-02-08 06:27:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:03,699 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2025-02-08 06:27:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:27:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-02-08 06:27:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:03,700 INFO L225 Difference]: With dead ends: 85 [2025-02-08 06:27:03,700 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 06:27:03,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:27:03,701 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 102 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:03,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 176 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 06:27:03,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2025-02-08 06:27:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.375) internal successors, (88), 76 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2025-02-08 06:27:03,711 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 14 [2025-02-08 06:27:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:03,711 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2025-02-08 06:27:03,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-02-08 06:27:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2025-02-08 06:27:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:27:03,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:03,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:03,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:27:03,915 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-02-08 06:27:03,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:03,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1139327492, now seen corresponding path program 1 times [2025-02-08 06:27:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:03,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991416887] [2025-02-08 06:27:03,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:03,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:27:03,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:27:03,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:03,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:04,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:04,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991416887] [2025-02-08 06:27:04,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991416887] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:04,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048303070] [2025-02-08 06:27:04,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:04,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:04,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:04,116 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:04,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:27:04,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:27:04,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:27:04,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:04,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:04,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:27:04,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:04,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:04,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048303070] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:04,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:04,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-02-08 06:27:04,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430110701] [2025-02-08 06:27:04,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:04,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:27:04,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:04,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:27:04,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:27:04,541 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-02-08 06:27:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:04,777 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-02-08 06:27:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:27:04,777 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-02-08 06:27:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:04,778 INFO L225 Difference]: With dead ends: 84 [2025-02-08 06:27:04,778 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 06:27:04,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:27:04,779 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 131 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:04,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 280 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 06:27:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2025-02-08 06:27:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.34375) internal successors, (86), 75 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2025-02-08 06:27:04,788 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 15 [2025-02-08 06:27:04,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:04,788 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2025-02-08 06:27:04,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-02-08 06:27:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2025-02-08 06:27:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:27:04,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:04,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:04,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:27:04,993 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-02-08 06:27:04,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:04,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1708016339, now seen corresponding path program 1 times [2025-02-08 06:27:04,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:04,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743182105] [2025-02-08 06:27:04,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:04,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:04,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:27:05,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:27:05,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:05,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:05,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:05,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743182105] [2025-02-08 06:27:05,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743182105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:05,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:05,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:27:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019562240] [2025-02-08 06:27:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:05,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:27:05,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:05,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:27:05,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:27:05,022 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-08 06:27:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:05,024 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2025-02-08 06:27:05,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:27:05,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 17 [2025-02-08 06:27:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:05,025 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:27:05,025 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 06:27:05,025 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-02-08 06:27:05,026 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:05,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:27:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 06:27:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-08 06:27:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.280701754385965) internal successors, (73), 62 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-02-08 06:27:05,029 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 17 [2025-02-08 06:27:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:05,029 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-02-08 06:27:05,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-08 06:27:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2025-02-08 06:27:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:27:05,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:05,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:05,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:27:05,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:05,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1409299131, now seen corresponding path program 1 times [2025-02-08 06:27:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:05,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027370454] [2025-02-08 06:27:05,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:05,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:05,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:27:05,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:27:05,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:05,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:27:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:05,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027370454] [2025-02-08 06:27:05,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027370454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:05,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:05,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:27:05,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183904866] [2025-02-08 06:27:05,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:05,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:27:05,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:05,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:27:05,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:27:05,092 INFO L87 Difference]: Start difference. First operand 68 states and 79 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-02-08 06:27:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:05,093 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2025-02-08 06:27:05,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:27:05,093 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-02-08 06:27:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:05,097 INFO L225 Difference]: With dead ends: 62 [2025-02-08 06:27:05,098 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:27:05,098 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-02-08 06:27:05,098 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:05,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:27:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:27:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 06:27:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-02-08 06:27:05,101 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 18 [2025-02-08 06:27:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:05,101 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-02-08 06:27:05,101 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-02-08 06:27:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-02-08 06:27:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:27:05,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:05,109 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:05,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:27:05,109 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:05,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1626028033, now seen corresponding path program 1 times [2025-02-08 06:27:05,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:05,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630416585] [2025-02-08 06:27:05,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:05,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:05,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:27:05,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:27:05,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:05,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:05,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630416585] [2025-02-08 06:27:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630416585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743150080] [2025-02-08 06:27:05,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:05,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:05,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:05,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:05,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:27:05,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:27:05,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:27:05,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:05,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:05,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 06:27:05,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:05,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:05,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743150080] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:05,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:05,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 06:27:05,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373429462] [2025-02-08 06:27:05,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:05,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:27:05,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:05,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:27:05,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:27:05,517 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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-02-08 06:27:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:05,615 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-02-08 06:27:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:27:05,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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 29 [2025-02-08 06:27:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:05,618 INFO L225 Difference]: With dead ends: 82 [2025-02-08 06:27:05,618 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 06:27:05,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:27:05,619 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 59 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:05,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 61 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 06:27:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-02-08 06:27:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2025-02-08 06:27:05,624 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 29 [2025-02-08 06:27:05,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:05,624 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2025-02-08 06:27:05,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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-02-08 06:27:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2025-02-08 06:27:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:27:05,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:05,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:05,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:27:05,827 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-02-08 06:27:05,827 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:05,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1132738515, now seen corresponding path program 1 times [2025-02-08 06:27:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:05,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727945564] [2025-02-08 06:27:05,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:05,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:27:05,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:27:05,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:05,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:05,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:05,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727945564] [2025-02-08 06:27:05,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727945564] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:05,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997695158] [2025-02-08 06:27:05,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:05,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:05,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:05,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:05,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:27:05,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:27:06,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:27:06,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:06,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:06,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 06:27:06,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:06,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:27:06,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997695158] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:06,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:06,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 06:27:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470625558] [2025-02-08 06:27:06,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:06,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:27:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:06,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:27:06,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:27:06,286 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:06,401 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-02-08 06:27:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:27:06,401 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2025-02-08 06:27:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:06,402 INFO L225 Difference]: With dead ends: 81 [2025-02-08 06:27:06,402 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 06:27:06,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:27:06,403 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:06,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 81 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 06:27:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 06:27:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-02-08 06:27:06,408 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 30 [2025-02-08 06:27:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:06,409 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-02-08 06:27:06,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-02-08 06:27:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 06:27:06,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:06,410 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:06,425 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-02-08 06:27:06,617 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-02-08 06:27:06,617 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:06,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:06,618 INFO L85 PathProgramCache]: Analyzing trace with hash 326633859, now seen corresponding path program 1 times [2025-02-08 06:27:06,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:06,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891773572] [2025-02-08 06:27:06,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:06,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:06,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 06:27:06,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 06:27:06,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:06,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891773572] [2025-02-08 06:27:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891773572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128436844] [2025-02-08 06:27:06,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:06,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:06,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:06,745 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:06,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:27:06,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 06:27:06,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 06:27:06,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:06,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:06,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 06:27:06,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:06,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:07,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128436844] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:07,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:07,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 06:27:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489921811] [2025-02-08 06:27:07,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:07,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:27:07,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:07,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:27:07,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:27:07,112 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:27:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:07,199 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2025-02-08 06:27:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:27:07,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-02-08 06:27:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:07,200 INFO L225 Difference]: With dead ends: 80 [2025-02-08 06:27:07,200 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 06:27:07,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:27:07,200 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 59 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:07,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 58 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 06:27:07,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-08 06:27:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 73 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-02-08 06:27:07,206 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 50 [2025-02-08 06:27:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:07,206 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-02-08 06:27:07,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:27:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-02-08 06:27:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 06:27:07,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:07,207 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:07,218 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-02-08 06:27:07,407 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-02-08 06:27:07,408 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:07,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1535715051, now seen corresponding path program 1 times [2025-02-08 06:27:07,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:07,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863111589] [2025-02-08 06:27:07,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:07,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:07,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:27:07,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:27:07,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:07,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:07,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:07,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863111589] [2025-02-08 06:27:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863111589] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:27:07,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352541544] [2025-02-08 06:27:07,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:07,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:27:07,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:27:07,560 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:27:07,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:27:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:27:07,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:27:07,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:07,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:07,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 06:27:07,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:27:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:07,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:27:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 06:27:08,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352541544] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:27:08,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:27:08,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 06:27:08,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611538884] [2025-02-08 06:27:08,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:27:08,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:27:08,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:08,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:27:08,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:27:08,009 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:27:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:08,121 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-02-08 06:27:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:27:08,122 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2025-02-08 06:27:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:08,123 INFO L225 Difference]: With dead ends: 79 [2025-02-08 06:27:08,123 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 06:27:08,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:27:08,124 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 88 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:08,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 78 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:27:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 06:27:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-08 06:27:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.125) internal successors, (81), 72 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:27:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-02-08 06:27:08,130 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 51 [2025-02-08 06:27:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:08,132 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-02-08 06:27:08,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:27:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-02-08 06:27:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:27:08,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:27:08,135 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:08,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 06:27:08,336 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-02-08 06:27:08,336 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-02-08 06:27:08,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:27:08,337 INFO L85 PathProgramCache]: Analyzing trace with hash -444921830, now seen corresponding path program 1 times [2025-02-08 06:27:08,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:27:08,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615424816] [2025-02-08 06:27:08,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:27:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:27:08,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 06:27:08,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:27:08,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:27:08,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:27:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-08 06:27:08,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:27:08,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615424816] [2025-02-08 06:27:08,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615424816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:27:08,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:27:08,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:27:08,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426144762] [2025-02-08 06:27:08,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:27:08,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:27:08,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:27:08,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:27:08,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:27:08,440 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:27:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:27:08,460 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2025-02-08 06:27:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:27:08,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2025-02-08 06:27:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:27:08,461 INFO L225 Difference]: With dead ends: 78 [2025-02-08 06:27:08,461 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:27:08,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:27:08,461 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:27:08,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:27:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:27:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:27:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:27:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:27:08,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2025-02-08 06:27:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:27:08,464 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:27:08,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:27:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:27:08,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:27:08,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE (19 of 20 remaining) [2025-02-08 06:27:08,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE (18 of 20 remaining) [2025-02-08 06:27:08,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (17 of 20 remaining) [2025-02-08 06:27:08,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr3ASSERT_VIOLATIONMEMORY_FREE (16 of 20 remaining) [2025-02-08 06:27:08,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr4ASSERT_VIOLATIONMEMORY_FREE (15 of 20 remaining) [2025-02-08 06:27:08,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE (14 of 20 remaining) [2025-02-08 06:27:08,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr6ASSERT_VIOLATIONMEMORY_FREE (13 of 20 remaining) [2025-02-08 06:27:08,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE (12 of 20 remaining) [2025-02-08 06:27:08,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 20 remaining) [2025-02-08 06:27:08,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2025-02-08 06:27:08,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-02-08 06:27:08,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2025-02-08 06:27:08,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2025-02-08 06:27:08,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2025-02-08 06:27:08,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2025-02-08 06:27:08,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2025-02-08 06:27:08,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2025-02-08 06:27:08,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 20 remaining) [2025-02-08 06:27:08,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location parse_inputErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 20 remaining) [2025-02-08 06:27:08,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 20 remaining) [2025-02-08 06:27:08,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:27:08,473 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:27:08,475 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:27:08,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:27:08 BoogieIcfgContainer [2025-02-08 06:27:08,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:27:08,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:27:08,480 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:27:08,480 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:27:08,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:59" (3/4) ... [2025-02-08 06:27:08,482 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:27:08,487 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure parse_input [2025-02-08 06:27:08,493 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-08 06:27:08,494 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 06:27:08,494 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 06:27:08,494 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 06:27:08,494 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:27:08,571 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:27:08,572 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:27:08,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:27:08,574 INFO L158 Benchmark]: Toolchain (without parser) took 9562.16ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.6MB in the beginning and 100.0MB in the end (delta: 22.6MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2025-02-08 06:27:08,574 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:27:08,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.14ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 102.6MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:27:08,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.76ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 100.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:27:08,575 INFO L158 Benchmark]: Boogie Preprocessor took 58.28ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 99.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:27:08,575 INFO L158 Benchmark]: IcfgBuilder took 392.94ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 81.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:27:08,575 INFO L158 Benchmark]: TraceAbstraction took 8544.50ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 81.2MB in the beginning and 105.3MB in the end (delta: -24.1MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2025-02-08 06:27:08,576 INFO L158 Benchmark]: Witness Printer took 93.20ms. Allocated memory is still 201.3MB. Free memory was 105.3MB in the beginning and 100.0MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:27:08,580 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.14ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 102.6MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.76ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 100.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.28ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 99.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 392.94ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 81.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8544.50ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 81.2MB in the beginning and 105.3MB in the end (delta: -24.1MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 93.20ms. Allocated memory is still 201.3MB. Free memory was 105.3MB in the beginning and 100.0MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 718]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 718]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 718]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 717]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 717]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 717]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 707]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 707]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 707]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 693]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 693]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 693]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 693]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 721]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1187 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1187 mSDsluCounter, 1635 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1081 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1131 IncrementalHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 554 mSDtfsCounter, 1131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 497 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=5, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 69 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 717 ConstructedInterpolants, 0 QuantifiedInterpolants, 6025 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1370 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 570/831 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:27:08,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE