./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:53:01,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:53:01,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:53:01,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:53:01,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:53:01,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:53:01,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:53:01,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:53:01,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:53:01,114 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:53:01,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:53:01,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:53:01,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:53:01,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:53:01,115 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:53:01,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:53:01,115 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:53:01,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:53:01,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:53:01,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:53:01,116 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:53:01,116 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:53:01,116 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:53:01,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:53:01,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:53:01,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:53:01,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:53:01,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:53:01,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:53:01,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:53:01,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:53:01,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:53:01,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:53:01,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:53:01,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:53:01,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:53:01,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:53:01,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:53:01,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:53:01,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:53:01,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:53:01,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:53:01,118 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c [2025-03-08 22:53:01,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:53:01,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:53:01,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:53:01,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:53:01,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:53:01,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2025-03-08 22:53:02,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef5f7817/24c98dad84b0401092260b8f5e9803b7/FLAGaf561b7f0 [2025-03-08 22:53:02,725 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:53:02,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2025-03-08 22:53:02,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef5f7817/24c98dad84b0401092260b8f5e9803b7/FLAGaf561b7f0 [2025-03-08 22:53:02,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef5f7817/24c98dad84b0401092260b8f5e9803b7 [2025-03-08 22:53:02,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:53:02,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:53:02,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:53:02,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:53:02,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:53:02,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:53:02" (1/1) ... [2025-03-08 22:53:02,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543e9065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:02, skipping insertion in model container [2025-03-08 22:53:02,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:53:02" (1/1) ... [2025-03-08 22:53:02,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:53:02,975 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:53:02,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:53:02,986 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:53:03,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:53:03,050 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:53:03,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03 WrapperNode [2025-03-08 22:53:03,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:53:03,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:53:03,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:53:03,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:53:03,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,079 INFO L138 Inliner]: procedures = 168, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2025-03-08 22:53:03,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:53:03,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:53:03,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:53:03,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:53:03,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,101 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-03-08 22:53:03,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:53:03,109 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:53:03,109 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:53:03,109 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:53:03,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (1/1) ... [2025-03-08 22:53:03,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:53:03,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:03,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:53:03,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:53:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:53:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:53:03,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:53:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-03-08 22:53:03,151 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-03-08 22:53:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:53:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:53:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:53:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:53:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:53:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:53:03,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:53:03,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:53:03,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:53:03,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:53:03,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:53:03,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:53:03,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:53:03,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:53:03,225 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:53:03,226 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:53:03,428 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-08 22:53:03,429 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:53:03,437 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:53:03,438 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:53:03,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:53:03 BoogieIcfgContainer [2025-03-08 22:53:03,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:53:03,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:53:03,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:53:03,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:53:03,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:53:02" (1/3) ... [2025-03-08 22:53:03,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a401eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:53:03, skipping insertion in model container [2025-03-08 22:53:03,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:03" (2/3) ... [2025-03-08 22:53:03,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a401eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:53:03, skipping insertion in model container [2025-03-08 22:53:03,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:53:03" (3/3) ... [2025-03-08 22:53:03,446 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2025-03-08 22:53:03,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:53:03,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_1.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 23 error locations. [2025-03-08 22:53:03,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:53:03,488 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;@78387b2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:53:03,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-08 22:53:03,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 62 states have internal predecessors, (69), 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-03-08 22:53:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:53:03,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:03,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:53:03,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:03,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1219042610, now seen corresponding path program 1 times [2025-03-08 22:53:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:03,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22496336] [2025-03-08 22:53:03,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:03,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:53:03,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:53:03,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:03,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22496336] [2025-03-08 22:53:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22496336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:03,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:53:03,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123005105] [2025-03-08 22:53:03,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:53:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:03,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:53:03,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:53:03,795 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:03,929 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2025-03-08 22:53:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:53:03,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:53:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:03,937 INFO L225 Difference]: With dead ends: 134 [2025-03-08 22:53:03,937 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 22:53:03,939 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-03-08 22:53:03,941 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 113 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:03,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 127 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 22:53:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2025-03-08 22:53:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.646153846153846) internal successors, (107), 85 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 22:53:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2025-03-08 22:53:03,973 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 6 [2025-03-08 22:53:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:03,973 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2025-03-08 22:53:03,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:03,974 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2025-03-08 22:53:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:53:03,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:03,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:53:03,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:53:03,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:03,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1219042609, now seen corresponding path program 1 times [2025-03-08 22:53:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:03,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424949122] [2025-03-08 22:53:03,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:03,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:53:03,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:53:03,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:03,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:04,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424949122] [2025-03-08 22:53:04,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424949122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:04,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:04,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:04,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362860574] [2025-03-08 22:53:04,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:04,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:04,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:04,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:04,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:04,131 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:04,244 INFO L93 Difference]: Finished difference Result 195 states and 267 transitions. [2025-03-08 22:53:04,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:53:04,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:53:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:04,246 INFO L225 Difference]: With dead ends: 195 [2025-03-08 22:53:04,246 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 22:53:04,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:04,247 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 88 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:04,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 207 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 22:53:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 169. [2025-03-08 22:53:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 151 states have internal predecessors, (218), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-08 22:53:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 263 transitions. [2025-03-08 22:53:04,260 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 263 transitions. Word has length 6 [2025-03-08 22:53:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:04,261 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 263 transitions. [2025-03-08 22:53:04,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:04,261 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 263 transitions. [2025-03-08 22:53:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:53:04,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:04,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:04,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:53:04,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:04,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash 864384782, now seen corresponding path program 1 times [2025-03-08 22:53:04,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:04,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798749209] [2025-03-08 22:53:04,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:04,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:04,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:53:04,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:53:04,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:04,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798749209] [2025-03-08 22:53:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798749209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:04,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129307849] [2025-03-08 22:53:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:04,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:04,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:04,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:04,432 INFO L87 Difference]: Start difference. First operand 169 states and 263 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-03-08 22:53:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:04,562 INFO L93 Difference]: Finished difference Result 220 states and 318 transitions. [2025-03-08 22:53:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:04,562 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-03-08 22:53:04,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:04,564 INFO L225 Difference]: With dead ends: 220 [2025-03-08 22:53:04,564 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 22:53:04,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:04,565 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:04,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 181 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 22:53:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 172. [2025-03-08 22:53:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 154 states have internal predecessors, (221), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-08 22:53:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 266 transitions. [2025-03-08 22:53:04,575 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 266 transitions. Word has length 7 [2025-03-08 22:53:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:04,575 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 266 transitions. [2025-03-08 22:53:04,575 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-03-08 22:53:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 266 transitions. [2025-03-08 22:53:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:53:04,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:04,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:04,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:53:04,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:04,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:04,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1026124492, now seen corresponding path program 1 times [2025-03-08 22:53:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:04,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929949961] [2025-03-08 22:53:04,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:04,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:04,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:53:04,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:53:04,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:04,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:04,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929949961] [2025-03-08 22:53:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929949961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:04,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003032290] [2025-03-08 22:53:04,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:04,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:04,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:04,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:04,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:04,775 INFO L87 Difference]: Start difference. First operand 172 states and 266 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:04,865 INFO L93 Difference]: Finished difference Result 197 states and 268 transitions. [2025-03-08 22:53:04,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:04,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:53:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:04,866 INFO L225 Difference]: With dead ends: 197 [2025-03-08 22:53:04,866 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 22:53:04,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:04,867 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 82 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:04,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 201 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 22:53:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 172. [2025-03-08 22:53:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 154 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-08 22:53:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2025-03-08 22:53:04,882 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 8 [2025-03-08 22:53:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:04,883 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2025-03-08 22:53:04,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2025-03-08 22:53:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:53:04,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:04,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:04,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:53:04,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:04,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1745088204, now seen corresponding path program 1 times [2025-03-08 22:53:04,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:04,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215559332] [2025-03-08 22:53:04,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:04,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:53:04,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:53:04,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:04,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:04,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:04,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215559332] [2025-03-08 22:53:04,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215559332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:04,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:04,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282872564] [2025-03-08 22:53:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:04,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:04,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:04,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:04,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:04,956 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:05,046 INFO L93 Difference]: Finished difference Result 266 states and 366 transitions. [2025-03-08 22:53:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:05,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 22:53:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:05,048 INFO L225 Difference]: With dead ends: 266 [2025-03-08 22:53:05,049 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 22:53:05,049 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-03-08 22:53:05,050 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 145 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:05,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 204 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 22:53:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 205. [2025-03-08 22:53:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.606060606060606) internal successors, (265), 186 states have internal predecessors, (265), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-08 22:53:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 310 transitions. [2025-03-08 22:53:05,088 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 310 transitions. Word has length 9 [2025-03-08 22:53:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:05,089 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 310 transitions. [2025-03-08 22:53:05,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 310 transitions. [2025-03-08 22:53:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:53:05,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:05,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:05,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:53:05,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:05,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:05,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1736840502, now seen corresponding path program 1 times [2025-03-08 22:53:05,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:05,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257751647] [2025-03-08 22:53:05,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:05,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:53:05,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:53:05,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:05,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:05,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:05,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257751647] [2025-03-08 22:53:05,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257751647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:05,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:05,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359717144] [2025-03-08 22:53:05,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:05,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:05,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:05,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:05,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:05,166 INFO L87 Difference]: Start difference. First operand 205 states and 310 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:05,246 INFO L93 Difference]: Finished difference Result 253 states and 333 transitions. [2025-03-08 22:53:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:05,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:53:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:05,248 INFO L225 Difference]: With dead ends: 253 [2025-03-08 22:53:05,248 INFO L226 Difference]: Without dead ends: 253 [2025-03-08 22:53:05,249 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-03-08 22:53:05,249 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 138 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:05,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 231 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-08 22:53:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 219. [2025-03-08 22:53:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 178 states have (on average 1.6067415730337078) internal successors, (286), 200 states have internal predecessors, (286), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-08 22:53:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 331 transitions. [2025-03-08 22:53:05,260 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 331 transitions. Word has length 10 [2025-03-08 22:53:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:05,261 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 331 transitions. [2025-03-08 22:53:05,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 331 transitions. [2025-03-08 22:53:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:53:05,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:05,261 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:05,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:53:05,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1600349994, now seen corresponding path program 1 times [2025-03-08 22:53:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569758] [2025-03-08 22:53:05,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:05,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:53:05,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:53:05,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:05,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:05,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:05,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569758] [2025-03-08 22:53:05,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:05,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518742874] [2025-03-08 22:53:05,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:05,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:05,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:05,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:05,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:53:05,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:53:05,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:53:05,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:05,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:05,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:53:05,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:05,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518742874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:05,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:53:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-03-08 22:53:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023645197] [2025-03-08 22:53:05,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:05,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:53:05,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:05,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:53:05,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:53:05,692 INFO L87 Difference]: Start difference. First operand 219 states and 331 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:05,891 INFO L93 Difference]: Finished difference Result 245 states and 330 transitions. [2025-03-08 22:53:05,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:53:05,891 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:53:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:05,892 INFO L225 Difference]: With dead ends: 245 [2025-03-08 22:53:05,893 INFO L226 Difference]: Without dead ends: 245 [2025-03-08 22:53:05,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:53:05,893 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 253 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:05,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 537 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-08 22:53:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 222. [2025-03-08 22:53:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 203 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-08 22:53:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 325 transitions. [2025-03-08 22:53:05,903 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 325 transitions. Word has length 14 [2025-03-08 22:53:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:05,903 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 325 transitions. [2025-03-08 22:53:05,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 325 transitions. [2025-03-08 22:53:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:53:05,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:05,903 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:05,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:06,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:06,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:06,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:06,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1928757735, now seen corresponding path program 1 times [2025-03-08 22:53:06,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:06,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990455816] [2025-03-08 22:53:06,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:06,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:53:06,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:53:06,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:06,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990455816] [2025-03-08 22:53:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990455816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984280707] [2025-03-08 22:53:06,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:06,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:06,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:06,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:06,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:53:06,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:53:06,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:53:06,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:06,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:06,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 22:53:06,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:06,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:06,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984280707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:06,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:53:06,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-08 22:53:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004786150] [2025-03-08 22:53:06,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:06,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:53:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:06,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:53:06,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:53:06,464 INFO L87 Difference]: Start difference. First operand 222 states and 325 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:06,689 INFO L93 Difference]: Finished difference Result 271 states and 376 transitions. [2025-03-08 22:53:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:53:06,690 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 22:53:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:06,691 INFO L225 Difference]: With dead ends: 271 [2025-03-08 22:53:06,691 INFO L226 Difference]: Without dead ends: 271 [2025-03-08 22:53:06,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:53:06,692 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 151 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:06,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 388 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-08 22:53:06,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 230. [2025-03-08 22:53:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 189 states have (on average 1.5396825396825398) internal successors, (291), 211 states have internal predecessors, (291), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-08 22:53:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2025-03-08 22:53:06,698 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 15 [2025-03-08 22:53:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:06,698 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2025-03-08 22:53:06,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2025-03-08 22:53:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:53:06,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:06,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:06,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:06,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 22:53:06,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:06,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash -338052333, now seen corresponding path program 1 times [2025-03-08 22:53:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:06,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212660376] [2025-03-08 22:53:06,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:06,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:06,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:53:06,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:53:06,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:06,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:07,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212660376] [2025-03-08 22:53:07,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212660376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:07,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915199291] [2025-03-08 22:53:07,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:07,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:07,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:07,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:07,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:53:07,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:53:07,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:53:07,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:07,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:07,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:53:07,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:07,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:07,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915199291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:07,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:53:07,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-08 22:53:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355585447] [2025-03-08 22:53:07,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:07,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:53:07,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:07,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:53:07,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:53:07,393 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:07,856 INFO L93 Difference]: Finished difference Result 393 states and 539 transitions. [2025-03-08 22:53:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:53:07,857 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 22:53:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:07,858 INFO L225 Difference]: With dead ends: 393 [2025-03-08 22:53:07,858 INFO L226 Difference]: Without dead ends: 393 [2025-03-08 22:53:07,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:53:07,859 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 256 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:07,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 749 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:53:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-08 22:53:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 325. [2025-03-08 22:53:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 300 states have internal predecessors, (438), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2025-03-08 22:53:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2025-03-08 22:53:07,867 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 16 [2025-03-08 22:53:07,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:07,867 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2025-03-08 22:53:07,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2025-03-08 22:53:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:53:07,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:07,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:07,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:08,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:08,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:08,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1444392243, now seen corresponding path program 1 times [2025-03-08 22:53:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630311701] [2025-03-08 22:53:08,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:08,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:53:08,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:53:08,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:08,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630311701] [2025-03-08 22:53:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630311701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:08,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:08,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:53:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224136622] [2025-03-08 22:53:08,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:08,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:53:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:08,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:53:08,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:08,104 INFO L87 Difference]: Start difference. First operand 325 states and 502 transitions. Second operand has 3 states, 2 states have (on average 8.5) 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-03-08 22:53:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:08,122 INFO L93 Difference]: Finished difference Result 471 states and 732 transitions. [2025-03-08 22:53:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:53:08,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) 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-03-08 22:53:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:08,124 INFO L225 Difference]: With dead ends: 471 [2025-03-08 22:53:08,124 INFO L226 Difference]: Without dead ends: 471 [2025-03-08 22:53:08,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:08,124 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:08,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 112 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-08 22:53:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 457. [2025-03-08 22:53:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 398 states have (on average 1.5728643216080402) internal successors, (626), 423 states have internal predecessors, (626), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2025-03-08 22:53:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 730 transitions. [2025-03-08 22:53:08,144 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 730 transitions. Word has length 18 [2025-03-08 22:53:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:08,144 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 730 transitions. [2025-03-08 22:53:08,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) 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-03-08 22:53:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 730 transitions. [2025-03-08 22:53:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:53:08,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:08,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:08,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:53:08,145 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:08,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1444392267, now seen corresponding path program 1 times [2025-03-08 22:53:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:08,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600635497] [2025-03-08 22:53:08,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:08,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:08,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:53:08,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:53:08,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:08,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:08,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:08,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600635497] [2025-03-08 22:53:08,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600635497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:08,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:08,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:08,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870302654] [2025-03-08 22:53:08,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:08,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:53:08,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:08,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:53:08,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:08,182 INFO L87 Difference]: Start difference. First operand 457 states and 730 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:08,188 INFO L93 Difference]: Finished difference Result 419 states and 664 transitions. [2025-03-08 22:53:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:53:08,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 22:53:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:08,191 INFO L225 Difference]: With dead ends: 419 [2025-03-08 22:53:08,191 INFO L226 Difference]: Without dead ends: 419 [2025-03-08 22:53:08,191 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-03-08 22:53:08,192 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:08,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-08 22:53:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-03-08 22:53:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 366 states have (on average 1.530054644808743) internal successors, (560), 385 states have internal predecessors, (560), 19 states have call successors, (19), 14 states have call predecessors, (19), 19 states have return successors, (85), 19 states have call predecessors, (85), 19 states have call successors, (85) [2025-03-08 22:53:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 664 transitions. [2025-03-08 22:53:08,211 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 664 transitions. Word has length 18 [2025-03-08 22:53:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:08,212 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 664 transitions. [2025-03-08 22:53:08,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 664 transitions. [2025-03-08 22:53:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:53:08,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:08,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:08,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:53:08,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:08,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1826486563, now seen corresponding path program 1 times [2025-03-08 22:53:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737143938] [2025-03-08 22:53:08,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:08,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:53:08,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:53:08,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:08,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:08,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737143938] [2025-03-08 22:53:08,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737143938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:08,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:08,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:53:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431911599] [2025-03-08 22:53:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:08,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:53:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:08,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:53:08,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:08,259 INFO L87 Difference]: Start difference. First operand 419 states and 664 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:08,286 INFO L93 Difference]: Finished difference Result 487 states and 744 transitions. [2025-03-08 22:53:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:53:08,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:53:08,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:08,289 INFO L225 Difference]: With dead ends: 487 [2025-03-08 22:53:08,289 INFO L226 Difference]: Without dead ends: 487 [2025-03-08 22:53:08,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:08,290 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:08,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 96 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-08 22:53:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 471. [2025-03-08 22:53:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 414 states have (on average 1.5169082125603865) internal successors, (628), 435 states have internal predecessors, (628), 20 states have call successors, (20), 15 states have call predecessors, (20), 22 states have return successors, (89), 20 states have call predecessors, (89), 20 states have call successors, (89) [2025-03-08 22:53:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 737 transitions. [2025-03-08 22:53:08,304 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 737 transitions. Word has length 19 [2025-03-08 22:53:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:08,304 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 737 transitions. [2025-03-08 22:53:08,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 737 transitions. [2025-03-08 22:53:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:53:08,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:08,306 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:08,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:53:08,306 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:08,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1009783700, now seen corresponding path program 1 times [2025-03-08 22:53:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879517693] [2025-03-08 22:53:08,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:08,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:53:08,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:53:08,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:08,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:08,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879517693] [2025-03-08 22:53:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879517693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:08,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:08,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993276483] [2025-03-08 22:53:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:08,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:53:08,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:08,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:53:08,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:08,356 INFO L87 Difference]: Start difference. First operand 471 states and 737 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:08,364 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2025-03-08 22:53:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:53:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-08 22:53:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:08,366 INFO L225 Difference]: With dead ends: 337 [2025-03-08 22:53:08,366 INFO L226 Difference]: Without dead ends: 337 [2025-03-08 22:53:08,366 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-03-08 22:53:08,367 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 9 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:08,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 100 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-08 22:53:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-08 22:53:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 292 states have (on average 1.4897260273972603) internal successors, (435), 310 states have internal predecessors, (435), 15 states have call successors, (15), 11 states have call predecessors, (15), 15 states have return successors, (59), 15 states have call predecessors, (59), 15 states have call successors, (59) [2025-03-08 22:53:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 509 transitions. [2025-03-08 22:53:08,378 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 509 transitions. Word has length 25 [2025-03-08 22:53:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:08,378 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 509 transitions. [2025-03-08 22:53:08,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2025-03-08 22:53:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:53:08,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:08,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:08,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:53:08,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:08,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1984033445, now seen corresponding path program 1 times [2025-03-08 22:53:08,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:08,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493734853] [2025-03-08 22:53:08,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:08,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:53:08,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:53:08,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:08,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:08,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493734853] [2025-03-08 22:53:08,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493734853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111344821] [2025-03-08 22:53:08,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:08,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:08,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:08,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:08,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:53:08,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:53:08,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:53:08,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:08,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 22:53:08,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:08,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:53:08,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:53:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:08,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:09,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111344821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:09,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:09,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2025-03-08 22:53:09,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702179429] [2025-03-08 22:53:09,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:09,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:53:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:09,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:53:09,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:53:09,025 INFO L87 Difference]: Start difference. First operand 337 states and 509 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:09,365 INFO L93 Difference]: Finished difference Result 370 states and 526 transitions. [2025-03-08 22:53:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:53:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-08 22:53:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:09,366 INFO L225 Difference]: With dead ends: 370 [2025-03-08 22:53:09,366 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 22:53:09,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:53:09,367 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 299 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:09,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 137 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 22:53:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 359. [2025-03-08 22:53:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 310 states have (on average 1.435483870967742) internal successors, (445), 332 states have internal predecessors, (445), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2025-03-08 22:53:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 520 transitions. [2025-03-08 22:53:09,376 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 520 transitions. Word has length 27 [2025-03-08 22:53:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:09,376 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 520 transitions. [2025-03-08 22:53:09,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 520 transitions. [2025-03-08 22:53:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:53:09,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:09,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:09,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:09,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:09,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:09,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2043608466, now seen corresponding path program 1 times [2025-03-08 22:53:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049908716] [2025-03-08 22:53:09,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:09,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:53:09,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:53:09,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:09,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:09,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:09,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049908716] [2025-03-08 22:53:09,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049908716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:09,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117906147] [2025-03-08 22:53:09,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:09,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:09,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:09,697 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:09,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:53:09,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:53:09,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:53:09,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:09,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:09,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:53:09,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:09,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:09,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117906147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:09,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:53:09,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-03-08 22:53:09,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112521462] [2025-03-08 22:53:09,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:09,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:53:09,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:09,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:53:09,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:53:09,848 INFO L87 Difference]: Start difference. First operand 359 states and 520 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:09,893 INFO L93 Difference]: Finished difference Result 383 states and 540 transitions. [2025-03-08 22:53:09,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:53:09,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-08 22:53:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:09,894 INFO L225 Difference]: With dead ends: 383 [2025-03-08 22:53:09,894 INFO L226 Difference]: Without dead ends: 383 [2025-03-08 22:53:09,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:53:09,895 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 68 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:09,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 158 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-08 22:53:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 372. [2025-03-08 22:53:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 323 states have (on average 1.4179566563467492) internal successors, (458), 345 states have internal predecessors, (458), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2025-03-08 22:53:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 533 transitions. [2025-03-08 22:53:09,904 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 533 transitions. Word has length 28 [2025-03-08 22:53:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:09,904 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 533 transitions. [2025-03-08 22:53:09,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 533 transitions. [2025-03-08 22:53:09,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:53:09,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:09,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:09,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:10,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 22:53:10,106 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:10,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash -309338846, now seen corresponding path program 1 times [2025-03-08 22:53:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:10,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706823728] [2025-03-08 22:53:10,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:10,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:53:10,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:53:10,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:10,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:10,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:10,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706823728] [2025-03-08 22:53:10,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706823728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:10,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379563783] [2025-03-08 22:53:10,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:10,442 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:10,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:53:10,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:53:10,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:53:10,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:10,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:10,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 22:53:10,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:10,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:53:10,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:53:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:10,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:10,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379563783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:10,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:10,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2025-03-08 22:53:10,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530088687] [2025-03-08 22:53:10,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 22:53:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:10,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 22:53:10,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:53:10,916 INFO L87 Difference]: Start difference. First operand 372 states and 533 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:11,244 INFO L93 Difference]: Finished difference Result 382 states and 534 transitions. [2025-03-08 22:53:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:53:11,245 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-08 22:53:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:11,246 INFO L225 Difference]: With dead ends: 382 [2025-03-08 22:53:11,246 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 22:53:11,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2025-03-08 22:53:11,246 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 220 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:11,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 156 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 22:53:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 375. [2025-03-08 22:53:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 326 states have (on average 1.3987730061349692) internal successors, (456), 348 states have internal predecessors, (456), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2025-03-08 22:53:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 531 transitions. [2025-03-08 22:53:11,255 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 531 transitions. Word has length 29 [2025-03-08 22:53:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:11,255 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 531 transitions. [2025-03-08 22:53:11,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 531 transitions. [2025-03-08 22:53:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:53:11,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:11,256 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:11,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:53:11,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 22:53:11,457 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:11,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:11,457 INFO L85 PathProgramCache]: Analyzing trace with hash 179331362, now seen corresponding path program 1 times [2025-03-08 22:53:11,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:11,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076709985] [2025-03-08 22:53:11,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:11,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:11,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:53:11,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:53:11,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:11,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076709985] [2025-03-08 22:53:11,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076709985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:11,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:11,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:53:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91368068] [2025-03-08 22:53:11,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:11,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:11,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:11,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:11,518 INFO L87 Difference]: Start difference. First operand 375 states and 531 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:11,576 INFO L93 Difference]: Finished difference Result 363 states and 492 transitions. [2025-03-08 22:53:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:53:11,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-08 22:53:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:11,577 INFO L225 Difference]: With dead ends: 363 [2025-03-08 22:53:11,577 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 22:53:11,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:53:11,578 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 85 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:11,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 172 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 22:53:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2025-03-08 22:53:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 311 states have (on average 1.4019292604501608) internal successors, (436), 334 states have internal predecessors, (436), 12 states have call successors, (12), 9 states have call predecessors, (12), 18 states have return successors, (42), 12 states have call predecessors, (42), 12 states have call successors, (42) [2025-03-08 22:53:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 490 transitions. [2025-03-08 22:53:11,584 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 490 transitions. Word has length 30 [2025-03-08 22:53:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:11,585 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 490 transitions. [2025-03-08 22:53:11,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 490 transitions. [2025-03-08 22:53:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:53:11,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:11,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:11,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:53:11,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:11,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash -999569610, now seen corresponding path program 1 times [2025-03-08 22:53:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066848390] [2025-03-08 22:53:11,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:11,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:53:11,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:53:11,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:11,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:11,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:11,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066848390] [2025-03-08 22:53:11,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066848390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:11,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187837487] [2025-03-08 22:53:11,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:11,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:11,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:11,722 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:11,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:53:11,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:53:11,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:53:11,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:11,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:11,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 22:53:11,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:11,840 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 22:53:11,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 22:53:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:11,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187837487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:11,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-03-08 22:53:11,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517791416] [2025-03-08 22:53:11,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:11,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:53:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:11,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:53:11,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:53:11,916 INFO L87 Difference]: Start difference. First operand 356 states and 490 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:53:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:12,187 INFO L93 Difference]: Finished difference Result 486 states and 621 transitions. [2025-03-08 22:53:12,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:53:12,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-08 22:53:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:12,189 INFO L225 Difference]: With dead ends: 486 [2025-03-08 22:53:12,189 INFO L226 Difference]: Without dead ends: 486 [2025-03-08 22:53:12,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:53:12,190 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 376 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:12,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 336 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-08 22:53:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 431. [2025-03-08 22:53:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 383 states have (on average 1.3655352480417755) internal successors, (523), 407 states have internal predecessors, (523), 12 states have call successors, (12), 11 states have call predecessors, (12), 21 states have return successors, (41), 12 states have call predecessors, (41), 12 states have call successors, (41) [2025-03-08 22:53:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 576 transitions. [2025-03-08 22:53:12,197 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 576 transitions. Word has length 30 [2025-03-08 22:53:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:12,198 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 576 transitions. [2025-03-08 22:53:12,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:53:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 576 transitions. [2025-03-08 22:53:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:53:12,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:12,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:12,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:53:12,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:12,399 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:12,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash -921886816, now seen corresponding path program 1 times [2025-03-08 22:53:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768930618] [2025-03-08 22:53:12,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:12,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:53:12,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:53:12,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:12,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:12,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:12,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768930618] [2025-03-08 22:53:12,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768930618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:12,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499945659] [2025-03-08 22:53:12,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:12,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:12,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:12,530 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:12,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:53:12,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:53:12,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:53:12,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:12,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:12,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 22:53:12,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:12,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:53:12,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:53:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:12,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499945659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:12,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:12,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2025-03-08 22:53:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824664474] [2025-03-08 22:53:12,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:12,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:53:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:12,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:53:12,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:53:12,842 INFO L87 Difference]: Start difference. First operand 431 states and 576 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:13,332 INFO L93 Difference]: Finished difference Result 588 states and 726 transitions. [2025-03-08 22:53:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:53:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-08 22:53:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:13,334 INFO L225 Difference]: With dead ends: 588 [2025-03-08 22:53:13,335 INFO L226 Difference]: Without dead ends: 588 [2025-03-08 22:53:13,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 22:53:13,335 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 516 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:13,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 302 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-08 22:53:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 532. [2025-03-08 22:53:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 479 states have (on average 1.346555323590814) internal successors, (645), 507 states have internal predecessors, (645), 12 states have call successors, (12), 12 states have call predecessors, (12), 26 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-03-08 22:53:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 693 transitions. [2025-03-08 22:53:13,347 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 693 transitions. Word has length 31 [2025-03-08 22:53:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:13,347 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 693 transitions. [2025-03-08 22:53:13,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 693 transitions. [2025-03-08 22:53:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 22:53:13,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:13,347 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:13,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:13,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:13,548 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:13,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 943551148, now seen corresponding path program 1 times [2025-03-08 22:53:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472779585] [2025-03-08 22:53:13,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:13,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:53:13,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:53:13,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:13,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472779585] [2025-03-08 22:53:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472779585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019582969] [2025-03-08 22:53:13,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:13,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:13,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:13,732 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:13,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:53:13,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:53:13,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:53:13,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:13,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:13,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 22:53:13,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:13,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:53:13,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:53:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:14,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:14,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019582969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:14,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:14,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2025-03-08 22:53:14,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472621330] [2025-03-08 22:53:14,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:14,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:53:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:14,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:53:14,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:53:14,175 INFO L87 Difference]: Start difference. First operand 532 states and 693 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:14,592 INFO L93 Difference]: Finished difference Result 549 states and 687 transitions. [2025-03-08 22:53:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:53:14,592 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-03-08 22:53:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:14,594 INFO L225 Difference]: With dead ends: 549 [2025-03-08 22:53:14,594 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 22:53:14,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 22:53:14,595 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 443 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:14,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 214 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 22:53:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 531. [2025-03-08 22:53:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 481 states have (on average 1.2952182952182951) internal successors, (623), 506 states have internal predecessors, (623), 12 states have call successors, (12), 12 states have call predecessors, (12), 26 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-03-08 22:53:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 671 transitions. [2025-03-08 22:53:14,609 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 671 transitions. Word has length 35 [2025-03-08 22:53:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:14,609 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 671 transitions. [2025-03-08 22:53:14,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2025-03-08 22:53:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:53:14,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:14,609 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:14,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 22:53:14,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:14,810 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:14,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:14,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1208314165, now seen corresponding path program 1 times [2025-03-08 22:53:14,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:14,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338675993] [2025-03-08 22:53:14,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:14,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:14,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:53:14,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:53:14,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:14,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:53:14,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:14,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338675993] [2025-03-08 22:53:14,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338675993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:14,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36100704] [2025-03-08 22:53:14,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:14,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:14,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:14,917 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:14,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 22:53:14,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:53:14,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:53:14,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:14,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:14,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 22:53:15,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:15,129 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:53:15,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-08 22:53:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:53:15,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:15,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-08 22:53:15,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-08 22:53:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:53:15,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36100704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:15,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:53:15,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2025-03-08 22:53:15,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584257501] [2025-03-08 22:53:15,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:15,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:53:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:15,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:53:15,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:53:15,379 INFO L87 Difference]: Start difference. First operand 531 states and 671 transitions. Second operand has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:53:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:15,666 INFO L93 Difference]: Finished difference Result 580 states and 706 transitions. [2025-03-08 22:53:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:53:15,666 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2025-03-08 22:53:15,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:15,667 INFO L225 Difference]: With dead ends: 580 [2025-03-08 22:53:15,667 INFO L226 Difference]: Without dead ends: 580 [2025-03-08 22:53:15,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:53:15,668 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 346 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:15,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 181 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-08 22:53:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 539. [2025-03-08 22:53:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 490 states have (on average 1.2959183673469388) internal successors, (635), 514 states have internal predecessors, (635), 12 states have call successors, (12), 12 states have call predecessors, (12), 25 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2025-03-08 22:53:15,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 680 transitions. [2025-03-08 22:53:15,678 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 680 transitions. Word has length 36 [2025-03-08 22:53:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:15,678 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 680 transitions. [2025-03-08 22:53:15,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:53:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 680 transitions. [2025-03-08 22:53:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 22:53:15,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:15,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:15,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:53:15,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 22:53:15,879 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:15,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1196966521, now seen corresponding path program 1 times [2025-03-08 22:53:15,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:15,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449639750] [2025-03-08 22:53:15,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:15,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:15,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:53:15,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:53:15,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:15,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:16,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:16,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449639750] [2025-03-08 22:53:16,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449639750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:16,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201865061] [2025-03-08 22:53:16,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:16,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:16,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:16,189 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:16,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:53:16,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:53:16,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:53:16,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:16,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:16,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:53:16,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:16,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:16,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201865061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:16,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:53:16,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2025-03-08 22:53:16,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36938643] [2025-03-08 22:53:16,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:16,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 22:53:16,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:16,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 22:53:16,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:53:16,685 INFO L87 Difference]: Start difference. First operand 539 states and 680 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:53:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:17,830 INFO L93 Difference]: Finished difference Result 800 states and 971 transitions. [2025-03-08 22:53:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-08 22:53:17,830 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2025-03-08 22:53:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:17,832 INFO L225 Difference]: With dead ends: 800 [2025-03-08 22:53:17,832 INFO L226 Difference]: Without dead ends: 800 [2025-03-08 22:53:17,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=571, Invalid=2621, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 22:53:17,834 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 882 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:17,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 674 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:53:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-08 22:53:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 543. [2025-03-08 22:53:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 496 states have (on average 1.2862903225806452) internal successors, (638), 520 states have internal predecessors, (638), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-08 22:53:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 680 transitions. [2025-03-08 22:53:17,845 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 680 transitions. Word has length 37 [2025-03-08 22:53:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:17,845 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 680 transitions. [2025-03-08 22:53:17,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:53:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 680 transitions. [2025-03-08 22:53:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 22:53:17,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:17,846 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:17,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:18,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 22:53:18,046 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:18,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1376807982, now seen corresponding path program 1 times [2025-03-08 22:53:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:18,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219123664] [2025-03-08 22:53:18,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:18,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:53:18,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:53:18,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:18,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:18,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:18,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219123664] [2025-03-08 22:53:18,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219123664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:18,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138249513] [2025-03-08 22:53:18,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:18,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:18,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:18,082 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:18,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 22:53:18,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:53:18,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:53:18,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:18,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:18,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:53:18,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:18,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:18,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138249513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:18,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:53:18,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-08 22:53:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189449393] [2025-03-08 22:53:18,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:18,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:53:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:18,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:53:18,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:53:18,187 INFO L87 Difference]: Start difference. First operand 543 states and 680 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:18,201 INFO L93 Difference]: Finished difference Result 541 states and 673 transitions. [2025-03-08 22:53:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:53:18,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-03-08 22:53:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:18,203 INFO L225 Difference]: With dead ends: 541 [2025-03-08 22:53:18,203 INFO L226 Difference]: Without dead ends: 541 [2025-03-08 22:53:18,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:18,204 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 36 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:18,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 84 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-08 22:53:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 535. [2025-03-08 22:53:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 490 states have (on average 1.273469387755102) internal successors, (624), 512 states have internal predecessors, (624), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-08 22:53:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 666 transitions. [2025-03-08 22:53:18,214 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 666 transitions. Word has length 40 [2025-03-08 22:53:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:18,214 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 666 transitions. [2025-03-08 22:53:18,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 666 transitions. [2025-03-08 22:53:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 22:53:18,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:18,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:18,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:18,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 22:53:18,420 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:18,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash -268625517, now seen corresponding path program 1 times [2025-03-08 22:53:18,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:18,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959865319] [2025-03-08 22:53:18,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:18,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:53:18,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:53:18,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:18,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959865319] [2025-03-08 22:53:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959865319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:18,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400484203] [2025-03-08 22:53:18,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:18,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:18,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:18,475 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:18,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 22:53:18,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:53:18,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:53:18,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:18,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:18,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:53:18,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:18,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:18,614 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:18,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400484203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:18,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:53:18,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-08 22:53:18,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002638094] [2025-03-08 22:53:18,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:18,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:53:18,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:18,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:53:18,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:53:18,615 INFO L87 Difference]: Start difference. First operand 535 states and 666 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:18,642 INFO L93 Difference]: Finished difference Result 533 states and 658 transitions. [2025-03-08 22:53:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:53:18,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2025-03-08 22:53:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:18,643 INFO L225 Difference]: With dead ends: 533 [2025-03-08 22:53:18,643 INFO L226 Difference]: Without dead ends: 533 [2025-03-08 22:53:18,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:18,644 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:18,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 67 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-08 22:53:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-03-08 22:53:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 490 states have (on average 1.2571428571428571) internal successors, (616), 510 states have internal predecessors, (616), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-08 22:53:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 658 transitions. [2025-03-08 22:53:18,651 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 658 transitions. Word has length 41 [2025-03-08 22:53:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:18,651 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 658 transitions. [2025-03-08 22:53:18,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 658 transitions. [2025-03-08 22:53:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 22:53:18,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:18,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:18,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:18,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 22:53:18,852 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr9ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:18,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash 262543564, now seen corresponding path program 1 times [2025-03-08 22:53:18,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:18,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057332812] [2025-03-08 22:53:18,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:18,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:53:18,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:53:18,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:18,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:18,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057332812] [2025-03-08 22:53:18,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057332812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880370528] [2025-03-08 22:53:18,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:18,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:18,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:18,924 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:18,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 22:53:18,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:53:18,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:53:18,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:18,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:18,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 22:53:18,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:18,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:53:19,011 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:53:19,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 22:53:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:19,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880370528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:19,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:53:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-08 22:53:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630746767] [2025-03-08 22:53:19,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:53:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:19,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:53:19,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:53:19,058 INFO L87 Difference]: Start difference. First operand 533 states and 658 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:19,109 INFO L93 Difference]: Finished difference Result 551 states and 667 transitions. [2025-03-08 22:53:19,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:19,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-03-08 22:53:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:19,111 INFO L225 Difference]: With dead ends: 551 [2025-03-08 22:53:19,111 INFO L226 Difference]: Without dead ends: 551 [2025-03-08 22:53:19,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:19,112 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:19,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 120 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-08 22:53:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 533. [2025-03-08 22:53:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 490 states have (on average 1.2469387755102042) internal successors, (611), 510 states have internal predecessors, (611), 11 states have call successors, (11), 11 states have call predecessors, (11), 24 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-08 22:53:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 653 transitions. [2025-03-08 22:53:19,120 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 653 transitions. Word has length 42 [2025-03-08 22:53:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:19,120 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 653 transitions. [2025-03-08 22:53:19,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 653 transitions. [2025-03-08 22:53:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 22:53:19,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:19,121 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:19,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:19,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:19,325 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:19,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1317526192, now seen corresponding path program 1 times [2025-03-08 22:53:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:19,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624183826] [2025-03-08 22:53:19,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:19,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:19,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:53:19,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:53:19,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:19,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:53:19,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:19,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624183826] [2025-03-08 22:53:19,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624183826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:19,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233517591] [2025-03-08 22:53:19,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:19,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:19,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:19,361 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:19,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 22:53:19,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:53:19,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:53:19,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:19,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:19,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:53:19,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:53:19,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:19,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233517591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:19,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:53:19,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-08 22:53:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236135053] [2025-03-08 22:53:19,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:19,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:19,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:19,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:19,436 INFO L87 Difference]: Start difference. First operand 533 states and 653 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:19,450 INFO L93 Difference]: Finished difference Result 340 states and 396 transitions. [2025-03-08 22:53:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:19,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-08 22:53:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:19,451 INFO L225 Difference]: With dead ends: 340 [2025-03-08 22:53:19,451 INFO L226 Difference]: Without dead ends: 340 [2025-03-08 22:53:19,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:19,452 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:19,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 107 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-08 22:53:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 331. [2025-03-08 22:53:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 300 states have (on average 1.21) internal successors, (363), 314 states have internal predecessors, (363), 8 states have call successors, (8), 8 states have call predecessors, (8), 15 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-08 22:53:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 388 transitions. [2025-03-08 22:53:19,456 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 388 transitions. Word has length 45 [2025-03-08 22:53:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:19,456 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 388 transitions. [2025-03-08 22:53:19,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 388 transitions. [2025-03-08 22:53:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:53:19,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:19,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:19,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:19,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 22:53:19,658 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:19,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash -849234120, now seen corresponding path program 1 times [2025-03-08 22:53:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:19,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822372967] [2025-03-08 22:53:19,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:19,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:53:19,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:53:19,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:19,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822372967] [2025-03-08 22:53:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822372967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303691590] [2025-03-08 22:53:19,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:19,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:19,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:19,805 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:19,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 22:53:19,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:53:19,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:53:19,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:19,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:19,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 22:53:19,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:19,955 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:53:19,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:53:20,037 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 22:53:20,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 22:53:20,059 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:53:20,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-08 22:53:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:20,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:20,124 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 22:53:20,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2025-03-08 22:53:20,262 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 22:53:20,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 105 [2025-03-08 22:53:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303691590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:20,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:53:20,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2025-03-08 22:53:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540911079] [2025-03-08 22:53:20,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:20,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 22:53:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:20,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 22:53:20,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:53:20,381 INFO L87 Difference]: Start difference. First operand 331 states and 388 transitions. Second operand has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 22:53:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:20,552 INFO L93 Difference]: Finished difference Result 340 states and 396 transitions. [2025-03-08 22:53:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:53:20,553 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2025-03-08 22:53:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:20,554 INFO L225 Difference]: With dead ends: 340 [2025-03-08 22:53:20,554 INFO L226 Difference]: Without dead ends: 340 [2025-03-08 22:53:20,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2025-03-08 22:53:20,554 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 167 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:20,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 168 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-08 22:53:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 330. [2025-03-08 22:53:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 300 states have (on average 1.2033333333333334) internal successors, (361), 313 states have internal predecessors, (361), 8 states have call successors, (8), 8 states have call predecessors, (8), 15 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-08 22:53:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 386 transitions. [2025-03-08 22:53:20,562 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 386 transitions. Word has length 51 [2025-03-08 22:53:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:20,563 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 386 transitions. [2025-03-08 22:53:20,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 22:53:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 386 transitions. [2025-03-08 22:53:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:53:20,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:20,563 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:20,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:20,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 22:53:20,764 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:20,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1303078092, now seen corresponding path program 1 times [2025-03-08 22:53:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:20,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287837455] [2025-03-08 22:53:20,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:20,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:20,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:53:20,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:53:20,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:20,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287837455] [2025-03-08 22:53:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287837455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320974524] [2025-03-08 22:53:20,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:20,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:20,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:20,805 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:20,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 22:53:20,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:53:20,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:53:20,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:20,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:20,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 22:53:20,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:20,939 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 22:53:20,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 22:53:20,954 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| 1))) is different from true [2025-03-08 22:53:20,967 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:53:20,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 22:53:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 7 not checked. [2025-03-08 22:53:20,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320974524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:21,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:21,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-03-08 22:53:21,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590230273] [2025-03-08 22:53:21,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:21,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:53:21,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:21,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:53:21,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2025-03-08 22:53:21,119 INFO L87 Difference]: Start difference. First operand 330 states and 386 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:53:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:21,550 INFO L93 Difference]: Finished difference Result 307 states and 344 transitions. [2025-03-08 22:53:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 22:53:21,551 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2025-03-08 22:53:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:21,551 INFO L225 Difference]: With dead ends: 307 [2025-03-08 22:53:21,551 INFO L226 Difference]: Without dead ends: 307 [2025-03-08 22:53:21,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=301, Invalid=1034, Unknown=1, NotChecked=70, Total=1406 [2025-03-08 22:53:21,552 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 274 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:21,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 330 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 366 Invalid, 0 Unknown, 156 Unchecked, 0.2s Time] [2025-03-08 22:53:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-08 22:53:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 288. [2025-03-08 22:53:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 262 states have (on average 1.1793893129770991) internal successors, (309), 273 states have internal predecessors, (309), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-08 22:53:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 329 transitions. [2025-03-08 22:53:21,556 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 329 transitions. Word has length 51 [2025-03-08 22:53:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:21,556 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 329 transitions. [2025-03-08 22:53:21,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:53:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 329 transitions. [2025-03-08 22:53:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:53:21,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:21,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:21,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:21,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 22:53:21,757 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:21,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:21,758 INFO L85 PathProgramCache]: Analyzing trace with hash -556453916, now seen corresponding path program 1 times [2025-03-08 22:53:21,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:21,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545331782] [2025-03-08 22:53:21,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:21,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:21,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:53:21,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:53:21,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:21,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:22,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545331782] [2025-03-08 22:53:22,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545331782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403042219] [2025-03-08 22:53:22,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:22,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:22,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:22,157 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:22,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 22:53:22,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:53:22,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:53:22,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:22,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:22,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 22:53:22,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:22,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:53:22,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:53:22,520 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 22:53:22,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 22:53:22,562 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:53:22,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-08 22:53:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:22,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:22,724 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-08 22:53:22,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 81 [2025-03-08 22:53:22,904 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-08 22:53:22,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2025-03-08 22:53:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:23,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403042219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:23,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:53:23,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 14] total 39 [2025-03-08 22:53:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113123617] [2025-03-08 22:53:23,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:23,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 22:53:23,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:23,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 22:53:23,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1463, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 22:53:23,146 INFO L87 Difference]: Start difference. First operand 288 states and 329 transitions. Second operand has 41 states, 37 states have (on average 3.72972972972973) internal successors, (138), 33 states have internal predecessors, (138), 7 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 22:53:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:23,496 INFO L93 Difference]: Finished difference Result 300 states and 338 transitions. [2025-03-08 22:53:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:53:23,498 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 3.72972972972973) internal successors, (138), 33 states have internal predecessors, (138), 7 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 52 [2025-03-08 22:53:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:23,500 INFO L225 Difference]: With dead ends: 300 [2025-03-08 22:53:23,500 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 22:53:23,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=387, Invalid=1869, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 22:53:23,501 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 543 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:23,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 234 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 22:53:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 288. [2025-03-08 22:53:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 262 states have (on average 1.1717557251908397) internal successors, (307), 273 states have internal predecessors, (307), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-08 22:53:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 327 transitions. [2025-03-08 22:53:23,505 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 327 transitions. Word has length 52 [2025-03-08 22:53:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:23,505 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 327 transitions. [2025-03-08 22:53:23,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 3.72972972972973) internal successors, (138), 33 states have internal predecessors, (138), 7 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 22:53:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 327 transitions. [2025-03-08 22:53:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:53:23,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:23,507 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:23,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 22:53:23,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 22:53:23,707 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:23,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1871789864, now seen corresponding path program 1 times [2025-03-08 22:53:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:23,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583861761] [2025-03-08 22:53:23,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:23,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:53:23,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:53:23,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:23,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:53:23,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:23,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583861761] [2025-03-08 22:53:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583861761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:23,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207969087] [2025-03-08 22:53:23,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:23,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:23,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:23,859 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:23,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 22:53:23,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:53:23,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:53:23,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:23,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:23,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 22:53:23,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:24,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:53:24,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:53:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:53:24,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:24,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207969087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:24,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:24,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2025-03-08 22:53:24,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127167047] [2025-03-08 22:53:24,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:24,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:53:24,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:24,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:53:24,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:53:24,211 INFO L87 Difference]: Start difference. First operand 288 states and 327 transitions. Second operand has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:53:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:24,530 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2025-03-08 22:53:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:53:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2025-03-08 22:53:24,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:24,531 INFO L225 Difference]: With dead ends: 301 [2025-03-08 22:53:24,531 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 22:53:24,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 22:53:24,533 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 342 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:24,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 259 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 22:53:24,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 287. [2025-03-08 22:53:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 262 states have (on average 1.1412213740458015) internal successors, (299), 272 states have internal predecessors, (299), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-08 22:53:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 319 transitions. [2025-03-08 22:53:24,537 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 319 transitions. Word has length 52 [2025-03-08 22:53:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:24,537 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 319 transitions. [2025-03-08 22:53:24,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:53:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 319 transitions. [2025-03-08 22:53:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:53:24,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:24,540 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:24,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 22:53:24,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:24,744 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:24,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2118699554, now seen corresponding path program 1 times [2025-03-08 22:53:24,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518221465] [2025-03-08 22:53:24,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:24,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:53:24,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:53:24,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:24,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:24,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:24,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518221465] [2025-03-08 22:53:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518221465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:24,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949854615] [2025-03-08 22:53:24,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:24,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:24,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:24,975 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:24,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 22:53:25,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:53:25,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:53:25,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:25,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:25,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 22:53:25,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:25,104 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 22:53:25,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-08 22:53:25,157 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (= |c_#valid| (store (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| 1) |c_old(~global~0.base)| (select |c_#valid| |c_old(~global~0.base)|)))) is different from true [2025-03-08 22:53:25,177 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2025-03-08 22:53:25,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2025-03-08 22:53:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-03-08 22:53:25,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:25,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949854615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:25,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:25,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-03-08 22:53:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355270757] [2025-03-08 22:53:25,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:25,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:53:25,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:25,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:53:25,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=375, Unknown=1, NotChecked=40, Total=506 [2025-03-08 22:53:25,388 INFO L87 Difference]: Start difference. First operand 287 states and 319 transitions. Second operand has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:53:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:25,742 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2025-03-08 22:53:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:53:25,742 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2025-03-08 22:53:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:25,743 INFO L225 Difference]: With dead ends: 297 [2025-03-08 22:53:25,743 INFO L226 Difference]: Without dead ends: 297 [2025-03-08 22:53:25,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=336, Invalid=927, Unknown=1, NotChecked=68, Total=1332 [2025-03-08 22:53:25,743 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 290 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:25,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 308 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 381 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2025-03-08 22:53:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-08 22:53:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 286. [2025-03-08 22:53:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 262 states have (on average 1.133587786259542) internal successors, (297), 271 states have internal predecessors, (297), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-08 22:53:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 317 transitions. [2025-03-08 22:53:25,747 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 317 transitions. Word has length 54 [2025-03-08 22:53:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:25,747 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 317 transitions. [2025-03-08 22:53:25,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:53:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 317 transitions. [2025-03-08 22:53:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 22:53:25,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:25,748 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:25,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:25,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-08 22:53:25,952 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:25,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2143091523, now seen corresponding path program 1 times [2025-03-08 22:53:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:25,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407843297] [2025-03-08 22:53:25,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:25,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:53:25,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:53:25,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:25,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:26,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:26,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407843297] [2025-03-08 22:53:26,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407843297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:26,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205042821] [2025-03-08 22:53:26,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:26,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:26,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:26,262 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:26,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 22:53:26,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:53:26,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:53:26,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:26,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:26,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 22:53:26,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:26,525 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-08 22:53:26,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-08 22:53:26,902 INFO L349 Elim1Store]: treesize reduction 86, result has 22.5 percent of original size [2025-03-08 22:53:26,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 45 treesize of output 83 [2025-03-08 22:53:26,960 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-08 22:53:26,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 1 [2025-03-08 22:53:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:27,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205042821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:27,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:27,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 27 [2025-03-08 22:53:27,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660667437] [2025-03-08 22:53:27,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:27,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 22:53:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:27,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 22:53:27,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:53:27,248 INFO L87 Difference]: Start difference. First operand 286 states and 317 transitions. Second operand has 29 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:53:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:28,372 INFO L93 Difference]: Finished difference Result 315 states and 343 transitions. [2025-03-08 22:53:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 22:53:28,373 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 60 [2025-03-08 22:53:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:28,373 INFO L225 Difference]: With dead ends: 315 [2025-03-08 22:53:28,373 INFO L226 Difference]: Without dead ends: 315 [2025-03-08 22:53:28,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=558, Invalid=2748, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 22:53:28,374 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 495 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:28,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 384 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:53:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-08 22:53:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 292. [2025-03-08 22:53:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 270 states have (on average 1.125925925925926) internal successors, (304), 277 states have internal predecessors, (304), 7 states have call successors, (7), 7 states have call predecessors, (7), 11 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-08 22:53:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 322 transitions. [2025-03-08 22:53:28,379 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 322 transitions. Word has length 60 [2025-03-08 22:53:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:28,379 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 322 transitions. [2025-03-08 22:53:28,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:53:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 322 transitions. [2025-03-08 22:53:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 22:53:28,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:28,379 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:28,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:28,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:28,584 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:28,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2011327747, now seen corresponding path program 1 times [2025-03-08 22:53:28,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:28,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165887626] [2025-03-08 22:53:28,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:28,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 22:53:28,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 22:53:28,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:28,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:28,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165887626] [2025-03-08 22:53:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165887626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:28,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491895409] [2025-03-08 22:53:28,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:28,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:28,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:28,940 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:28,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 22:53:28,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 22:53:29,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 22:53:29,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:29,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:29,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 22:53:29,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:29,237 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 22:53:29,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 22:53:29,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:53:29,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:53:29,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:53:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 22:53:29,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491895409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:29,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:29,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 24 [2025-03-08 22:53:29,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225055349] [2025-03-08 22:53:29,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:29,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 22:53:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:29,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 22:53:29,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2025-03-08 22:53:29,821 INFO L87 Difference]: Start difference. First operand 292 states and 322 transitions. Second operand has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:53:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:30,711 INFO L93 Difference]: Finished difference Result 346 states and 374 transitions. [2025-03-08 22:53:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 22:53:30,711 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 61 [2025-03-08 22:53:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:30,712 INFO L225 Difference]: With dead ends: 346 [2025-03-08 22:53:30,712 INFO L226 Difference]: Without dead ends: 346 [2025-03-08 22:53:30,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=553, Invalid=2527, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 22:53:30,713 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 508 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:30,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 286 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:53:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-08 22:53:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 244. [2025-03-08 22:53:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 226 states have (on average 1.1150442477876106) internal successors, (252), 231 states have internal predecessors, (252), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-08 22:53:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 267 transitions. [2025-03-08 22:53:30,716 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 267 transitions. Word has length 61 [2025-03-08 22:53:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:30,716 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 267 transitions. [2025-03-08 22:53:30,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:53:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 267 transitions. [2025-03-08 22:53:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 22:53:30,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:30,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:30,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 22:53:30,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:30,917 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting parse_inputErr9ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:30,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash -858121800, now seen corresponding path program 1 times [2025-03-08 22:53:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:30,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819058860] [2025-03-08 22:53:30,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:30,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:53:30,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:53:30,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:30,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819058860] [2025-03-08 22:53:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819058860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:31,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743030401] [2025-03-08 22:53:31,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:31,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:31,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:31,120 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:31,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 22:53:31,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:53:31,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:53:31,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:31,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:31,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 22:53:31,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:31,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:53:31,308 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 22:53:31,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 22:53:31,328 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 22:53:31,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-08 22:53:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:31,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:31,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743030401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:31,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:31,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-08 22:53:31,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363677691] [2025-03-08 22:53:31,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:31,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:53:31,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:31,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:53:31,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:53:31,396 INFO L87 Difference]: Start difference. First operand 244 states and 267 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:53:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:31,509 INFO L93 Difference]: Finished difference Result 302 states and 331 transitions. [2025-03-08 22:53:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:53:31,509 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2025-03-08 22:53:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:31,510 INFO L225 Difference]: With dead ends: 302 [2025-03-08 22:53:31,510 INFO L226 Difference]: Without dead ends: 302 [2025-03-08 22:53:31,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:53:31,511 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 33 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:31,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 152 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-08 22:53:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 289. [2025-03-08 22:53:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 267 states have (on average 1.1161048689138577) internal successors, (298), 274 states have internal predecessors, (298), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-08 22:53:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 318 transitions. [2025-03-08 22:53:31,514 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 318 transitions. Word has length 66 [2025-03-08 22:53:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:31,514 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 318 transitions. [2025-03-08 22:53:31,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:53:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 318 transitions. [2025-03-08 22:53:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 22:53:31,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:31,514 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:31,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:31,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:31,719 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:31,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:31,719 INFO L85 PathProgramCache]: Analyzing trace with hash -11132690, now seen corresponding path program 1 times [2025-03-08 22:53:31,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:31,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600118931] [2025-03-08 22:53:31,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:31,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:31,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:53:31,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:53:31,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:31,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:53:31,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:53:31,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:53:31,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:53:31,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:31,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:53:31,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:53:31,764 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:53:31,765 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 23 remaining) [2025-03-08 22:53:31,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE (21 of 23 remaining) [2025-03-08 22:53:31,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE (20 of 23 remaining) [2025-03-08 22:53:31,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (19 of 23 remaining) [2025-03-08 22:53:31,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_FREE (18 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_FREE (17 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE (16 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6ASSERT_VIOLATIONMEMORY_FREE (15 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE (14 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE (13 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9ASSERT_VIOLATIONMEMORY_FREE (12 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (11 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (10 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-03-08 22:53:31,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-03-08 22:53:31,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-03-08 22:53:31,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2025-03-08 22:53:31,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:53:31,770 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:31,830 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:53:31,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:53:31 BoogieIcfgContainer [2025-03-08 22:53:31,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:53:31,834 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:53:31,834 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:53:31,835 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:53:31,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:53:03" (3/4) ... [2025-03-08 22:53:31,836 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 22:53:31,837 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:53:31,838 INFO L158 Benchmark]: Toolchain (without parser) took 29081.44ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 157.6MB in the beginning and 179.2MB in the end (delta: -21.5MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. [2025-03-08 22:53:31,838 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:53:31,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.85ms. Allocated memory is still 201.3MB. Free memory was 157.6MB in the beginning and 137.7MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:53:31,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.11ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 135.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:53:31,839 INFO L158 Benchmark]: Boogie Preprocessor took 29.40ms. Allocated memory is still 201.3MB. Free memory was 135.9MB in the beginning and 134.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:53:31,839 INFO L158 Benchmark]: IcfgBuilder took 329.12ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 116.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:53:31,839 INFO L158 Benchmark]: TraceAbstraction took 28393.26ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 115.9MB in the beginning and 179.2MB in the end (delta: -63.3MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2025-03-08 22:53:31,839 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 352.3MB. Free memory was 179.2MB in the beginning and 179.2MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:53:31,839 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.22ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.85ms. Allocated memory is still 201.3MB. Free memory was 157.6MB in the beginning and 137.7MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.11ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 135.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.40ms. Allocated memory is still 201.3MB. Free memory was 135.9MB in the beginning and 134.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 329.12ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 116.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28393.26ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 115.9MB in the beginning and 179.2MB in the end (delta: -63.3MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 352.3MB. Free memory was 179.2MB in the beginning and 179.2MB in the end (delta: 60.1kB). 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 - UnprovableResult [Line: 722]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 722. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L723] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, input={3:0}, state=0] [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L723] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L724] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, input={4:0}, state=1] [L692] COND FALSE !(i < 2) [L724] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L725] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, input={5:0}, state=1] [L692] COND FALSE !(i < 2) [L725] RET parse_input("c2") VAL [commands={6:0}, global={7:0}, state=1] [L726] return 0; VAL [\result=0, commands={6:0}, global={7:0}, state=1] - UnprovableResult [Line: 719]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 78 edges, 23 error locations. Started 1 CEGAR loops. OverallTime: 28.3s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7389 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7389 mSDsluCounter, 8074 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 252 IncrementalHoareTripleChecker+Unchecked, 6389 mSDsCounter, 891 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8011 IncrementalHoareTripleChecker+Invalid, 9154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 891 mSolverCounterUnsat, 1685 mSDtfsCounter, 8011 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1884 GetRequests, 1250 SyntacticMatches, 14 SemanticMatches, 620 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4523 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=543occurred in iteration=22, InterpolantAutomatonStates: 373, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 1089 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 2049 NumberOfCodeBlocks, 2049 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 2259 ConstructedInterpolants, 145 QuantifiedInterpolants, 26616 SizeOfPredicates, 90 NumberOfNonLiveVariables, 5821 ConjunctsInSsa, 443 ConjunctsInUnsatCore, 67 InterpolantComputations, 13 PerfectInterpolantSequences, 404/1068 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 22:53:31,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:53:33,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:53:33,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-08 22:53:33,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:53:33,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:53:33,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:53:33,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:53:33,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:53:33,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:53:33,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:53:33,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:53:33,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:53:33,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:53:33,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:53:33,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:53:33,753 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:53:33,753 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:53:33,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:53:33,754 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10f5db0b7f76a0d4c4c35217e21dd4a594e7457adb3230ac21a302fd5d7ee15c [2025-03-08 22:53:34,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:53:34,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:53:34,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:53:34,011 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:53:34,011 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:53:34,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2025-03-08 22:53:35,253 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087da0336/19ab8002043a44109538500117097e08/FLAGcaa79b695 [2025-03-08 22:53:35,456 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:53:35,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2025-03-08 22:53:35,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087da0336/19ab8002043a44109538500117097e08/FLAGcaa79b695 [2025-03-08 22:53:35,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087da0336/19ab8002043a44109538500117097e08 [2025-03-08 22:53:35,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:53:35,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:53:35,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:53:35,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:53:35,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:53:35,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b39bf7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35, skipping insertion in model container [2025-03-08 22:53:35,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:53:35,728 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:53:35,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:53:35,747 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:53:35,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:53:35,813 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:53:35,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35 WrapperNode [2025-03-08 22:53:35,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:53:35,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:53:35,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:53:35,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:53:35,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,853 INFO L138 Inliner]: procedures = 169, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2025-03-08 22:53:35,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:53:35,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:53:35,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:53:35,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:53:35,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,872 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 6, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2025-03-08 22:53:35,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:53:35,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:53:35,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:53:35,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:53:35,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:53:35,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:35,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:53:35,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:53:35,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 22:53:35,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 22:53:35,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 22:53:35,937 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-03-08 22:53:35,937 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-03-08 22:53:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:53:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:53:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:53:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:53:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:53:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:53:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:53:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:53:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:53:35,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 22:53:35,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 22:53:35,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 22:53:35,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:53:35,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:53:36,020 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:53:36,022 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:53:36,280 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-08 22:53:36,280 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:53:36,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:53:36,288 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:53:36,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:53:36 BoogieIcfgContainer [2025-03-08 22:53:36,289 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:53:36,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:53:36,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:53:36,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:53:36,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:53:35" (1/3) ... [2025-03-08 22:53:36,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769932a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:53:36, skipping insertion in model container [2025-03-08 22:53:36,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35" (2/3) ... [2025-03-08 22:53:36,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769932a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:53:36, skipping insertion in model container [2025-03-08 22:53:36,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:53:36" (3/3) ... [2025-03-08 22:53:36,297 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2025-03-08 22:53:36,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:53:36,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_1.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 23 error locations. [2025-03-08 22:53:36,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:53:36,342 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;@62eba5ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:53:36,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-08 22:53:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 62 states have internal predecessors, (69), 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-03-08 22:53:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:53:36,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:36,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:53:36,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:36,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1219042610, now seen corresponding path program 1 times [2025-03-08 22:53:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:36,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752099808] [2025-03-08 22:53:36,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:36,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:36,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:36,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:36,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:53:36,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:53:36,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:53:36,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:36,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:36,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:53:36,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:36,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:36,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:36,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752099808] [2025-03-08 22:53:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752099808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:53:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90847121] [2025-03-08 22:53:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:36,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:53:36,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:36,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:53:36,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:36,572 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:36,712 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2025-03-08 22:53:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:53:36,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:53:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:36,722 INFO L225 Difference]: With dead ends: 121 [2025-03-08 22:53:36,722 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 22:53:36,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:36,725 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 56 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:36,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 109 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 22:53:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2025-03-08 22:53:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.7241379310344827) internal successors, (100), 80 states have internal predecessors, (100), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-08 22:53:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2025-03-08 22:53:36,759 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 6 [2025-03-08 22:53:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:36,759 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2025-03-08 22:53:36,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2025-03-08 22:53:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:53:36,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:36,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:53:36,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:53:36,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:36,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:36,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1219042609, now seen corresponding path program 1 times [2025-03-08 22:53:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:36,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612782214] [2025-03-08 22:53:36,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:36,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:36,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:36,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:36,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:53:37,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:53:37,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:53:37,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:37,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:37,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:53:37,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:37,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:37,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:37,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612782214] [2025-03-08 22:53:37,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612782214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:37,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:37,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:53:37,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713206219] [2025-03-08 22:53:37,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:37,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:53:37,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:37,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:53:37,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:53:37,107 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:37,243 INFO L93 Difference]: Finished difference Result 187 states and 247 transitions. [2025-03-08 22:53:37,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:53:37,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:53:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:37,245 INFO L225 Difference]: With dead ends: 187 [2025-03-08 22:53:37,247 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 22:53:37,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:53:37,247 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 92 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:37,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 154 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 22:53:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 156. [2025-03-08 22:53:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 120 states have (on average 1.7666666666666666) internal successors, (212), 142 states have internal predecessors, (212), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-08 22:53:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 243 transitions. [2025-03-08 22:53:37,264 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 243 transitions. Word has length 6 [2025-03-08 22:53:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:37,264 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 243 transitions. [2025-03-08 22:53:37,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 243 transitions. [2025-03-08 22:53:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:53:37,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:37,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:37,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:53:37,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:37,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:37,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash 864384782, now seen corresponding path program 1 times [2025-03-08 22:53:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:37,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553089493] [2025-03-08 22:53:37,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:37,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:37,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:37,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:37,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:53:37,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:53:37,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:53:37,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:37,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:37,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:53:37,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:37,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:37,631 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:37,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553089493] [2025-03-08 22:53:37,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553089493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:37,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:37,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:37,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949484708] [2025-03-08 22:53:37,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:37,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:37,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:37,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:37,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:37,632 INFO L87 Difference]: Start difference. First operand 156 states and 243 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-03-08 22:53:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:37,803 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2025-03-08 22:53:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:37,803 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-03-08 22:53:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:37,805 INFO L225 Difference]: With dead ends: 207 [2025-03-08 22:53:37,805 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 22:53:37,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:37,807 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:37,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 183 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:37,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 22:53:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 159. [2025-03-08 22:53:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 123 states have (on average 1.7479674796747968) internal successors, (215), 145 states have internal predecessors, (215), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-08 22:53:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 246 transitions. [2025-03-08 22:53:37,818 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 246 transitions. Word has length 7 [2025-03-08 22:53:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:37,818 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 246 transitions. [2025-03-08 22:53:37,818 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-03-08 22:53:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 246 transitions. [2025-03-08 22:53:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:53:37,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:37,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:37,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:53:38,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:38,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:38,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:38,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1026124492, now seen corresponding path program 1 times [2025-03-08 22:53:38,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:38,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186912628] [2025-03-08 22:53:38,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:38,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:38,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:38,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:38,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:53:38,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:53:38,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:53:38,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:38,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:38,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 22:53:38,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:38,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:38,192 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:38,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186912628] [2025-03-08 22:53:38,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186912628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:38,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:38,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:38,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437402693] [2025-03-08 22:53:38,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:38,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:38,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:38,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:38,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:38,193 INFO L87 Difference]: Start difference. First operand 159 states and 246 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:38,342 INFO L93 Difference]: Finished difference Result 189 states and 248 transitions. [2025-03-08 22:53:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:38,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:53:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:38,343 INFO L225 Difference]: With dead ends: 189 [2025-03-08 22:53:38,343 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 22:53:38,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:38,345 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 89 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:38,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 205 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:38,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 22:53:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 159. [2025-03-08 22:53:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 145 states have internal predecessors, (213), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-08 22:53:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 244 transitions. [2025-03-08 22:53:38,361 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 244 transitions. Word has length 8 [2025-03-08 22:53:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:38,361 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 244 transitions. [2025-03-08 22:53:38,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2025-03-08 22:53:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:53:38,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:38,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:38,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:38,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:38,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:38,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:38,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1745088204, now seen corresponding path program 1 times [2025-03-08 22:53:38,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:38,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104573251] [2025-03-08 22:53:38,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:38,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:38,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:38,568 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:38,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:53:38,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:53:38,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:53:38,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:38,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:38,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:53:38,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:38,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:38,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:38,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104573251] [2025-03-08 22:53:38,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104573251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:38,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:38,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:38,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028109604] [2025-03-08 22:53:38,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:38,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:38,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:38,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:38,681 INFO L87 Difference]: Start difference. First operand 159 states and 244 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:38,805 INFO L93 Difference]: Finished difference Result 253 states and 346 transitions. [2025-03-08 22:53:38,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:38,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 22:53:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:38,807 INFO L225 Difference]: With dead ends: 253 [2025-03-08 22:53:38,807 INFO L226 Difference]: Without dead ends: 253 [2025-03-08 22:53:38,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:38,808 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 188 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:38,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 184 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-08 22:53:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 192. [2025-03-08 22:53:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 154 states have (on average 1.6818181818181819) internal successors, (259), 177 states have internal predecessors, (259), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-08 22:53:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 290 transitions. [2025-03-08 22:53:38,831 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 290 transitions. Word has length 9 [2025-03-08 22:53:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:38,831 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 290 transitions. [2025-03-08 22:53:38,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 290 transitions. [2025-03-08 22:53:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:53:38,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:38,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:38,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:53:39,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:39,032 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:39,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:39,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1736840502, now seen corresponding path program 1 times [2025-03-08 22:53:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953878955] [2025-03-08 22:53:39,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:39,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:39,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:39,035 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:39,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:53:39,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:53:39,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:53:39,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:39,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:39,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:53:39,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:39,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:39,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:39,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953878955] [2025-03-08 22:53:39,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953878955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:39,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:39,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:39,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470958263] [2025-03-08 22:53:39,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:39,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:39,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:39,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:39,149 INFO L87 Difference]: Start difference. First operand 192 states and 290 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:39,282 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2025-03-08 22:53:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:39,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:53:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:39,284 INFO L225 Difference]: With dead ends: 242 [2025-03-08 22:53:39,284 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 22:53:39,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:39,284 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 179 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:39,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 206 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 22:53:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 206. [2025-03-08 22:53:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 167 states have (on average 1.6766467065868262) internal successors, (280), 191 states have internal predecessors, (280), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-08 22:53:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions. [2025-03-08 22:53:39,296 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 10 [2025-03-08 22:53:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:39,296 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 311 transitions. [2025-03-08 22:53:39,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions. [2025-03-08 22:53:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:53:39,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:39,296 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:39,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:53:39,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:39,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:39,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1600349994, now seen corresponding path program 1 times [2025-03-08 22:53:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:39,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644972443] [2025-03-08 22:53:39,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:39,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:39,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:39,499 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:39,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:53:39,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:53:39,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:53:39,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:39,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:39,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:53:39,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:39,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:39,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:39,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644972443] [2025-03-08 22:53:39,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644972443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:39,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:39,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-03-08 22:53:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897387713] [2025-03-08 22:53:39,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:39,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:53:39,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:39,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:53:39,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:53:39,846 INFO L87 Difference]: Start difference. First operand 206 states and 311 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:40,110 INFO L93 Difference]: Finished difference Result 277 states and 368 transitions. [2025-03-08 22:53:40,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:53:40,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:53:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:40,112 INFO L225 Difference]: With dead ends: 277 [2025-03-08 22:53:40,112 INFO L226 Difference]: Without dead ends: 277 [2025-03-08 22:53:40,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:53:40,112 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 121 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:40,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 383 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-08 22:53:40,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 236. [2025-03-08 22:53:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 197 states have (on average 1.6649746192893402) internal successors, (328), 221 states have internal predecessors, (328), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-08 22:53:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 359 transitions. [2025-03-08 22:53:40,120 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 359 transitions. Word has length 14 [2025-03-08 22:53:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:40,120 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 359 transitions. [2025-03-08 22:53:40,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 359 transitions. [2025-03-08 22:53:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:53:40,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:40,121 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:40,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:53:40,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:40,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:40,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:40,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1928757735, now seen corresponding path program 1 times [2025-03-08 22:53:40,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:40,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1681890385] [2025-03-08 22:53:40,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:40,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:40,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:40,331 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:40,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:53:40,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:53:40,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:53:40,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:40,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:40,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 22:53:40,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:40,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:40,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:40,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681890385] [2025-03-08 22:53:40,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681890385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:40,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:40,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-08 22:53:40,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458967388] [2025-03-08 22:53:40,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:40,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:53:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:40,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:53:40,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:53:40,875 INFO L87 Difference]: Start difference. First operand 236 states and 359 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:42,092 INFO L93 Difference]: Finished difference Result 372 states and 510 transitions. [2025-03-08 22:53:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:53:42,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 22:53:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:42,094 INFO L225 Difference]: With dead ends: 372 [2025-03-08 22:53:42,094 INFO L226 Difference]: Without dead ends: 372 [2025-03-08 22:53:42,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:53:42,094 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 336 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:42,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 361 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 22:53:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-08 22:53:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 274. [2025-03-08 22:53:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 235 states have (on average 1.6595744680851063) internal successors, (390), 259 states have internal predecessors, (390), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-08 22:53:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 421 transitions. [2025-03-08 22:53:42,101 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 421 transitions. Word has length 15 [2025-03-08 22:53:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:42,101 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 421 transitions. [2025-03-08 22:53:42,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 421 transitions. [2025-03-08 22:53:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:53:42,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:42,102 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:42,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 22:53:42,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:42,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:42,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:42,303 INFO L85 PathProgramCache]: Analyzing trace with hash -338052333, now seen corresponding path program 1 times [2025-03-08 22:53:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:42,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775973583] [2025-03-08 22:53:42,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:42,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:42,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:42,306 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:42,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:53:42,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:53:42,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:53:42,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:42,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:42,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 22:53:42,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:42,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:42,883 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:42,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775973583] [2025-03-08 22:53:42,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775973583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:42,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:42,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-08 22:53:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361625458] [2025-03-08 22:53:42,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:42,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:53:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:42,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:53:42,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:53:42,885 INFO L87 Difference]: Start difference. First operand 274 states and 421 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:43,988 INFO L93 Difference]: Finished difference Result 504 states and 693 transitions. [2025-03-08 22:53:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:53:43,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 22:53:43,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:43,991 INFO L225 Difference]: With dead ends: 504 [2025-03-08 22:53:43,991 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 22:53:43,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:53:43,992 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 316 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:43,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 482 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:53:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 22:53:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 377. [2025-03-08 22:53:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 334 states have (on average 1.688622754491018) internal successors, (564), 358 states have internal predecessors, (564), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-08 22:53:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 606 transitions. [2025-03-08 22:53:44,003 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 606 transitions. Word has length 16 [2025-03-08 22:53:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:44,003 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 606 transitions. [2025-03-08 22:53:44,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 606 transitions. [2025-03-08 22:53:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:53:44,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:44,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:44,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 22:53:44,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:44,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:44,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1444392243, now seen corresponding path program 1 times [2025-03-08 22:53:44,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:44,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123814535] [2025-03-08 22:53:44,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:44,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:44,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:44,208 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:44,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 22:53:44,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:53:44,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:53:44,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:44,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:44,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:53:44,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:44,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:44,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:44,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123814535] [2025-03-08 22:53:44,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123814535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:44,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:44,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:53:44,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492291406] [2025-03-08 22:53:44,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:44,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:53:44,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:44,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:53:44,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:44,277 INFO L87 Difference]: Start difference. First operand 377 states and 606 transitions. Second operand has 3 states, 2 states have (on average 8.5) 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-03-08 22:53:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:44,295 INFO L93 Difference]: Finished difference Result 517 states and 829 transitions. [2025-03-08 22:53:44,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:53:44,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) 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-03-08 22:53:44,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:44,298 INFO L225 Difference]: With dead ends: 517 [2025-03-08 22:53:44,298 INFO L226 Difference]: Without dead ends: 517 [2025-03-08 22:53:44,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:44,298 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:44,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-08 22:53:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 501. [2025-03-08 22:53:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 449 states have (on average 1.6815144766146994) internal successors, (755), 475 states have internal predecessors, (755), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2025-03-08 22:53:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 827 transitions. [2025-03-08 22:53:44,310 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 827 transitions. Word has length 18 [2025-03-08 22:53:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:44,310 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 827 transitions. [2025-03-08 22:53:44,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) 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-03-08 22:53:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 827 transitions. [2025-03-08 22:53:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:53:44,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:44,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:44,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:53:44,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:44,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:44,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:44,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1444392267, now seen corresponding path program 1 times [2025-03-08 22:53:44,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:44,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275225675] [2025-03-08 22:53:44,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:44,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:44,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:44,514 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:44,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:53:44,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:53:44,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:53:44,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:44,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:44,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 22:53:44,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:44,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:44,572 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275225675] [2025-03-08 22:53:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275225675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:44,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:53:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54435207] [2025-03-08 22:53:44,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:44,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:53:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:44,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:53:44,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:44,573 INFO L87 Difference]: Start difference. First operand 501 states and 827 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:44,581 INFO L93 Difference]: Finished difference Result 500 states and 821 transitions. [2025-03-08 22:53:44,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:53:44,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 22:53:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:44,584 INFO L225 Difference]: With dead ends: 500 [2025-03-08 22:53:44,584 INFO L226 Difference]: Without dead ends: 500 [2025-03-08 22:53:44,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:44,584 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:44,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-08 22:53:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-03-08 22:53:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 449 states have (on average 1.6681514476614698) internal successors, (749), 474 states have internal predecessors, (749), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2025-03-08 22:53:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 821 transitions. [2025-03-08 22:53:44,601 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 821 transitions. Word has length 18 [2025-03-08 22:53:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:44,601 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 821 transitions. [2025-03-08 22:53:44,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 821 transitions. [2025-03-08 22:53:44,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:53:44,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:44,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:44,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 22:53:44,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:44,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:44,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:44,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1826486563, now seen corresponding path program 1 times [2025-03-08 22:53:44,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:44,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949521639] [2025-03-08 22:53:44,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:44,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:44,806 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:44,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 22:53:44,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:53:44,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:53:44,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:44,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:44,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:53:44,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:44,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:44,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:44,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949521639] [2025-03-08 22:53:44,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949521639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:44,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:44,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:53:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845566418] [2025-03-08 22:53:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:44,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:53:44,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:44,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:53:44,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:44,896 INFO L87 Difference]: Start difference. First operand 500 states and 821 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:44,934 INFO L93 Difference]: Finished difference Result 574 states and 907 transitions. [2025-03-08 22:53:44,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:53:44,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:53:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:44,936 INFO L225 Difference]: With dead ends: 574 [2025-03-08 22:53:44,936 INFO L226 Difference]: Without dead ends: 574 [2025-03-08 22:53:44,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:44,936 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 44 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:44,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 107 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-08 22:53:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 557. [2025-03-08 22:53:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 503 states have (on average 1.6441351888667992) internal successors, (827), 529 states have internal predecessors, (827), 16 states have call successors, (16), 11 states have call predecessors, (16), 16 states have return successors, (60), 16 states have call predecessors, (60), 16 states have call successors, (60) [2025-03-08 22:53:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 903 transitions. [2025-03-08 22:53:44,948 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 903 transitions. Word has length 19 [2025-03-08 22:53:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:44,948 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 903 transitions. [2025-03-08 22:53:44,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 903 transitions. [2025-03-08 22:53:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:53:44,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:44,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:44,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 22:53:45,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:45,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:45,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:45,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1826487300, now seen corresponding path program 1 times [2025-03-08 22:53:45,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:45,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300396095] [2025-03-08 22:53:45,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:45,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:45,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:45,153 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:45,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 22:53:45,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:53:45,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:53:45,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:45,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:45,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:53:45,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:45,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:45,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:45,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300396095] [2025-03-08 22:53:45,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300396095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:45,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:45,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060317350] [2025-03-08 22:53:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:45,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:53:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:45,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:53:45,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:45,209 INFO L87 Difference]: Start difference. First operand 557 states and 903 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:45,214 INFO L93 Difference]: Finished difference Result 512 states and 836 transitions. [2025-03-08 22:53:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:53:45,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:53:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:45,218 INFO L225 Difference]: With dead ends: 512 [2025-03-08 22:53:45,218 INFO L226 Difference]: Without dead ends: 512 [2025-03-08 22:53:45,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:45,218 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:45,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-08 22:53:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-03-08 22:53:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 463 states have (on average 1.6414686825053997) internal successors, (760), 484 states have internal predecessors, (760), 16 states have call successors, (16), 11 states have call predecessors, (16), 16 states have return successors, (60), 16 states have call predecessors, (60), 16 states have call successors, (60) [2025-03-08 22:53:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 836 transitions. [2025-03-08 22:53:45,230 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 836 transitions. Word has length 19 [2025-03-08 22:53:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:45,231 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 836 transitions. [2025-03-08 22:53:45,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 836 transitions. [2025-03-08 22:53:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:53:45,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:45,232 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-08 22:53:45,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 22:53:45,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:45,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:45,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash 699095005, now seen corresponding path program 2 times [2025-03-08 22:53:45,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:45,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185378711] [2025-03-08 22:53:45,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:53:45,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:45,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:45,437 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:45,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 22:53:45,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-08 22:53:45,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:53:45,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:53:45,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:45,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:53:45,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:45,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:45,554 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:45,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185378711] [2025-03-08 22:53:45,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185378711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:45,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:45,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-08 22:53:45,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947860027] [2025-03-08 22:53:45,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:45,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:53:45,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:45,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:53:45,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:53:45,555 INFO L87 Difference]: Start difference. First operand 512 states and 836 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:45,618 INFO L93 Difference]: Finished difference Result 450 states and 689 transitions. [2025-03-08 22:53:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:45,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 22:53:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:45,620 INFO L225 Difference]: With dead ends: 450 [2025-03-08 22:53:45,621 INFO L226 Difference]: Without dead ends: 450 [2025-03-08 22:53:45,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:53:45,621 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 22 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:45,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 316 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-08 22:53:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 432. [2025-03-08 22:53:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 383 states have (on average 1.5378590078328982) internal successors, (589), 404 states have internal predecessors, (589), 16 states have call successors, (16), 11 states have call predecessors, (16), 16 states have return successors, (60), 16 states have call predecessors, (60), 16 states have call successors, (60) [2025-03-08 22:53:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 665 transitions. [2025-03-08 22:53:45,637 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 665 transitions. Word has length 22 [2025-03-08 22:53:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:45,637 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 665 transitions. [2025-03-08 22:53:45,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:53:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 665 transitions. [2025-03-08 22:53:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:53:45,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:45,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:45,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:45,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:45,839 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:45,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1009783700, now seen corresponding path program 1 times [2025-03-08 22:53:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:45,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784197824] [2025-03-08 22:53:45,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:45,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:45,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:45,841 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:45,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 22:53:45,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:53:45,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:53:45,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:45,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:45,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 22:53:45,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:45,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:45,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784197824] [2025-03-08 22:53:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784197824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905476787] [2025-03-08 22:53:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:53:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:45,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:53:45,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:45,897 INFO L87 Difference]: Start difference. First operand 432 states and 665 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:45,907 INFO L93 Difference]: Finished difference Result 315 states and 467 transitions. [2025-03-08 22:53:45,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:53:45,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-08 22:53:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:45,909 INFO L225 Difference]: With dead ends: 315 [2025-03-08 22:53:45,909 INFO L226 Difference]: Without dead ends: 315 [2025-03-08 22:53:45,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:53:45,910 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:45,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 104 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-08 22:53:45,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-03-08 22:53:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 275 states have (on average 1.52) internal successors, (418), 294 states have internal predecessors, (418), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (37), 12 states have call predecessors, (37), 12 states have call successors, (37) [2025-03-08 22:53:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2025-03-08 22:53:45,915 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 25 [2025-03-08 22:53:45,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:45,915 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2025-03-08 22:53:45,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:53:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2025-03-08 22:53:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:53:45,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:45,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:45,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 22:53:46,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:46,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:46,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:46,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1984033445, now seen corresponding path program 1 times [2025-03-08 22:53:46,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:46,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659328677] [2025-03-08 22:53:46,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:46,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:46,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:46,119 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:46,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 22:53:46,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:53:46,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:53:46,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:46,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:46,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:53:46,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:46,323 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:53:46,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-08 22:53:46,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:53:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:46,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:46,580 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-03-08 22:53:46,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2025-03-08 22:53:51,041 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-03-08 22:53:51,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2025-03-08 22:53:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:51,128 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:51,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659328677] [2025-03-08 22:53:51,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659328677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:51,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:51,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2025-03-08 22:53:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401216249] [2025-03-08 22:53:51,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:51,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:53:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:51,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:53:51,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=3, NotChecked=0, Total=110 [2025-03-08 22:53:51,129 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:55,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:53:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:57,640 INFO L93 Difference]: Finished difference Result 352 states and 486 transitions. [2025-03-08 22:53:57,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:53:57,641 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-08 22:53:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:57,642 INFO L225 Difference]: With dead ends: 352 [2025-03-08 22:53:57,642 INFO L226 Difference]: Without dead ends: 352 [2025-03-08 22:53:57,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=119, Invalid=217, Unknown=6, NotChecked=0, Total=342 [2025-03-08 22:53:57,643 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 168 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 35 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:57,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 93 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 106 Invalid, 16 Unknown, 0 Unchecked, 5.5s Time] [2025-03-08 22:53:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-08 22:53:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 339. [2025-03-08 22:53:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 294 states have (on average 1.380952380952381) internal successors, (406), 318 states have internal predecessors, (406), 12 states have call successors, (12), 8 states have call predecessors, (12), 19 states have return successors, (48), 12 states have call predecessors, (48), 12 states have call successors, (48) [2025-03-08 22:53:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 466 transitions. [2025-03-08 22:53:57,653 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 466 transitions. Word has length 27 [2025-03-08 22:53:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:57,653 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 466 transitions. [2025-03-08 22:53:57,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 466 transitions. [2025-03-08 22:53:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:53:57,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:57,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:57,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:57,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:57,854 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:53:57,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2043608466, now seen corresponding path program 1 times [2025-03-08 22:53:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371781489] [2025-03-08 22:53:57,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:57,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:57,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:57,857 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:53:57,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 22:53:57,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:53:57,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:53:57,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:57,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:57,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 22:53:57,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:59,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:59,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:59,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371781489] [2025-03-08 22:53:59,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371781489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:59,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:59,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:53:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190826209] [2025-03-08 22:53:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:59,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:53:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:59,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:53:59,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:53:59,585 INFO L87 Difference]: Start difference. First operand 339 states and 466 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:00,620 INFO L93 Difference]: Finished difference Result 358 states and 477 transitions. [2025-03-08 22:54:00,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:54:00,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-08 22:54:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:00,622 INFO L225 Difference]: With dead ends: 358 [2025-03-08 22:54:00,622 INFO L226 Difference]: Without dead ends: 358 [2025-03-08 22:54:00,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:54:00,623 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 90 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:00,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 214 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:54:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-08 22:54:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 348. [2025-03-08 22:54:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 303 states have (on average 1.3696369636963697) internal successors, (415), 327 states have internal predecessors, (415), 12 states have call successors, (12), 8 states have call predecessors, (12), 19 states have return successors, (48), 12 states have call predecessors, (48), 12 states have call successors, (48) [2025-03-08 22:54:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 475 transitions. [2025-03-08 22:54:00,629 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 475 transitions. Word has length 28 [2025-03-08 22:54:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:00,629 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 475 transitions. [2025-03-08 22:54:00,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 475 transitions. [2025-03-08 22:54:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:54:00,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:00,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:00,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 22:54:00,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:00,830 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:54:00,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash -309338846, now seen corresponding path program 1 times [2025-03-08 22:54:00,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:00,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206441972] [2025-03-08 22:54:00,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:00,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:00,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:00,834 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:00,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 22:54:00,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:54:00,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:54:00,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:00,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:00,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:54:00,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:02,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:54:02,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:54:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:03,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:07,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:07,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206441972] [2025-03-08 22:54:07,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206441972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:07,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1065465481] [2025-03-08 22:54:07,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:07,909 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:54:07,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:54:07,911 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:54:07,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-03-08 22:54:07,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:54:08,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:54:08,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:08,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:08,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 22:54:08,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:09,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:54:09,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:54:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:09,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1065465481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:14,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:54:14,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2025-03-08 22:54:14,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344189188] [2025-03-08 22:54:14,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:54:14,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:54:14,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:14,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:54:14,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2025-03-08 22:54:14,567 INFO L87 Difference]: Start difference. First operand 348 states and 475 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:17,610 INFO L93 Difference]: Finished difference Result 370 states and 502 transitions. [2025-03-08 22:54:17,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:54:17,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-08 22:54:17,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:17,612 INFO L225 Difference]: With dead ends: 370 [2025-03-08 22:54:17,612 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 22:54:17,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=152, Invalid=399, Unknown=1, NotChecked=0, Total=552 [2025-03-08 22:54:17,613 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 199 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:17,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 143 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 22:54:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 22:54:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 363. [2025-03-08 22:54:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 315 states have (on average 1.3492063492063493) internal successors, (425), 336 states have internal predecessors, (425), 15 states have call successors, (15), 11 states have call predecessors, (15), 19 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2025-03-08 22:54:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 500 transitions. [2025-03-08 22:54:17,619 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 500 transitions. Word has length 29 [2025-03-08 22:54:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:17,619 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 500 transitions. [2025-03-08 22:54:17,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 500 transitions. [2025-03-08 22:54:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:54:17,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:17,620 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:17,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2025-03-08 22:54:17,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 22:54:18,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:18,023 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:54:18,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:18,024 INFO L85 PathProgramCache]: Analyzing trace with hash 179331362, now seen corresponding path program 1 times [2025-03-08 22:54:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:18,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401108362] [2025-03-08 22:54:18,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:18,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:18,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:18,026 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:18,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 22:54:18,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:54:18,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:54:18,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:18,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:18,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:54:18,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:18,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:18,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:18,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401108362] [2025-03-08 22:54:18,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401108362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:18,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:18,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:54:18,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040570463] [2025-03-08 22:54:18,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:18,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:54:18,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:18,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:54:18,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:54:18,508 INFO L87 Difference]: Start difference. First operand 363 states and 500 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:19,037 INFO L93 Difference]: Finished difference Result 352 states and 463 transitions. [2025-03-08 22:54:19,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:54:19,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-08 22:54:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:19,039 INFO L225 Difference]: With dead ends: 352 [2025-03-08 22:54:19,039 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 22:54:19,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:54:19,039 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 88 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:19,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 172 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:54:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 22:54:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 344. [2025-03-08 22:54:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 300 states have (on average 1.3466666666666667) internal successors, (404), 322 states have internal predecessors, (404), 12 states have call successors, (12), 9 states have call predecessors, (12), 18 states have return successors, (42), 12 states have call predecessors, (42), 12 states have call successors, (42) [2025-03-08 22:54:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 458 transitions. [2025-03-08 22:54:19,044 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 458 transitions. Word has length 30 [2025-03-08 22:54:19,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:19,045 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 458 transitions. [2025-03-08 22:54:19,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 458 transitions. [2025-03-08 22:54:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:54:19,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:19,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:19,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 22:54:19,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:19,249 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:54:19,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash -999569610, now seen corresponding path program 1 times [2025-03-08 22:54:19,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:19,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118538476] [2025-03-08 22:54:19,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:19,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:19,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:19,251 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:19,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 22:54:19,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:54:19,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:54:19,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:19,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:19,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 22:54:19,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:19,549 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (select |c_#valid| |parse_input_c1_~x~0#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|)))) is different from true [2025-03-08 22:54:19,816 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-08 22:54:19,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 22:54:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:20,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:21,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118538476] [2025-03-08 22:54:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118538476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:54:21,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:54:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2025-03-08 22:54:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656058831] [2025-03-08 22:54:21,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:54:21,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:54:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:21,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:54:21,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2025-03-08 22:54:21,178 INFO L87 Difference]: Start difference. First operand 344 states and 458 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:54:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:23,213 INFO L93 Difference]: Finished difference Result 466 states and 579 transitions. [2025-03-08 22:54:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:54:23,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-08 22:54:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:23,215 INFO L225 Difference]: With dead ends: 466 [2025-03-08 22:54:23,215 INFO L226 Difference]: Without dead ends: 466 [2025-03-08 22:54:23,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=265, Unknown=1, NotChecked=36, Total=420 [2025-03-08 22:54:23,215 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 270 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:23,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 230 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 153 Unchecked, 1.2s Time] [2025-03-08 22:54:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-08 22:54:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 414. [2025-03-08 22:54:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 367 states have (on average 1.3106267029972751) internal successors, (481), 390 states have internal predecessors, (481), 12 states have call successors, (12), 11 states have call predecessors, (12), 21 states have return successors, (41), 12 states have call predecessors, (41), 12 states have call successors, (41) [2025-03-08 22:54:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 534 transitions. [2025-03-08 22:54:23,228 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 534 transitions. Word has length 30 [2025-03-08 22:54:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:23,229 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 534 transitions. [2025-03-08 22:54:23,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 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-03-08 22:54:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 534 transitions. [2025-03-08 22:54:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:54:23,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:23,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:23,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 22:54:23,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:23,430 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:54:23,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash -921886816, now seen corresponding path program 1 times [2025-03-08 22:54:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:23,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712191683] [2025-03-08 22:54:23,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:23,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:23,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:23,432 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:23,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 22:54:23,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:54:23,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:54:23,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:23,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:23,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 22:54:23,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:23,924 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| (select |c_#length| |parse_input_c1_~x~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|)))) is different from true [2025-03-08 22:54:24,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:54:24,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:54:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:24,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:25,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712191683] [2025-03-08 22:54:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712191683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [771115181] [2025-03-08 22:54:25,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:25,139 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:54:25,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:54:25,140 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:54:25,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2025-03-08 22:54:25,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:54:25,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:54:25,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:25,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:25,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 22:54:25,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:25,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:54:25,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:54:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:26,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [771115181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:26,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:54:26,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2025-03-08 22:54:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938450843] [2025-03-08 22:54:26,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:54:26,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:54:26,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:26,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:54:26,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2025-03-08 22:54:26,446 INFO L87 Difference]: Start difference. First operand 414 states and 534 transitions. Second operand has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:28,477 INFO L93 Difference]: Finished difference Result 566 states and 679 transitions. [2025-03-08 22:54:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:54:28,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-08 22:54:28,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:28,479 INFO L225 Difference]: With dead ends: 566 [2025-03-08 22:54:28,479 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 22:54:28,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=132, Invalid=291, Unknown=1, NotChecked=38, Total=462 [2025-03-08 22:54:28,480 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 243 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:28,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 177 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 152 Invalid, 0 Unknown, 206 Unchecked, 1.0s Time] [2025-03-08 22:54:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 22:54:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 512. [2025-03-08 22:54:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 460 states have (on average 1.3) internal successors, (598), 487 states have internal predecessors, (598), 12 states have call successors, (12), 12 states have call predecessors, (12), 26 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-03-08 22:54:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 646 transitions. [2025-03-08 22:54:28,487 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 646 transitions. Word has length 31 [2025-03-08 22:54:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:28,487 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 646 transitions. [2025-03-08 22:54:28,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 646 transitions. [2025-03-08 22:54:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:54:28,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:28,488 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:28,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2025-03-08 22:54:28,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 22:54:28,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:28,889 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE, parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (and 20 more)] === [2025-03-08 22:54:28,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:28,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1208314165, now seen corresponding path program 1 times [2025-03-08 22:54:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:28,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182663135] [2025-03-08 22:54:28,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:28,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:28,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:28,891 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:28,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 22:54:28,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:54:28,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:54:28,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:28,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:28,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 22:54:28,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:32,188 INFO L312 TraceCheckSpWp]: Computing backward predicates...