./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 798a7b37 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-?-798a7b3-m [2025-03-04 07:41:04,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:41:04,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:41:04,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:41:04,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:41:04,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:41:04,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:41:04,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:41:04,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:41:04,157 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:41:04,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:41:04,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:41:04,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:41:04,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:41:04,159 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:41:04,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:41:04,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:41:04,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:41:04,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:41:04,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:41:04,160 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:41:04,160 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:41:04,160 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:41:04,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:41:04,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:41:04,160 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:41:04,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:41:04,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:41:04,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:41:04,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:41:04,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:41:04,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:41:04,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:41:04,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:04,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:41:04,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:41:04,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:41:04,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:41:04,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:41:04,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:41:04,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:41:04,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:41:04,162 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-04 07:41:04,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:41:04,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:41:04,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:41:04,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:41:04,379 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:41:04,380 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-04 07:41:05,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63053eec/9e087e8c1bc442f8b3e263a9e6811484/FLAGb30c41b82 [2025-03-04 07:41:05,823 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:41:05,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2025-03-04 07:41:05,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63053eec/9e087e8c1bc442f8b3e263a9e6811484/FLAGb30c41b82 [2025-03-04 07:41:05,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63053eec/9e087e8c1bc442f8b3e263a9e6811484 [2025-03-04 07:41:05,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:41:05,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:41:05,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:05,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:41:05,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:41:05,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:05" (1/1) ... [2025-03-04 07:41:05,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1067fd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:05, skipping insertion in model container [2025-03-04 07:41:05,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:05" (1/1) ... [2025-03-04 07:41:05,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:06,081 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-04 07:41:06,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:06,099 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:41:06,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:06,162 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:41:06,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06 WrapperNode [2025-03-04 07:41:06,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:06,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:06,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:41:06,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:41:06,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,195 INFO L138 Inliner]: procedures = 168, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2025-03-04 07:41:06,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:06,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:41:06,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:41:06,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:41:06,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,213 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2025-03-04 07:41:06,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:41:06,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:41:06,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:41:06,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:41:06,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (1/1) ... [2025-03-04 07:41:06,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:06,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:06,248 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-04 07:41:06,251 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-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-03-04 07:41:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:41:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:41:06,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:41:06,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:41:06,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:41:06,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:41:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:41:06,353 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:41:06,354 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:41:06,509 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-04 07:41:06,509 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:41:06,515 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:41:06,515 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:41:06,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:06 BoogieIcfgContainer [2025-03-04 07:41:06,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:41:06,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:41:06,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:41:06,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:41:06,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:41:05" (1/3) ... [2025-03-04 07:41:06,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0e44a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:06, skipping insertion in model container [2025-03-04 07:41:06,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:06" (2/3) ... [2025-03-04 07:41:06,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0e44a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:06, skipping insertion in model container [2025-03-04 07:41:06,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:06" (3/3) ... [2025-03-04 07:41:06,525 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2025-03-04 07:41:06,536 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:41:06,537 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-04 07:41:06,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:41:06,573 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;@1b921ced, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:41:06,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 07:41:06,578 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-04 07:41:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:06,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:06,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:06,583 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-04 07:41:06,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:06,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1219042610, now seen corresponding path program 1 times [2025-03-04 07:41:06,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:06,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256178169] [2025-03-04 07:41:06,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:06,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:06,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:06,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:06,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:06,814 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-04 07:41:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256178169] [2025-03-04 07:41:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256178169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:06,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:06,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:06,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360346567] [2025-03-04 07:41:06,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:06,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:06,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:06,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:06,838 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-04 07:41:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:06,963 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2025-03-04 07:41:06,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:06,965 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-04 07:41:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:06,972 INFO L225 Difference]: With dead ends: 134 [2025-03-04 07:41:06,972 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 07:41:06,974 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-04 07:41:06,975 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-04 07:41:06,976 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-04 07:41:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 07:41:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2025-03-04 07:41:07,006 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-04 07:41:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2025-03-04 07:41:07,011 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 6 [2025-03-04 07:41:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:07,011 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2025-03-04 07:41:07,011 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-04 07:41:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2025-03-04 07:41:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:07,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:07,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:07,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:41:07,012 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-04 07:41:07,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1219042609, now seen corresponding path program 1 times [2025-03-04 07:41:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:07,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112188008] [2025-03-04 07:41:07,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:07,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:07,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:07,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:07,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:07,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:07,170 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-04 07:41:07,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:07,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112188008] [2025-03-04 07:41:07,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112188008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:07,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:07,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:07,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531041390] [2025-03-04 07:41:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:07,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:07,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:07,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:07,172 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-04 07:41:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:07,254 INFO L93 Difference]: Finished difference Result 195 states and 267 transitions. [2025-03-04 07:41:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:07,254 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-04 07:41:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:07,256 INFO L225 Difference]: With dead ends: 195 [2025-03-04 07:41:07,256 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 07:41:07,256 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-04 07:41:07,257 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-04 07:41:07,257 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-04 07:41:07,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 07:41:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 169. [2025-03-04 07:41:07,272 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-04 07:41:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 263 transitions. [2025-03-04 07:41:07,274 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 263 transitions. Word has length 6 [2025-03-04 07:41:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:07,274 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 263 transitions. [2025-03-04 07:41:07,274 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-04 07:41:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 263 transitions. [2025-03-04 07:41:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:41:07,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:07,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:07,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:41:07,274 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-04 07:41:07,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash 864384782, now seen corresponding path program 1 times [2025-03-04 07:41:07,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:07,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557070475] [2025-03-04 07:41:07,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:07,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:07,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:41:07,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:41:07,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:07,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:07,459 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-04 07:41:07,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:07,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557070475] [2025-03-04 07:41:07,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557070475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:07,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:07,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:07,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315067438] [2025-03-04 07:41:07,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:07,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:07,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:07,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:07,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:07,462 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-04 07:41:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:07,599 INFO L93 Difference]: Finished difference Result 220 states and 318 transitions. [2025-03-04 07:41:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:07,600 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-04 07:41:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:07,603 INFO L225 Difference]: With dead ends: 220 [2025-03-04 07:41:07,603 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 07:41:07,603 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-04 07:41:07,604 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-04 07:41:07,605 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-04 07:41:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 07:41:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 172. [2025-03-04 07:41:07,616 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-04 07:41:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 266 transitions. [2025-03-04 07:41:07,621 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 266 transitions. Word has length 7 [2025-03-04 07:41:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:07,622 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 266 transitions. [2025-03-04 07:41:07,622 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-04 07:41:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 266 transitions. [2025-03-04 07:41:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:41:07,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:07,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:07,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:41:07,623 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-04 07:41:07,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:07,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1026124492, now seen corresponding path program 1 times [2025-03-04 07:41:07,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:07,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310156899] [2025-03-04 07:41:07,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:07,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:07,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:41:07,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:41:07,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:07,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:07,829 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-04 07:41:07,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310156899] [2025-03-04 07:41:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310156899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:07,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400760796] [2025-03-04 07:41:07,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:07,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:07,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:07,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:07,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:07,832 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-04 07:41:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:07,932 INFO L93 Difference]: Finished difference Result 197 states and 268 transitions. [2025-03-04 07:41:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:07,933 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-04 07:41:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:07,934 INFO L225 Difference]: With dead ends: 197 [2025-03-04 07:41:07,934 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 07:41:07,934 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-04 07:41:07,935 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-04 07:41:07,936 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-04 07:41:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 07:41:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 172. [2025-03-04 07:41:07,946 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-04 07:41:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2025-03-04 07:41:07,947 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 8 [2025-03-04 07:41:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:07,948 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2025-03-04 07:41:07,948 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-04 07:41:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2025-03-04 07:41:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:41:07,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:07,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:07,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:41:07,948 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-04 07:41:07,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1745088204, now seen corresponding path program 1 times [2025-03-04 07:41:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:07,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496407943] [2025-03-04 07:41:07,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:07,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:07,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:41:07,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:41:07,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:07,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:08,008 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-04 07:41:08,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:08,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496407943] [2025-03-04 07:41:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496407943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:08,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:08,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890892839] [2025-03-04 07:41:08,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:08,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:08,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:08,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:08,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:08,011 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-04 07:41:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:08,095 INFO L93 Difference]: Finished difference Result 266 states and 366 transitions. [2025-03-04 07:41:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:08,095 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-04 07:41:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:08,097 INFO L225 Difference]: With dead ends: 266 [2025-03-04 07:41:08,097 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 07:41:08,097 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-04 07:41:08,098 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-04 07:41:08,099 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-04 07:41:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 07:41:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 205. [2025-03-04 07:41:08,114 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-04 07:41:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 310 transitions. [2025-03-04 07:41:08,117 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 310 transitions. Word has length 9 [2025-03-04 07:41:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:08,117 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 310 transitions. [2025-03-04 07:41:08,117 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-04 07:41:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 310 transitions. [2025-03-04 07:41:08,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:41:08,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:08,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:08,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:41:08,119 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-04 07:41:08,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1736840502, now seen corresponding path program 1 times [2025-03-04 07:41:08,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:08,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994328987] [2025-03-04 07:41:08,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:08,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:08,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:08,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:08,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:08,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:08,211 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-04 07:41:08,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:08,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994328987] [2025-03-04 07:41:08,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994328987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:08,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:08,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:08,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757053257] [2025-03-04 07:41:08,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:08,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:08,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:08,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:08,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:08,213 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-04 07:41:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:08,282 INFO L93 Difference]: Finished difference Result 253 states and 333 transitions. [2025-03-04 07:41:08,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:08,282 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-04 07:41:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:08,283 INFO L225 Difference]: With dead ends: 253 [2025-03-04 07:41:08,283 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 07:41:08,284 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-04 07:41:08,284 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 138 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-04 07:41:08,284 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-04 07:41:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 07:41:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 219. [2025-03-04 07:41:08,296 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-04 07:41:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 331 transitions. [2025-03-04 07:41:08,299 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 331 transitions. Word has length 10 [2025-03-04 07:41:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:08,299 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 331 transitions. [2025-03-04 07:41:08,299 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-04 07:41:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 331 transitions. [2025-03-04 07:41:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:41:08,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:08,301 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:08,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:41:08,301 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-04 07:41:08,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1600349994, now seen corresponding path program 1 times [2025-03-04 07:41:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:08,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930199487] [2025-03-04 07:41:08,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:08,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:41:08,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:41:08,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:08,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:08,412 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-04 07:41:08,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:08,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930199487] [2025-03-04 07:41:08,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930199487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504319474] [2025-03-04 07:41:08,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:08,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:08,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:08,415 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-04 07:41:08,417 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-04 07:41:08,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:41:08,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:41:08,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:08,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:08,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:08,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:08,619 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-04 07:41:08,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:08,725 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-04 07:41:08,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504319474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:08,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:08,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-03-04 07:41:08,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727268062] [2025-03-04 07:41:08,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:08,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:41:08,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:08,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:41:08,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:08,726 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-04 07:41:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:08,908 INFO L93 Difference]: Finished difference Result 245 states and 330 transitions. [2025-03-04 07:41:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:08,908 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-04 07:41:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:08,909 INFO L225 Difference]: With dead ends: 245 [2025-03-04 07:41:08,909 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 07:41:08,910 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-04 07:41:08,910 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-04 07:41:08,910 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-04 07:41:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 07:41:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 222. [2025-03-04 07:41:08,918 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-04 07:41:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 325 transitions. [2025-03-04 07:41:08,921 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 325 transitions. Word has length 14 [2025-03-04 07:41:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:08,921 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 325 transitions. [2025-03-04 07:41:08,921 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-04 07:41:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 325 transitions. [2025-03-04 07:41:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:41:08,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:08,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:08,928 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-04 07:41:09,122 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-04 07:41:09,122 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-04 07:41:09,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1928757735, now seen corresponding path program 1 times [2025-03-04 07:41:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:09,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549824889] [2025-03-04 07:41:09,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:09,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:09,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:41:09,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,243 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-04 07:41:09,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549824889] [2025-03-04 07:41:09,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549824889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682564076] [2025-03-04 07:41:09,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:09,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:09,247 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-04 07:41:09,248 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-04 07:41:09,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:09,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:41:09,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:09,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:09,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:09,442 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-04 07:41:09,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:09,497 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-04 07:41:09,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682564076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:09,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:09,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-04 07:41:09,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214737661] [2025-03-04 07:41:09,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:09,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:41:09,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:09,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:41:09,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:41:09,498 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-04 07:41:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:09,736 INFO L93 Difference]: Finished difference Result 271 states and 376 transitions. [2025-03-04 07:41:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:41:09,736 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-04 07:41:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:09,737 INFO L225 Difference]: With dead ends: 271 [2025-03-04 07:41:09,737 INFO L226 Difference]: Without dead ends: 271 [2025-03-04 07:41:09,738 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-04 07:41:09,738 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 151 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04 07:41:09,738 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-04 07:41:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-04 07:41:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 230. [2025-03-04 07:41:09,744 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-04 07:41:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2025-03-04 07:41:09,746 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 15 [2025-03-04 07:41:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:09,746 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2025-03-04 07:41:09,746 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-04 07:41:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2025-03-04 07:41:09,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:41:09,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:09,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:09,753 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-04 07:41:09,951 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-04 07:41:09,951 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-04 07:41:09,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash -338052333, now seen corresponding path program 1 times [2025-03-04 07:41:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:09,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638718572] [2025-03-04 07:41:09,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:09,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:41:09,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:41:09,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:09,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:10,103 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-04 07:41:10,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:10,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638718572] [2025-03-04 07:41:10,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638718572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:10,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120611880] [2025-03-04 07:41:10,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:10,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:10,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:10,105 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-04 07:41:10,107 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-04 07:41:10,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:41:10,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:41:10,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:10,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:10,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:41:10,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:10,341 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-04 07:41:10,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:10,439 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-04 07:41:10,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120611880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:10,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:10,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-04 07:41:10,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160259878] [2025-03-04 07:41:10,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:10,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:10,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:10,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:10,441 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-04 07:41:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:10,857 INFO L93 Difference]: Finished difference Result 393 states and 539 transitions. [2025-03-04 07:41:10,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:41:10,858 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-04 07:41:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:10,860 INFO L225 Difference]: With dead ends: 393 [2025-03-04 07:41:10,860 INFO L226 Difference]: Without dead ends: 393 [2025-03-04 07:41:10,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:41:10,860 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 256 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04 07:41:10,860 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-04 07:41:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-04 07:41:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 325. [2025-03-04 07:41:10,870 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-04 07:41:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2025-03-04 07:41:10,873 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 16 [2025-03-04 07:41:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:10,873 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2025-03-04 07:41:10,873 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-04 07:41:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2025-03-04 07:41:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:10,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:10,873 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-04 07:41:10,879 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-04 07:41:11,073 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-04 07:41:11,074 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-04 07:41:11,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1444392243, now seen corresponding path program 1 times [2025-03-04 07:41:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:11,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562522831] [2025-03-04 07:41:11,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:11,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:11,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:41:11,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:11,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:11,099 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-04 07:41:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:11,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562522831] [2025-03-04 07:41:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562522831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:11,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760360190] [2025-03-04 07:41:11,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:11,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:11,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:11,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:11,100 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-04 07:41:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:11,117 INFO L93 Difference]: Finished difference Result 471 states and 732 transitions. [2025-03-04 07:41:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:11,118 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-04 07:41:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:11,119 INFO L225 Difference]: With dead ends: 471 [2025-03-04 07:41:11,120 INFO L226 Difference]: Without dead ends: 471 [2025-03-04 07:41:11,120 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-04 07:41:11,120 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-04 07:41:11,120 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-04 07:41:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-04 07:41:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 457. [2025-03-04 07:41:11,135 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-04 07:41:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 730 transitions. [2025-03-04 07:41:11,139 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 730 transitions. Word has length 18 [2025-03-04 07:41:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:11,139 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 730 transitions. [2025-03-04 07:41:11,139 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-04 07:41:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 730 transitions. [2025-03-04 07:41:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:11,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:11,139 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-04 07:41:11,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:41:11,140 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-04 07:41:11,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1444392267, now seen corresponding path program 1 times [2025-03-04 07:41:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:11,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859423320] [2025-03-04 07:41:11,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:11,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:11,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:11,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:41:11,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:11,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:11,173 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-04 07:41:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859423320] [2025-03-04 07:41:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859423320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:11,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:11,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:11,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789621848] [2025-03-04 07:41:11,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:11,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:11,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:11,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:11,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:11,174 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-04 07:41:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:11,178 INFO L93 Difference]: Finished difference Result 419 states and 664 transitions. [2025-03-04 07:41:11,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:11,179 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-04 07:41:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:11,180 INFO L225 Difference]: With dead ends: 419 [2025-03-04 07:41:11,180 INFO L226 Difference]: Without dead ends: 419 [2025-03-04 07:41:11,181 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-04 07:41:11,181 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-04 07:41:11,181 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-04 07:41:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-04 07:41:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-03-04 07:41:11,199 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-04 07:41:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 664 transitions. [2025-03-04 07:41:11,202 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 664 transitions. Word has length 18 [2025-03-04 07:41:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:11,202 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 664 transitions. [2025-03-04 07:41:11,202 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-04 07:41:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 664 transitions. [2025-03-04 07:41:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:41:11,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:11,203 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-04 07:41:11,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:41:11,203 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-04 07:41:11,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1826486563, now seen corresponding path program 1 times [2025-03-04 07:41:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:11,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538779240] [2025-03-04 07:41:11,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:11,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:41:11,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:41:11,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:11,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:11,259 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-04 07:41:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538779240] [2025-03-04 07:41:11,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538779240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:11,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:11,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634463078] [2025-03-04 07:41:11,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:11,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:11,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:11,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:11,261 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-04 07:41:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:11,293 INFO L93 Difference]: Finished difference Result 487 states and 744 transitions. [2025-03-04 07:41:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:11,293 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-04 07:41:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:11,295 INFO L225 Difference]: With dead ends: 487 [2025-03-04 07:41:11,295 INFO L226 Difference]: Without dead ends: 487 [2025-03-04 07:41:11,295 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-04 07:41:11,296 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-04 07:41:11,296 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-04 07:41:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-04 07:41:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 471. [2025-03-04 07:41:11,309 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-04 07:41:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 737 transitions. [2025-03-04 07:41:11,313 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 737 transitions. Word has length 19 [2025-03-04 07:41:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:11,313 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 737 transitions. [2025-03-04 07:41:11,313 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-04 07:41:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 737 transitions. [2025-03-04 07:41:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:41:11,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:11,314 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-04 07:41:11,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:41:11,314 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-04 07:41:11,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1009783700, now seen corresponding path program 1 times [2025-03-04 07:41:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821905104] [2025-03-04 07:41:11,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:11,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:41:11,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:41:11,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:11,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:11,365 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-04 07:41:11,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821905104] [2025-03-04 07:41:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821905104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:11,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:11,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656162487] [2025-03-04 07:41:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:11,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:11,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:11,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:11,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:11,366 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-04 07:41:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:11,372 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2025-03-04 07:41:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:11,372 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-04 07:41:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:11,373 INFO L225 Difference]: With dead ends: 337 [2025-03-04 07:41:11,373 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 07:41:11,373 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-04 07:41:11,373 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-04 07:41:11,374 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-04 07:41:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 07:41:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-04 07:41:11,383 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-04 07:41:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 509 transitions. [2025-03-04 07:41:11,384 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 509 transitions. Word has length 25 [2025-03-04 07:41:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:11,384 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 509 transitions. [2025-03-04 07:41:11,385 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-04 07:41:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2025-03-04 07:41:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:41:11,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:11,386 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-04 07:41:11,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:41:11,386 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-04 07:41:11,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:11,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1984033445, now seen corresponding path program 1 times [2025-03-04 07:41:11,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:11,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032096225] [2025-03-04 07:41:11,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:11,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:11,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:41:11,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:11,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:11,557 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-04 07:41:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032096225] [2025-03-04 07:41:11,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032096225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:11,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638731715] [2025-03-04 07:41:11,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:11,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:11,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:11,560 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-04 07:41:11,561 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-04 07:41:11,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:11,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:41:11,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:11,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:11,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:41:11,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:11,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:11,840 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-04 07:41:11,890 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-04 07:41:11,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638731715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:11,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2025-03-04 07:41:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888836884] [2025-03-04 07:41:11,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:11,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:41:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:11,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:41:11,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:41:11,997 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-04 07:41:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,318 INFO L93 Difference]: Finished difference Result 370 states and 526 transitions. [2025-03-04 07:41:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:41:12,319 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-04 07:41:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,320 INFO L225 Difference]: With dead ends: 370 [2025-03-04 07:41:12,320 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 07:41:12,321 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-04 07:41:12,321 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 299 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-04 07:41:12,321 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-04 07:41:12,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 07:41:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 359. [2025-03-04 07:41:12,327 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-04 07:41:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 520 transitions. [2025-03-04 07:41:12,329 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 520 transitions. Word has length 27 [2025-03-04 07:41:12,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,329 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 520 transitions. [2025-03-04 07:41:12,329 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-04 07:41:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 520 transitions. [2025-03-04 07:41:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:41:12,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,330 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-04 07:41:12,336 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-04 07:41:12,530 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-04 07:41:12,530 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-04 07:41:12,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2043608466, now seen corresponding path program 1 times [2025-03-04 07:41:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015022402] [2025-03-04 07:41:12,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:12,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:41:12,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:41:12,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,638 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-04 07:41:12,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:12,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015022402] [2025-03-04 07:41:12,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015022402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:12,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857137654] [2025-03-04 07:41:12,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:12,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:12,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:12,640 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-04 07:41:12,642 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-04 07:41:12,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:41:12,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:41:12,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:12,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:12,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:12,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:12,770 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-04 07:41:12,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:12,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857137654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:12,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:41:12,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-03-04 07:41:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709292254] [2025-03-04 07:41:12,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:41:12,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:12,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:41:12,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:12,771 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-04 07:41:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:12,817 INFO L93 Difference]: Finished difference Result 383 states and 540 transitions. [2025-03-04 07:41:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:12,817 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-04 07:41:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:12,818 INFO L225 Difference]: With dead ends: 383 [2025-03-04 07:41:12,818 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 07:41:12,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:12,819 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-04 07:41:12,819 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-04 07:41:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 07:41:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 372. [2025-03-04 07:41:12,825 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-04 07:41:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 533 transitions. [2025-03-04 07:41:12,827 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 533 transitions. Word has length 28 [2025-03-04 07:41:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:12,827 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 533 transitions. [2025-03-04 07:41:12,827 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-04 07:41:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 533 transitions. [2025-03-04 07:41:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:41:12,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:12,828 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-04 07:41:12,834 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-04 07:41:13,032 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-04 07:41:13,032 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-04 07:41:13,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash -309338846, now seen corresponding path program 1 times [2025-03-04 07:41:13,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:13,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336308012] [2025-03-04 07:41:13,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:13,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:13,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:41:13,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:41:13,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:13,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:13,336 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-04 07:41:13,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:13,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336308012] [2025-03-04 07:41:13,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336308012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:13,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021647777] [2025-03-04 07:41:13,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:13,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:13,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:13,339 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-04 07:41:13,340 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-04 07:41:13,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:41:13,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:41:13,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:13,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:13,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 07:41:13,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:13,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:13,647 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-04 07:41:13,733 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-04 07:41:13,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:13,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021647777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:13,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:13,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2025-03-04 07:41:13,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459874921] [2025-03-04 07:41:13,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:13,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:41:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:13,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:41:13,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:41:13,844 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-04 07:41:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:14,156 INFO L93 Difference]: Finished difference Result 382 states and 534 transitions. [2025-03-04 07:41:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:41:14,156 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-04 07:41:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:14,158 INFO L225 Difference]: With dead ends: 382 [2025-03-04 07:41:14,158 INFO L226 Difference]: Without dead ends: 382 [2025-03-04 07:41:14,158 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-04 07:41:14,159 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 220 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-04 07:41:14,159 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-04 07:41:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-04 07:41:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 375. [2025-03-04 07:41:14,166 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-04 07:41:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 531 transitions. [2025-03-04 07:41:14,168 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 531 transitions. Word has length 29 [2025-03-04 07:41:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:14,168 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 531 transitions. [2025-03-04 07:41:14,169 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-04 07:41:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 531 transitions. [2025-03-04 07:41:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:41:14,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:14,170 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-04 07:41:14,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:14,374 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-04 07:41:14,374 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-04 07:41:14,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 179331362, now seen corresponding path program 1 times [2025-03-04 07:41:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828009183] [2025-03-04 07:41:14,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:14,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:41:14,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:41:14,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:14,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:14,429 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-04 07:41:14,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:14,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828009183] [2025-03-04 07:41:14,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828009183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:14,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:14,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:41:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032427419] [2025-03-04 07:41:14,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:14,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:14,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:14,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:14,430 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-04 07:41:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:14,486 INFO L93 Difference]: Finished difference Result 363 states and 492 transitions. [2025-03-04 07:41:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:14,487 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-04 07:41:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:14,488 INFO L225 Difference]: With dead ends: 363 [2025-03-04 07:41:14,488 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 07:41:14,488 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-04 07:41:14,488 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-04 07:41:14,488 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-04 07:41:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 07:41:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2025-03-04 07:41:14,493 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-04 07:41:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 490 transitions. [2025-03-04 07:41:14,495 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 490 transitions. Word has length 30 [2025-03-04 07:41:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:14,495 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 490 transitions. [2025-03-04 07:41:14,495 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-04 07:41:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 490 transitions. [2025-03-04 07:41:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:41:14,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:14,495 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-04 07:41:14,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:41:14,495 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-04 07:41:14,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash -999569610, now seen corresponding path program 1 times [2025-03-04 07:41:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:14,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806641215] [2025-03-04 07:41:14,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:14,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:41:14,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:41:14,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:14,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:14,622 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-04 07:41:14,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:14,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806641215] [2025-03-04 07:41:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806641215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:14,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895877094] [2025-03-04 07:41:14,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:14,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:14,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:14,626 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-04 07:41:14,627 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-04 07:41:14,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:41:14,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:41:14,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:14,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:14,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:41:14,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:14,754 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:14,755 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-04 07:41:14,794 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-04 07:41:14,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895877094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:14,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:14,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-03-04 07:41:14,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347311840] [2025-03-04 07:41:14,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:14,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:41:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:14,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:41:14,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:14,833 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-04 07:41:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:15,101 INFO L93 Difference]: Finished difference Result 486 states and 621 transitions. [2025-03-04 07:41:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:41:15,102 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-04 07:41:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:15,103 INFO L225 Difference]: With dead ends: 486 [2025-03-04 07:41:15,104 INFO L226 Difference]: Without dead ends: 486 [2025-03-04 07:41:15,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:41:15,104 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 376 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-04 07:41:15,104 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-04 07:41:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-04 07:41:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 431. [2025-03-04 07:41:15,111 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-04 07:41:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 576 transitions. [2025-03-04 07:41:15,112 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 576 transitions. Word has length 30 [2025-03-04 07:41:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:15,112 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 576 transitions. [2025-03-04 07:41:15,112 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-04 07:41:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 576 transitions. [2025-03-04 07:41:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:41:15,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:15,113 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-04 07:41:15,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:15,313 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-04 07:41:15,314 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-04 07:41:15,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash -921886816, now seen corresponding path program 1 times [2025-03-04 07:41:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:15,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111909915] [2025-03-04 07:41:15,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:15,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:41:15,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:41:15,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:15,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:15,437 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-04 07:41:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:15,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111909915] [2025-03-04 07:41:15,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111909915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:15,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307178783] [2025-03-04 07:41:15,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:15,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:15,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:15,440 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-04 07:41:15,441 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-04 07:41:15,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:41:15,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:41:15,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:15,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:15,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:41:15,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:15,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:15,575 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-04 07:41:15,628 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-04 07:41:15,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:15,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307178783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:15,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:15,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2025-03-04 07:41:15,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904209944] [2025-03-04 07:41:15,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:15,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:15,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:15,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:15,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:41:15,715 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-04 07:41:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:16,194 INFO L93 Difference]: Finished difference Result 588 states and 726 transitions. [2025-03-04 07:41:16,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:41:16,195 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-04 07:41:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:16,196 INFO L225 Difference]: With dead ends: 588 [2025-03-04 07:41:16,196 INFO L226 Difference]: Without dead ends: 588 [2025-03-04 07:41:16,197 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-04 07:41:16,197 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-04 07:41:16,197 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-04 07:41:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-04 07:41:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 532. [2025-03-04 07:41:16,204 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-04 07:41:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 693 transitions. [2025-03-04 07:41:16,206 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 693 transitions. Word has length 31 [2025-03-04 07:41:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:16,206 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 693 transitions. [2025-03-04 07:41:16,206 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-04 07:41:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 693 transitions. [2025-03-04 07:41:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:41:16,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:16,206 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-04 07:41:16,212 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-04 07:41:16,407 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-04 07:41:16,407 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-04 07:41:16,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash 943551148, now seen corresponding path program 1 times [2025-03-04 07:41:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:16,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755319638] [2025-03-04 07:41:16,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:16,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:41:16,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:41:16,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,552 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-04 07:41:16,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755319638] [2025-03-04 07:41:16,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755319638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:16,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282412789] [2025-03-04 07:41:16,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:16,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:16,555 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-04 07:41:16,556 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-04 07:41:16,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:41:16,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:41:16,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:41:16,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:16,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:16,774 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-04 07:41:16,887 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-04 07:41:16,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:17,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282412789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:17,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:17,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2025-03-04 07:41:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546854583] [2025-03-04 07:41:17,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:17,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:41:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:17,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:41:17,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:41:17,031 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-04 07:41:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:17,456 INFO L93 Difference]: Finished difference Result 549 states and 687 transitions. [2025-03-04 07:41:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:41:17,456 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-04 07:41:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:17,458 INFO L225 Difference]: With dead ends: 549 [2025-03-04 07:41:17,458 INFO L226 Difference]: Without dead ends: 549 [2025-03-04 07:41:17,458 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-04 07:41:17,458 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-04 07:41:17,459 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-04 07:41:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-04 07:41:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 531. [2025-03-04 07:41:17,473 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-04 07:41:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 671 transitions. [2025-03-04 07:41:17,474 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 671 transitions. Word has length 35 [2025-03-04 07:41:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:17,474 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 671 transitions. [2025-03-04 07:41:17,474 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-04 07:41:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2025-03-04 07:41:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:41:17,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:17,475 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-04 07:41:17,481 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-04 07:41:17,675 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-04 07:41:17,675 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-04 07:41:17,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:17,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1208314165, now seen corresponding path program 1 times [2025-03-04 07:41:17,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:17,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089014871] [2025-03-04 07:41:17,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:17,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:17,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:41:17,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:41:17,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:17,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:17,759 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-04 07:41:17,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:17,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089014871] [2025-03-04 07:41:17,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089014871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:17,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436910244] [2025-03-04 07:41:17,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:17,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:17,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:17,761 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-04 07:41:17,762 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-04 07:41:17,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:41:17,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:41:17,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:17,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:17,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:41:17,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:17,928 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:41:17,928 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-04 07:41:17,978 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-04 07:41:17,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:18,004 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-04 07:41:18,158 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-04 07:41:18,174 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-04 07:41:18,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436910244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:18,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:18,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2025-03-04 07:41:18,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554647639] [2025-03-04 07:41:18,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:18,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:18,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:18,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:18,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:18,175 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-04 07:41:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:18,432 INFO L93 Difference]: Finished difference Result 580 states and 706 transitions. [2025-03-04 07:41:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:41:18,435 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-04 07:41:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:18,436 INFO L225 Difference]: With dead ends: 580 [2025-03-04 07:41:18,436 INFO L226 Difference]: Without dead ends: 580 [2025-03-04 07:41:18,436 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-04 07:41:18,437 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:18,437 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.1s Time] [2025-03-04 07:41:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-04 07:41:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 539. [2025-03-04 07:41:18,446 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-04 07:41:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 680 transitions. [2025-03-04 07:41:18,447 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 680 transitions. Word has length 36 [2025-03-04 07:41:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:18,448 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 680 transitions. [2025-03-04 07:41:18,448 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-04 07:41:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 680 transitions. [2025-03-04 07:41:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:41:18,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:18,448 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-04 07:41:18,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:18,649 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-04 07:41:18,649 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-04 07:41:18,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1196966521, now seen corresponding path program 1 times [2025-03-04 07:41:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:18,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443607775] [2025-03-04 07:41:18,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:18,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:41:18,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:41:18,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:18,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:18,937 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-04 07:41:18,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:18,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443607775] [2025-03-04 07:41:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443607775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:18,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609145340] [2025-03-04 07:41:18,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:18,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:18,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:18,941 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-04 07:41:18,943 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-04 07:41:18,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:41:18,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:41:18,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:18,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:18,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:18,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:19,240 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-04 07:41:19,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:19,445 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-04 07:41:19,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609145340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:19,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2025-03-04 07:41:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479864675] [2025-03-04 07:41:19,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:19,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:41:19,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:19,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:41:19,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:41:19,446 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-04 07:41:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:20,552 INFO L93 Difference]: Finished difference Result 800 states and 971 transitions. [2025-03-04 07:41:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 07:41:20,552 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-04 07:41:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:20,554 INFO L225 Difference]: With dead ends: 800 [2025-03-04 07:41:20,554 INFO L226 Difference]: Without dead ends: 800 [2025-03-04 07:41:20,555 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-04 07:41:20,556 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-04 07:41:20,556 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-04 07:41:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-04 07:41:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 543. [2025-03-04 07:41:20,565 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-04 07:41:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 680 transitions. [2025-03-04 07:41:20,566 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 680 transitions. Word has length 37 [2025-03-04 07:41:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:20,566 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 680 transitions. [2025-03-04 07:41:20,566 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-04 07:41:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 680 transitions. [2025-03-04 07:41:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:41:20,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:20,566 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-04 07:41:20,572 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-04 07:41:20,766 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-04 07:41:20,767 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-04 07:41:20,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1376807982, now seen corresponding path program 1 times [2025-03-04 07:41:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:20,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746586544] [2025-03-04 07:41:20,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:20,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:41:20,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:41:20,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:20,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:20,822 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-04 07:41:20,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:20,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746586544] [2025-03-04 07:41:20,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746586544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:20,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018975849] [2025-03-04 07:41:20,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:20,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:20,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:20,825 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-04 07:41:20,826 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-04 07:41:20,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:41:20,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:41:20,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:20,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:20,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:41:20,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:20,907 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-04 07:41:20,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:20,932 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-04 07:41:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018975849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:20,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:20,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 07:41:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347785099] [2025-03-04 07:41:20,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:20,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:20,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:20,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:20,934 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-04 07:41:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:20,947 INFO L93 Difference]: Finished difference Result 541 states and 673 transitions. [2025-03-04 07:41:20,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:20,948 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-04 07:41:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:20,949 INFO L225 Difference]: With dead ends: 541 [2025-03-04 07:41:20,949 INFO L226 Difference]: Without dead ends: 541 [2025-03-04 07:41:20,949 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-04 07:41:20,949 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-04 07:41:20,950 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-04 07:41:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-04 07:41:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 535. [2025-03-04 07:41:20,956 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-04 07:41:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 666 transitions. [2025-03-04 07:41:20,957 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 666 transitions. Word has length 40 [2025-03-04 07:41:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:20,957 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 666 transitions. [2025-03-04 07:41:20,957 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-04 07:41:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 666 transitions. [2025-03-04 07:41:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:41:20,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:20,958 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-04 07:41:20,964 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-04 07:41:21,158 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-04 07:41:21,158 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-04 07:41:21,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash -268625517, now seen corresponding path program 1 times [2025-03-04 07:41:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:21,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227638625] [2025-03-04 07:41:21,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:21,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:21,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:41:21,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:41:21,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:21,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:21,210 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-04 07:41:21,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227638625] [2025-03-04 07:41:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227638625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70157819] [2025-03-04 07:41:21,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:21,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:21,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:21,212 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-04 07:41:21,214 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-04 07:41:21,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:41:21,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:41:21,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:21,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:21,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:21,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:21,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:21,339 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-04 07:41:21,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70157819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:21,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:21,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 07:41:21,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593635250] [2025-03-04 07:41:21,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:21,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:21,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:21,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:21,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:21,341 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-04 07:41:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:21,363 INFO L93 Difference]: Finished difference Result 533 states and 658 transitions. [2025-03-04 07:41:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:21,364 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-04 07:41:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:21,365 INFO L225 Difference]: With dead ends: 533 [2025-03-04 07:41:21,365 INFO L226 Difference]: Without dead ends: 533 [2025-03-04 07:41:21,365 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-04 07:41:21,365 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-04 07:41:21,366 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-04 07:41:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-04 07:41:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-03-04 07:41:21,374 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-04 07:41:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 658 transitions. [2025-03-04 07:41:21,375 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 658 transitions. Word has length 41 [2025-03-04 07:41:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:21,375 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 658 transitions. [2025-03-04 07:41:21,375 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-04 07:41:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 658 transitions. [2025-03-04 07:41:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:41:21,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:21,375 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-04 07:41:21,382 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-04 07:41:21,576 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-04 07:41:21,576 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-04 07:41:21,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash 262543564, now seen corresponding path program 1 times [2025-03-04 07:41:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:21,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768102873] [2025-03-04 07:41:21,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:21,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:41:21,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:41:21,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:21,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:21,642 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-04 07:41:21,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:21,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768102873] [2025-03-04 07:41:21,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768102873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:21,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964396783] [2025-03-04 07:41:21,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:21,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:21,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:21,644 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-04 07:41:21,646 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-04 07:41:21,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:41:21,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:41:21,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:21,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:21,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:21,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:21,710 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-04 07:41:21,738 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:41:21,739 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-04 07:41:21,747 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-04 07:41:21,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:21,787 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-04 07:41:21,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964396783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:21,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:21,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 07:41:21,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315080241] [2025-03-04 07:41:21,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:21,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:21,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:21,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:21,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:21,788 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-04 07:41:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:21,841 INFO L93 Difference]: Finished difference Result 551 states and 667 transitions. [2025-03-04 07:41:21,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:21,842 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-04 07:41:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:21,843 INFO L225 Difference]: With dead ends: 551 [2025-03-04 07:41:21,843 INFO L226 Difference]: Without dead ends: 551 [2025-03-04 07:41:21,843 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-04 07:41:21,843 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-04 07:41:21,843 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-04 07:41:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-04 07:41:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 533. [2025-03-04 07:41:21,850 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-04 07:41:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 653 transitions. [2025-03-04 07:41:21,851 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 653 transitions. Word has length 42 [2025-03-04 07:41:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:21,851 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 653 transitions. [2025-03-04 07:41:21,851 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-04 07:41:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 653 transitions. [2025-03-04 07:41:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:41:21,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:21,851 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-04 07:41:21,858 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-04 07:41:22,054 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-04 07:41:22,054 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-04 07:41:22,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1317526192, now seen corresponding path program 1 times [2025-03-04 07:41:22,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:22,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398356262] [2025-03-04 07:41:22,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:22,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:41:22,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:41:22,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,087 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-04 07:41:22,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:22,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398356262] [2025-03-04 07:41:22,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398356262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:22,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603778067] [2025-03-04 07:41:22,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:22,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:22,089 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-04 07:41:22,090 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-04 07:41:22,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:41:22,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:41:22,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:22,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:22,163 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-04 07:41:22,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:22,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603778067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:22,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:41:22,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-04 07:41:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468454550] [2025-03-04 07:41:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:22,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:22,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:22,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:22,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:22,165 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-04 07:41:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:22,175 INFO L93 Difference]: Finished difference Result 340 states and 396 transitions. [2025-03-04 07:41:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:22,175 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-04 07:41:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:22,176 INFO L225 Difference]: With dead ends: 340 [2025-03-04 07:41:22,176 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 07:41:22,176 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-04 07:41:22,176 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-04 07:41:22,176 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-04 07:41:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 07:41:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 331. [2025-03-04 07:41:22,179 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-04 07:41:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 388 transitions. [2025-03-04 07:41:22,180 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 388 transitions. Word has length 45 [2025-03-04 07:41:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:22,180 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 388 transitions. [2025-03-04 07:41:22,180 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-04 07:41:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 388 transitions. [2025-03-04 07:41:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:41:22,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:22,180 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-04 07:41:22,187 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-04 07:41:22,381 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-04 07:41:22,381 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-04 07:41:22,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:22,381 INFO L85 PathProgramCache]: Analyzing trace with hash -849234120, now seen corresponding path program 1 times [2025-03-04 07:41:22,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:22,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536471041] [2025-03-04 07:41:22,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:22,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:41:22,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:22,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,543 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-04 07:41:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536471041] [2025-03-04 07:41:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536471041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282379009] [2025-03-04 07:41:22,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:22,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:22,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:22,546 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-04 07:41:22,549 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-04 07:41:22,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:41:22,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:22,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:22,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:22,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:41:22,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:22,718 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:41:22,718 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-04 07:41:22,793 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:22,794 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-04 07:41:22,820 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:41:22,820 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-04 07:41:22,855 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-04 07:41:22,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:22,887 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:41:22,887 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-04 07:41:23,023 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:41:23,023 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-04 07:41:23,148 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-04 07:41:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282379009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:23,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2025-03-04 07:41:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404882376] [2025-03-04 07:41:23,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:41:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:23,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:41:23,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:41:23,150 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-04 07:41:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:23,300 INFO L93 Difference]: Finished difference Result 340 states and 396 transitions. [2025-03-04 07:41:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:23,300 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-04 07:41:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:23,301 INFO L225 Difference]: With dead ends: 340 [2025-03-04 07:41:23,301 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 07:41:23,301 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-04 07:41:23,302 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-04 07:41:23,302 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-04 07:41:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 07:41:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 330. [2025-03-04 07:41:23,305 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-04 07:41:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 386 transitions. [2025-03-04 07:41:23,305 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 386 transitions. Word has length 51 [2025-03-04 07:41:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:23,306 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 386 transitions. [2025-03-04 07:41:23,306 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-04 07:41:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 386 transitions. [2025-03-04 07:41:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:41:23,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:23,306 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-04 07:41:23,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:41:23,510 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-04 07:41:23,510 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-04 07:41:23,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:23,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1303078092, now seen corresponding path program 1 times [2025-03-04 07:41:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510651716] [2025-03-04 07:41:23,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:23,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:23,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:41:23,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:23,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:23,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:23,567 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-04 07:41:23,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:23,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510651716] [2025-03-04 07:41:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510651716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:23,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477174729] [2025-03-04 07:41:23,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:23,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:23,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:23,569 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-04 07:41:23,571 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-04 07:41:23,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:41:23,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:41:23,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:23,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:23,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:41:23,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:23,705 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:23,706 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-04 07:41:23,720 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-04 07:41:23,734 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:41:23,734 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-04 07:41:23,768 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-04 07:41:23,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:23,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477174729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:23,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:23,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-03-04 07:41:23,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318117482] [2025-03-04 07:41:23,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:23,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:41:23,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:23,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:41:23,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2025-03-04 07:41:23,891 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-04 07:41:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:24,347 INFO L93 Difference]: Finished difference Result 307 states and 344 transitions. [2025-03-04 07:41:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 07:41:24,348 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-04 07:41:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:24,348 INFO L225 Difference]: With dead ends: 307 [2025-03-04 07:41:24,348 INFO L226 Difference]: Without dead ends: 307 [2025-03-04 07:41:24,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=1034, Unknown=1, NotChecked=70, Total=1406 [2025-03-04 07:41:24,349 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-04 07:41:24,349 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-04 07:41:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-04 07:41:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 288. [2025-03-04 07:41:24,352 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-04 07:41:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 329 transitions. [2025-03-04 07:41:24,353 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 329 transitions. Word has length 51 [2025-03-04 07:41:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:24,353 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 329 transitions. [2025-03-04 07:41:24,353 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-04 07:41:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 329 transitions. [2025-03-04 07:41:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:41:24,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:24,353 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-04 07:41:24,360 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-04 07:41:24,553 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-04 07:41:24,554 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-04 07:41:24,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash -556453916, now seen corresponding path program 1 times [2025-03-04 07:41:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:24,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55734133] [2025-03-04 07:41:24,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:24,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:24,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:41:24,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:41:24,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:24,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55734133] [2025-03-04 07:41:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55734133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523495256] [2025-03-04 07:41:24,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:24,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:24,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:24,991 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-04 07:41:24,993 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-04 07:41:25,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:41:25,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:41:25,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 07:41:25,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:25,197 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:41:25,197 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-04 07:41:25,355 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:25,355 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-04 07:41:25,444 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:41:25,444 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 07:41:25,590 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-04 07:41:25,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:25,671 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-04 07:41:25,671 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-04 07:41:25,953 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-04 07:41:25,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 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-04 07:41:26,225 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-04 07:41:26,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523495256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:26,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:26,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 46 [2025-03-04 07:41:26,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217996944] [2025-03-04 07:41:26,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:26,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 07:41:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:26,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 07:41:26,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1922, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 07:41:26,227 INFO L87 Difference]: Start difference. First operand 288 states and 329 transitions. Second operand has 47 states, 43 states have (on average 3.255813953488372) internal successors, (140), 39 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:41:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:26,956 INFO L93 Difference]: Finished difference Result 303 states and 340 transitions. [2025-03-04 07:41:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:41:26,956 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 3.255813953488372) internal successors, (140), 39 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2025-03-04 07:41:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:26,957 INFO L225 Difference]: With dead ends: 303 [2025-03-04 07:41:26,957 INFO L226 Difference]: Without dead ends: 303 [2025-03-04 07:41:26,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=661, Invalid=3121, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 07:41:26,958 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 344 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:26,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 437 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:41:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-04 07:41:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 288. [2025-03-04 07:41:26,965 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-04 07:41:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 327 transitions. [2025-03-04 07:41:26,967 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 327 transitions. Word has length 52 [2025-03-04 07:41:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:26,968 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 327 transitions. [2025-03-04 07:41:26,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 3.255813953488372) internal successors, (140), 39 states have internal predecessors, (140), 8 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:41:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 327 transitions. [2025-03-04 07:41:26,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:41:26,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:26,968 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-04 07:41:26,976 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-04 07:41:27,169 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-04 07:41:27,169 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-04 07:41:27,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1871789864, now seen corresponding path program 1 times [2025-03-04 07:41:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:27,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390623542] [2025-03-04 07:41:27,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:27,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:27,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:41:27,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:41:27,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:27,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:27,312 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-04 07:41:27,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:27,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390623542] [2025-03-04 07:41:27,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390623542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:27,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914927596] [2025-03-04 07:41:27,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:27,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:27,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:27,315 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-04 07:41:27,316 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-04 07:41:27,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:41:27,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:41:27,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:27,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:27,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:41:27,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:27,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:27,457 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-04 07:41:27,534 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-04 07:41:27,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:27,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914927596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:27,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:27,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2025-03-04 07:41:27,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006201306] [2025-03-04 07:41:27,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:27,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:41:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:27,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:41:27,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:41:27,669 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-04 07:41:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:27,992 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2025-03-04 07:41:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:41:27,993 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-04 07:41:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:27,994 INFO L225 Difference]: With dead ends: 301 [2025-03-04 07:41:27,994 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 07:41:27,994 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-04 07:41:27,995 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 366 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:27,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 234 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:27,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 07:41:27,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 287. [2025-03-04 07:41:27,998 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-04 07:41:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 319 transitions. [2025-03-04 07:41:27,999 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 319 transitions. Word has length 52 [2025-03-04 07:41:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:27,999 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 319 transitions. [2025-03-04 07:41:27,999 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-04 07:41:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 319 transitions. [2025-03-04 07:41:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 07:41:28,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:28,002 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-04 07:41:28,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:28,202 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-04 07:41:28,203 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-04 07:41:28,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2118699554, now seen corresponding path program 1 times [2025-03-04 07:41:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:28,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829277584] [2025-03-04 07:41:28,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:28,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:28,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:41:28,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:41:28,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:28,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:28,434 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-04 07:41:28,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829277584] [2025-03-04 07:41:28,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829277584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092795845] [2025-03-04 07:41:28,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:28,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:28,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:28,437 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-04 07:41:28,438 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-04 07:41:28,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:41:28,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:41:28,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:28,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:28,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:41:28,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:28,575 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:28,575 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-04 07:41:28,639 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-04 07:41:28,660 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2025-03-04 07:41:28,660 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-04 07:41:28,692 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-04 07:41:28,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092795845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:28,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:28,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-03-04 07:41:28,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519849594] [2025-03-04 07:41:28,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:28,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:41:28,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:28,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:41:28,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=375, Unknown=1, NotChecked=40, Total=506 [2025-03-04 07:41:28,869 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-04 07:41:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:29,222 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2025-03-04 07:41:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:41:29,223 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-04 07:41:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:29,224 INFO L225 Difference]: With dead ends: 297 [2025-03-04 07:41:29,224 INFO L226 Difference]: Without dead ends: 297 [2025-03-04 07:41:29,224 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-04 07:41:29,224 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 402 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:29,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 237 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 273 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2025-03-04 07:41:29,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-04 07:41:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 286. [2025-03-04 07:41:29,228 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-04 07:41:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 317 transitions. [2025-03-04 07:41:29,228 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 317 transitions. Word has length 54 [2025-03-04 07:41:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:29,229 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 317 transitions. [2025-03-04 07:41:29,229 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-04 07:41:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 317 transitions. [2025-03-04 07:41:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 07:41:29,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:29,232 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-04 07:41:29,239 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-04 07:41:29,434 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-04 07:41:29,434 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-04 07:41:29,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:29,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2143091523, now seen corresponding path program 1 times [2025-03-04 07:41:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:29,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990894541] [2025-03-04 07:41:29,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:29,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:41:29,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:41:29,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:29,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:29,800 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-04 07:41:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:29,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990894541] [2025-03-04 07:41:29,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990894541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:29,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738565554] [2025-03-04 07:41:29,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:29,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:29,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:29,803 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-04 07:41:29,805 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-04 07:41:29,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:41:29,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:41:29,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:29,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:29,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 07:41:29,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:30,072 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-04 07:41:30,072 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-04 07:41:30,443 INFO L349 Elim1Store]: treesize reduction 86, result has 22.5 percent of original size [2025-03-04 07:41:30,443 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-04 07:41:30,502 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-03-04 07:41:30,502 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-04 07:41:30,674 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-04 07:41:30,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:30,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738565554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:30,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:30,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 27 [2025-03-04 07:41:30,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685787745] [2025-03-04 07:41:30,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:30,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 07:41:30,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:30,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 07:41:30,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:41:30,772 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-04 07:41:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:31,726 INFO L93 Difference]: Finished difference Result 315 states and 343 transitions. [2025-03-04 07:41:31,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 07:41:31,727 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-04 07:41:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:31,728 INFO L225 Difference]: With dead ends: 315 [2025-03-04 07:41:31,728 INFO L226 Difference]: Without dead ends: 315 [2025-03-04 07:41:31,728 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-04 07:41:31,729 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 452 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:31,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 308 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:41:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-04 07:41:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 292. [2025-03-04 07:41:31,732 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-04 07:41:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 322 transitions. [2025-03-04 07:41:31,733 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 322 transitions. Word has length 60 [2025-03-04 07:41:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:31,733 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 322 transitions. [2025-03-04 07:41:31,733 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-04 07:41:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 322 transitions. [2025-03-04 07:41:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 07:41:31,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:31,734 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-04 07:41:31,743 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-04 07:41:31,934 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-04 07:41:31,934 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-04 07:41:31,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:31,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2011327747, now seen corresponding path program 1 times [2025-03-04 07:41:31,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:31,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833831279] [2025-03-04 07:41:31,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:31,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 07:41:31,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 07:41:31,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:31,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:32,359 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-04 07:41:32,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:32,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833831279] [2025-03-04 07:41:32,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833831279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:32,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981615568] [2025-03-04 07:41:32,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:32,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:32,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:32,362 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-04 07:41:32,364 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-04 07:41:32,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 07:41:32,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 07:41:32,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:32,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:32,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:41:32,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:32,678 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:41:32,679 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-04 07:41:32,681 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-04 07:41:32,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:32,880 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-04 07:41:33,036 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-04 07:41:33,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981615568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:33,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:33,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 24 [2025-03-04 07:41:33,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92151468] [2025-03-04 07:41:33,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:33,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:41:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:33,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:41:33,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:41:33,184 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-04 07:41:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:34,066 INFO L93 Difference]: Finished difference Result 346 states and 374 transitions. [2025-03-04 07:41:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 07:41:34,066 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-04 07:41:34,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:34,067 INFO L225 Difference]: With dead ends: 346 [2025-03-04 07:41:34,067 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 07:41:34,068 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-04 07:41:34,068 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 574 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:34,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 257 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:41:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 07:41:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 244. [2025-03-04 07:41:34,071 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-04 07:41:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 267 transitions. [2025-03-04 07:41:34,071 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 267 transitions. Word has length 61 [2025-03-04 07:41:34,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:34,071 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 267 transitions. [2025-03-04 07:41:34,071 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-04 07:41:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 267 transitions. [2025-03-04 07:41:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 07:41:34,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:34,072 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-04 07:41:34,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:34,272 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-04 07:41:34,272 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-04 07:41:34,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash -858121800, now seen corresponding path program 1 times [2025-03-04 07:41:34,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:34,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132367462] [2025-03-04 07:41:34,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:34,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:34,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:41:34,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:41:34,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:34,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:34,416 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-04 07:41:34,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:34,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132367462] [2025-03-04 07:41:34,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132367462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:34,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219776381] [2025-03-04 07:41:34,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:34,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:34,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:34,419 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-04 07:41:34,420 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-04 07:41:34,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:41:34,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:41:34,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:34,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:34,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:41:34,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:34,497 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-04 07:41:34,594 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:34,595 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-04 07:41:34,615 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:41:34,615 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-04 07:41:34,624 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-04 07:41:34,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:34,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219776381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:34,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:34,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-04 07:41:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758927302] [2025-03-04 07:41:34,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:41:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:34,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:41:34,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:41:34,680 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-04 07:41:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:34,788 INFO L93 Difference]: Finished difference Result 302 states and 331 transitions. [2025-03-04 07:41:34,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:41:34,788 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-04 07:41:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:34,789 INFO L225 Difference]: With dead ends: 302 [2025-03-04 07:41:34,789 INFO L226 Difference]: Without dead ends: 302 [2025-03-04 07:41:34,789 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-04 07:41:34,790 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:34,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 199 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-04 07:41:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 289. [2025-03-04 07:41:34,792 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-04 07:41:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 318 transitions. [2025-03-04 07:41:34,793 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 318 transitions. Word has length 66 [2025-03-04 07:41:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:34,793 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 318 transitions. [2025-03-04 07:41:34,793 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-04 07:41:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 318 transitions. [2025-03-04 07:41:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 07:41:34,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:34,794 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-04 07:41:34,800 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-04 07:41:34,994 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-04 07:41:34,995 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-04 07:41:34,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:34,995 INFO L85 PathProgramCache]: Analyzing trace with hash -11132690, now seen corresponding path program 1 times [2025-03-04 07:41:34,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:34,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595510771] [2025-03-04 07:41:34,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:34,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:35,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 07:41:35,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 07:41:35,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:35,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:41:35,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:41:35,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 07:41:35,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 07:41:35,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:35,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:41:35,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:41:35,049 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:41:35,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 23 remaining) [2025-03-04 07:41:35,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0ASSERT_VIOLATIONMEMORY_FREE (21 of 23 remaining) [2025-03-04 07:41:35,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1ASSERT_VIOLATIONMEMORY_FREE (20 of 23 remaining) [2025-03-04 07:41:35,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_FREE (19 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_FREE (18 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_FREE (17 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_FREE (16 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6ASSERT_VIOLATIONMEMORY_FREE (15 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7ASSERT_VIOLATIONMEMORY_FREE (14 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8ASSERT_VIOLATIONMEMORY_FREE (13 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9ASSERT_VIOLATIONMEMORY_FREE (12 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (11 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (10 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2025-03-04 07:41:35,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-03-04 07:41:35,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-03-04 07:41:35,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-03-04 07:41:35,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-03-04 07:41:35,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-03-04 07:41:35,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-03-04 07:41:35,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2025-03-04 07:41:35,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 07:41:35,056 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-04 07:41:35,129 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:41:35,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:41:35 BoogieIcfgContainer [2025-03-04 07:41:35,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:41:35,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:41:35,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:41:35,135 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:41:35,136 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:06" (3/4) ... [2025-03-04 07:41:35,138 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:41:35,139 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:41:35,139 INFO L158 Benchmark]: Toolchain (without parser) took 29282.84ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 105.0MB in the beginning and 330.7MB in the end (delta: -225.7MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. [2025-03-04 07:41:35,139 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:35,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.22ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 84.9MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:35,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.66ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 83.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:41:35,141 INFO L158 Benchmark]: Boogie Preprocessor took 26.81ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:35,141 INFO L158 Benchmark]: IcfgBuilder took 292.39ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 64.0MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:35,141 INFO L158 Benchmark]: TraceAbstraction took 28616.98ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 63.2MB in the beginning and 330.8MB in the end (delta: -267.5MB). Peak memory consumption was 170.1MB. Max. memory is 16.1GB. [2025-03-04 07:41:35,141 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 369.1MB. Free memory was 330.8MB in the beginning and 330.7MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:35,142 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.22ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 84.9MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.66ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 83.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.81ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 292.39ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 64.0MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28616.98ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 63.2MB in the beginning and 330.8MB in the end (delta: -267.5MB). Peak memory consumption was 170.1MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 369.1MB. Free memory was 330.8MB in the beginning and 330.7MB in the end (delta: 75.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, 23 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7344 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7344 mSDsluCounter, 8123 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 252 IncrementalHoareTripleChecker+Unchecked, 6430 mSDsCounter, 904 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8010 IncrementalHoareTripleChecker+Invalid, 9166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 904 mSolverCounterUnsat, 1693 mSDtfsCounter, 8010 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1896 GetRequests, 1248 SyntacticMatches, 14 SemanticMatches, 634 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5033 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=543occurred in iteration=22, InterpolantAutomatonStates: 380, 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, 1092 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 2049 NumberOfCodeBlocks, 2049 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 2259 ConstructedInterpolants, 145 QuantifiedInterpolants, 26865 SizeOfPredicates, 92 NumberOfNonLiveVariables, 5821 ConjunctsInSsa, 446 ConjunctsInUnsatCore, 67 InterpolantComputations, 13 PerfectInterpolantSequences, 408/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-04 07:41:35,159 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-?-798a7b3-m [2025-03-04 07:41:36,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:41:37,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 07:41:37,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:41:37,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:41:37,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:41:37,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:41:37,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:41:37,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:41:37,038 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:41:37,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:41:37,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:41:37,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:41:37,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:41:37,038 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:41:37,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:41:37,038 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:41:37,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:41:37,039 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:41:37,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:37,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:41:37,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:41:37,040 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-04 07:41:37,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:41:37,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:41:37,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:41:37,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:41:37,261 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:41:37,262 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-04 07:41:38,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb59581a/fe9b0ddbb47b4c90b87062ac4dd280e9/FLAGc4e7da271 [2025-03-04 07:41:38,607 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:41:38,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_1.i [2025-03-04 07:41:38,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb59581a/fe9b0ddbb47b4c90b87062ac4dd280e9/FLAGc4e7da271 [2025-03-04 07:41:38,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb59581a/fe9b0ddbb47b4c90b87062ac4dd280e9 [2025-03-04 07:41:38,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:41:38,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:41:38,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:38,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:41:38,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:41:38,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:38,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674df159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:38, skipping insertion in model container [2025-03-04 07:41:38,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:38" (1/1) ... [2025-03-04 07:41:39,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:39,218 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-04 07:41:39,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:39,232 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:41:39,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:39,295 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:41:39,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39 WrapperNode [2025-03-04 07:41:39,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:39,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:39,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:41:39,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:41:39,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,335 INFO L138 Inliner]: procedures = 169, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2025-03-04 07:41:39,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:39,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:41:39,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:41:39,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:41:39,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,363 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 9, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-03-04 07:41:39,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:41:39,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:41:39,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:41:39,385 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:41:39,386 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (1/1) ... [2025-03-04 07:41:39,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:39,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:39,416 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-04 07:41:39,418 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-04 07:41:39,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 07:41:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 07:41:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 07:41:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-03-04 07:41:39,438 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-03-04 07:41:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:41:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:41:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:41:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:41:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:41:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:41:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:41:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:41:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:41:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:41:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:41:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 07:41:39,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:41:39,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:41:39,569 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:41:39,571 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:41:39,836 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-04 07:41:39,836 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:41:39,844 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:41:39,844 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:41:39,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:39 BoogieIcfgContainer [2025-03-04 07:41:39,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:41:39,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:41:39,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:41:39,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:41:39,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:41:38" (1/3) ... [2025-03-04 07:41:39,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c03bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:39, skipping insertion in model container [2025-03-04 07:41:39,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:39" (2/3) ... [2025-03-04 07:41:39,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c03bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:39, skipping insertion in model container [2025-03-04 07:41:39,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:39" (3/3) ... [2025-03-04 07:41:39,854 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_1.i [2025-03-04 07:41:39,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:41:39,865 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-04 07:41:39,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:41:39,898 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;@2453358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:41:39,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 07:41:39,902 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-04 07:41:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:39,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:39,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:39,907 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-04 07:41:39,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:39,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1219042610, now seen corresponding path program 1 times [2025-03-04 07:41:39,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:39,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126285164] [2025-03-04 07:41:39,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:39,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:39,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:39,946 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-04 07:41:39,948 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-04 07:41:40,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:40,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:40,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:40,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:40,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:40,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:40,156 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-04 07:41:40,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:40,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:40,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126285164] [2025-03-04 07:41:40,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126285164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:40,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:40,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:40,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395760189] [2025-03-04 07:41:40,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:40,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:40,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:40,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:40,182 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-04 07:41:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:40,322 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2025-03-04 07:41:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:40,325 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-04 07:41:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:40,329 INFO L225 Difference]: With dead ends: 121 [2025-03-04 07:41:40,329 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 07:41:40,330 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-04 07:41:40,332 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-04 07:41:40,333 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-04 07:41:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 07:41:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2025-03-04 07:41:40,364 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-04 07:41:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2025-03-04 07:41:40,368 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 6 [2025-03-04 07:41:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:40,369 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2025-03-04 07:41:40,369 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-04 07:41:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2025-03-04 07:41:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:40,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:40,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:40,375 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-04 07:41:40,570 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-04 07:41:40,570 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-04 07:41:40,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:40,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1219042609, now seen corresponding path program 1 times [2025-03-04 07:41:40,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:40,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140066947] [2025-03-04 07:41:40,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:40,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:40,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:40,574 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-04 07:41:40,575 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-04 07:41:40,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:40,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:40,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:40,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:40,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:41:40,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:40,750 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-04 07:41:40,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:40,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:40,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140066947] [2025-03-04 07:41:40,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140066947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:40,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:40,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:40,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898407723] [2025-03-04 07:41:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:40,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:40,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:40,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:40,752 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-04 07:41:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:40,908 INFO L93 Difference]: Finished difference Result 187 states and 247 transitions. [2025-03-04 07:41:40,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:40,909 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-04 07:41:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:40,910 INFO L225 Difference]: With dead ends: 187 [2025-03-04 07:41:40,910 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 07:41:40,911 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-04 07:41:40,911 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-04 07:41:40,911 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-04 07:41:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 07:41:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 156. [2025-03-04 07:41:40,925 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-04 07:41:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 243 transitions. [2025-03-04 07:41:40,928 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 243 transitions. Word has length 6 [2025-03-04 07:41:40,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:40,928 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 243 transitions. [2025-03-04 07:41:40,928 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-04 07:41:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 243 transitions. [2025-03-04 07:41:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:41:40,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:40,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:40,935 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-04 07:41:41,130 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-04 07:41:41,130 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-04 07:41:41,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash 864384782, now seen corresponding path program 1 times [2025-03-04 07:41:41,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:41,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385053441] [2025-03-04 07:41:41,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:41,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:41,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:41,134 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-04 07:41:41,136 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-04 07:41:41,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:41:41,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:41:41,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:41,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:41,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:41,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:41,306 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-04 07:41:41,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:41,306 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:41,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385053441] [2025-03-04 07:41:41,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385053441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:41,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:41,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:41,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957326128] [2025-03-04 07:41:41,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:41,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:41,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:41,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:41,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:41,310 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-04 07:41:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:41,476 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2025-03-04 07:41:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:41,477 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-04 07:41:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:41,478 INFO L225 Difference]: With dead ends: 207 [2025-03-04 07:41:41,478 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 07:41:41,478 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-04 07:41:41,479 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-04 07:41:41,479 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-04 07:41:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 07:41:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 159. [2025-03-04 07:41:41,491 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-04 07:41:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 246 transitions. [2025-03-04 07:41:41,495 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 246 transitions. Word has length 7 [2025-03-04 07:41:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:41,495 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 246 transitions. [2025-03-04 07:41:41,495 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-04 07:41:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 246 transitions. [2025-03-04 07:41:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:41:41,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:41,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:41,502 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-04 07:41:41,696 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-04 07:41:41,696 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-04 07:41:41,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1026124492, now seen corresponding path program 1 times [2025-03-04 07:41:41,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:41,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382449551] [2025-03-04 07:41:41,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:41,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:41,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:41,699 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-04 07:41:41,700 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-04 07:41:41,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:41:41,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:41:41,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:41,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:41,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:41:41,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:41,858 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-04 07:41:41,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:41,858 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:41,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382449551] [2025-03-04 07:41:41,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382449551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:41,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:41,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:41,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537432083] [2025-03-04 07:41:41,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:41,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:41,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:41,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:41,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:41,859 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-04 07:41:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:41,996 INFO L93 Difference]: Finished difference Result 189 states and 248 transitions. [2025-03-04 07:41:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:41,996 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-04 07:41:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:41,997 INFO L225 Difference]: With dead ends: 189 [2025-03-04 07:41:41,997 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 07:41:41,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:41,998 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-04 07:41:41,998 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-04 07:41:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 07:41:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 159. [2025-03-04 07:41:42,009 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-04 07:41:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 244 transitions. [2025-03-04 07:41:42,010 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 244 transitions. Word has length 8 [2025-03-04 07:41:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:42,011 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 244 transitions. [2025-03-04 07:41:42,011 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-04 07:41:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2025-03-04 07:41:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:41:42,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:42,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:42,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:41:42,216 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-04 07:41:42,216 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-04 07:41:42,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1745088204, now seen corresponding path program 1 times [2025-03-04 07:41:42,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:42,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753420728] [2025-03-04 07:41:42,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:42,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:42,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:42,218 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-04 07:41:42,219 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-04 07:41:42,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:41:42,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:41:42,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:42,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:42,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:41:42,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:42,309 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-04 07:41:42,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:42,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:42,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753420728] [2025-03-04 07:41:42,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753420728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:42,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:42,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332874450] [2025-03-04 07:41:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:42,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:42,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:42,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:42,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:42,310 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-04 07:41:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:42,420 INFO L93 Difference]: Finished difference Result 253 states and 346 transitions. [2025-03-04 07:41:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:42,421 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-04 07:41:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:42,422 INFO L225 Difference]: With dead ends: 253 [2025-03-04 07:41:42,422 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 07:41:42,422 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-04 07:41:42,422 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-04 07:41:42,423 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-04 07:41:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 07:41:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 192. [2025-03-04 07:41:42,432 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-04 07:41:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 290 transitions. [2025-03-04 07:41:42,433 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 290 transitions. Word has length 9 [2025-03-04 07:41:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:42,434 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 290 transitions. [2025-03-04 07:41:42,434 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-04 07:41:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 290 transitions. [2025-03-04 07:41:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:41:42,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:42,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:42,442 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-04 07:41:42,639 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-04 07:41:42,639 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-04 07:41:42,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1736840502, now seen corresponding path program 1 times [2025-03-04 07:41:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:42,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060026270] [2025-03-04 07:41:42,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:42,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:42,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:42,643 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-04 07:41:42,644 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-04 07:41:42,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:42,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:42,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:42,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:42,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:42,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:42,753 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-04 07:41:42,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:42,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:42,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060026270] [2025-03-04 07:41:42,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060026270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:42,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:42,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748687419] [2025-03-04 07:41:42,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:42,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:42,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:42,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:42,754 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-04 07:41:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:42,873 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2025-03-04 07:41:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:42,874 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-04 07:41:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:42,875 INFO L225 Difference]: With dead ends: 242 [2025-03-04 07:41:42,875 INFO L226 Difference]: Without dead ends: 242 [2025-03-04 07:41:42,875 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-04 07:41:42,876 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-04 07:41:42,877 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-04 07:41:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-04 07:41:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 206. [2025-03-04 07:41:42,887 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-04 07:41:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions. [2025-03-04 07:41:42,888 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 10 [2025-03-04 07:41:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:42,888 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 311 transitions. [2025-03-04 07:41:42,889 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-04 07:41:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions. [2025-03-04 07:41:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:41:42,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:42,889 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:42,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:43,093 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-04 07:41:43,093 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-04 07:41:43,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1600349994, now seen corresponding path program 1 times [2025-03-04 07:41:43,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041958724] [2025-03-04 07:41:43,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:43,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:43,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:43,095 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-04 07:41:43,096 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-04 07:41:43,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:41:43,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:41:43,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:43,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:43,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:43,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:43,287 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-04 07:41:43,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:43,462 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-04 07:41:43,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:43,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041958724] [2025-03-04 07:41:43,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041958724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:43,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:43,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-03-04 07:41:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174697096] [2025-03-04 07:41:43,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:43,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:41:43,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:43,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:41:43,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:43,464 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-04 07:41:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:43,746 INFO L93 Difference]: Finished difference Result 277 states and 368 transitions. [2025-03-04 07:41:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:43,746 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-04 07:41:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:43,747 INFO L225 Difference]: With dead ends: 277 [2025-03-04 07:41:43,748 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 07:41:43,748 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-04 07:41:43,748 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-04 07:41:43,748 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-04 07:41:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 07:41:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 236. [2025-03-04 07:41:43,756 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-04 07:41:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 359 transitions. [2025-03-04 07:41:43,758 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 359 transitions. Word has length 14 [2025-03-04 07:41:43,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:43,758 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 359 transitions. [2025-03-04 07:41:43,758 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-04 07:41:43,758 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 359 transitions. [2025-03-04 07:41:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:41:43,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:43,759 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:43,765 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-04 07:41:43,959 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-04 07:41:43,959 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-04 07:41:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1928757735, now seen corresponding path program 1 times [2025-03-04 07:41:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:43,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530692183] [2025-03-04 07:41:43,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:43,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:43,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:43,962 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-04 07:41:43,963 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-04 07:41:43,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:44,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:41:44,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:44,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:44,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:44,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:44,269 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-04 07:41:44,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:44,517 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-04 07:41:44,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:44,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530692183] [2025-03-04 07:41:44,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530692183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:44,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:44,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-04 07:41:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581031163] [2025-03-04 07:41:44,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:44,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:41:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:44,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:41:44,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:44,519 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-04 07:41:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:45,661 INFO L93 Difference]: Finished difference Result 372 states and 510 transitions. [2025-03-04 07:41:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:41:45,661 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-04 07:41:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:45,663 INFO L225 Difference]: With dead ends: 372 [2025-03-04 07:41:45,663 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 07:41:45,664 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-04 07:41:45,665 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.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:45,665 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.6s Time] [2025-03-04 07:41:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 07:41:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 274. [2025-03-04 07:41:45,673 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-04 07:41:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 421 transitions. [2025-03-04 07:41:45,674 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 421 transitions. Word has length 15 [2025-03-04 07:41:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:45,674 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 421 transitions. [2025-03-04 07:41:45,675 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-04 07:41:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 421 transitions. [2025-03-04 07:41:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:41:45,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:45,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:45,682 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-04 07:41:45,876 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-04 07:41:45,876 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-04 07:41:45,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash -338052333, now seen corresponding path program 1 times [2025-03-04 07:41:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332020390] [2025-03-04 07:41:45,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:45,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:45,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:45,878 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-04 07:41:45,879 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-04 07:41:45,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:41:45,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:41:45,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:45,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:45,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:41:45,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:46,187 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-04 07:41:46,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:46,513 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-04 07:41:46,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:46,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332020390] [2025-03-04 07:41:46,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332020390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:46,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:46,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-04 07:41:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074306642] [2025-03-04 07:41:46,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:46,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:41:46,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:46,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:41:46,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:46,514 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-04 07:41:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:47,569 INFO L93 Difference]: Finished difference Result 504 states and 693 transitions. [2025-03-04 07:41:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:41:47,570 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-04 07:41:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:47,572 INFO L225 Difference]: With dead ends: 504 [2025-03-04 07:41:47,572 INFO L226 Difference]: Without dead ends: 504 [2025-03-04 07:41:47,572 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-04 07:41:47,572 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-04 07:41:47,572 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-04 07:41:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-04 07:41:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 377. [2025-03-04 07:41:47,585 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-04 07:41:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 606 transitions. [2025-03-04 07:41:47,589 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 606 transitions. Word has length 16 [2025-03-04 07:41:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:47,589 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 606 transitions. [2025-03-04 07:41:47,589 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-04 07:41:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 606 transitions. [2025-03-04 07:41:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:47,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:47,589 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-04 07:41:47,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:47,789 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-04 07:41:47,790 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-04 07:41:47,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:47,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1444392243, now seen corresponding path program 1 times [2025-03-04 07:41:47,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:47,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211572202] [2025-03-04 07:41:47,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:47,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:47,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:47,792 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-04 07:41:47,794 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-04 07:41:47,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:47,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:41:47,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:47,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:47,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:47,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:47,861 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-04 07:41:47,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:47,861 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:47,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211572202] [2025-03-04 07:41:47,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211572202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:47,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:47,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:47,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523817264] [2025-03-04 07:41:47,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:47,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:47,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:47,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:47,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:47,862 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-04 07:41:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:47,877 INFO L93 Difference]: Finished difference Result 517 states and 829 transitions. [2025-03-04 07:41:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:47,880 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-04 07:41:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:47,882 INFO L225 Difference]: With dead ends: 517 [2025-03-04 07:41:47,882 INFO L226 Difference]: Without dead ends: 517 [2025-03-04 07:41:47,882 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-04 07:41:47,882 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-04 07:41:47,882 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-04 07:41:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-04 07:41:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 501. [2025-03-04 07:41:47,902 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-04 07:41:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 827 transitions. [2025-03-04 07:41:47,913 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 827 transitions. Word has length 18 [2025-03-04 07:41:47,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:47,913 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 827 transitions. [2025-03-04 07:41:47,914 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-04 07:41:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 827 transitions. [2025-03-04 07:41:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:41:47,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:47,914 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-04 07:41:47,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:48,114 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-04 07:41:48,115 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-04 07:41:48,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:48,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1444392267, now seen corresponding path program 1 times [2025-03-04 07:41:48,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:48,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134800348] [2025-03-04 07:41:48,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:48,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:48,117 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-04 07:41:48,118 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-04 07:41:48,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:41:48,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:41:48,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:48,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:48,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 07:41:48,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:48,163 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-04 07:41:48,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:48,163 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:48,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134800348] [2025-03-04 07:41:48,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134800348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:48,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:48,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:48,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033425962] [2025-03-04 07:41:48,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:48,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:48,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:48,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:48,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:48,164 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-04 07:41:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:48,172 INFO L93 Difference]: Finished difference Result 500 states and 821 transitions. [2025-03-04 07:41:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:48,173 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-04 07:41:48,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:48,174 INFO L225 Difference]: With dead ends: 500 [2025-03-04 07:41:48,175 INFO L226 Difference]: Without dead ends: 500 [2025-03-04 07:41:48,175 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-04 07:41:48,175 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-04 07:41:48,175 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-04 07:41:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-04 07:41:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-03-04 07:41:48,184 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-04 07:41:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 821 transitions. [2025-03-04 07:41:48,186 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 821 transitions. Word has length 18 [2025-03-04 07:41:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:48,186 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 821 transitions. [2025-03-04 07:41:48,186 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-04 07:41:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 821 transitions. [2025-03-04 07:41:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:41:48,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:48,187 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-04 07:41:48,193 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-04 07:41:48,387 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-04 07:41:48,387 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-04 07:41:48,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:48,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1826486563, now seen corresponding path program 1 times [2025-03-04 07:41:48,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:48,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315574083] [2025-03-04 07:41:48,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:48,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:48,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:48,389 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-04 07:41:48,392 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-04 07:41:48,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:41:48,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:41:48,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:48,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:48,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:48,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:48,493 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-04 07:41:48,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:48,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:48,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315574083] [2025-03-04 07:41:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315574083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:48,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:48,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:41:48,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946804920] [2025-03-04 07:41:48,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:48,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:48,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:48,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:48,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:48,494 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-04 07:41:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:48,545 INFO L93 Difference]: Finished difference Result 574 states and 907 transitions. [2025-03-04 07:41:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:48,546 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-04 07:41:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:48,548 INFO L225 Difference]: With dead ends: 574 [2025-03-04 07:41:48,548 INFO L226 Difference]: Without dead ends: 574 [2025-03-04 07:41:48,548 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-04 07:41:48,548 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-04 07:41:48,548 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-04 07:41:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-04 07:41:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 557. [2025-03-04 07:41:48,557 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-04 07:41:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 903 transitions. [2025-03-04 07:41:48,559 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 903 transitions. Word has length 19 [2025-03-04 07:41:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:48,559 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 903 transitions. [2025-03-04 07:41:48,559 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-04 07:41:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 903 transitions. [2025-03-04 07:41:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:41:48,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:48,560 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-04 07:41:48,569 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-04 07:41:48,760 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-04 07:41:48,761 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-04 07:41:48,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1826487300, now seen corresponding path program 1 times [2025-03-04 07:41:48,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:48,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790045413] [2025-03-04 07:41:48,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:48,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:48,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:48,764 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-04 07:41:48,765 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-04 07:41:48,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:41:48,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:41:48,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:48,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:48,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:41:48,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:48,813 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-04 07:41:48,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:48,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:48,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790045413] [2025-03-04 07:41:48,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790045413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:48,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:48,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:48,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223876337] [2025-03-04 07:41:48,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:48,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:48,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:48,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:48,814 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-04 07:41:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:48,819 INFO L93 Difference]: Finished difference Result 512 states and 836 transitions. [2025-03-04 07:41:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:48,821 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-04 07:41:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:48,823 INFO L225 Difference]: With dead ends: 512 [2025-03-04 07:41:48,823 INFO L226 Difference]: Without dead ends: 512 [2025-03-04 07:41:48,823 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-04 07:41:48,824 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-04 07:41:48,825 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-04 07:41:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-04 07:41:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-03-04 07:41:48,840 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-04 07:41:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 836 transitions. [2025-03-04 07:41:48,842 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 836 transitions. Word has length 19 [2025-03-04 07:41:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:48,842 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 836 transitions. [2025-03-04 07:41:48,842 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-04 07:41:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 836 transitions. [2025-03-04 07:41:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:41:48,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:48,843 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 07:41:48,849 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-04 07:41:49,043 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-04 07:41:49,044 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-04 07:41:49,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash 699095005, now seen corresponding path program 2 times [2025-03-04 07:41:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:49,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594609729] [2025-03-04 07:41:49,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:49,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:49,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:49,046 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-04 07:41:49,047 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-04 07:41:49,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 07:41:49,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:41:49,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:49,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:49,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:49,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:49,113 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-04 07:41:49,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:49,146 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-04 07:41:49,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594609729] [2025-03-04 07:41:49,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594609729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:49,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:49,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 07:41:49,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630045285] [2025-03-04 07:41:49,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:49,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:41:49,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:49,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:41:49,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:49,147 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-04 07:41:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:49,214 INFO L93 Difference]: Finished difference Result 450 states and 689 transitions. [2025-03-04 07:41:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:49,215 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-04 07:41:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:49,216 INFO L225 Difference]: With dead ends: 450 [2025-03-04 07:41:49,216 INFO L226 Difference]: Without dead ends: 450 [2025-03-04 07:41:49,217 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-04 07:41:49,217 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 22 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-04 07:41:49,217 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-04 07:41:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-04 07:41:49,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 432. [2025-03-04 07:41:49,225 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-04 07:41:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 665 transitions. [2025-03-04 07:41:49,226 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 665 transitions. Word has length 22 [2025-03-04 07:41:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:49,227 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 665 transitions. [2025-03-04 07:41:49,227 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-04 07:41:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 665 transitions. [2025-03-04 07:41:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:41:49,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:49,229 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-04 07:41:49,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:41:49,430 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-04 07:41:49,430 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-04 07:41:49,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1009783700, now seen corresponding path program 1 times [2025-03-04 07:41:49,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:49,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836231038] [2025-03-04 07:41:49,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:49,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:49,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:49,433 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-04 07:41:49,434 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-04 07:41:49,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:41:49,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:41:49,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:49,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:49,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 07:41:49,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:49,487 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-04 07:41:49,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:49,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:49,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836231038] [2025-03-04 07:41:49,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836231038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:49,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:49,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:49,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786492129] [2025-03-04 07:41:49,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:49,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:49,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:49,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:49,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:49,489 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-04 07:41:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:49,497 INFO L93 Difference]: Finished difference Result 315 states and 467 transitions. [2025-03-04 07:41:49,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:49,497 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-04 07:41:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:49,498 INFO L225 Difference]: With dead ends: 315 [2025-03-04 07:41:49,499 INFO L226 Difference]: Without dead ends: 315 [2025-03-04 07:41:49,499 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-04 07:41:49,499 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-04 07:41:49,499 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-04 07:41:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-04 07:41:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-03-04 07:41:49,506 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-04 07:41:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2025-03-04 07:41:49,508 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 25 [2025-03-04 07:41:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:49,508 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2025-03-04 07:41:49,508 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-04 07:41:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2025-03-04 07:41:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:41:49,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:49,510 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-04 07:41:49,516 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-04 07:41:49,710 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-04 07:41:49,711 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-04 07:41:49,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1984033445, now seen corresponding path program 1 times [2025-03-04 07:41:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:49,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751065858] [2025-03-04 07:41:49,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:49,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:49,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:49,713 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-04 07:41:49,715 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-04 07:41:49,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:41:49,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:41:49,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:49,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:49,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:49,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:49,913 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:41:49,913 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-04 07:41:50,034 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-04 07:41:50,069 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-04 07:41:50,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:50,204 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-03-04 07:41:50,205 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-04 07:41:54,684 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-03-04 07:41:54,684 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-04 07:41:54,768 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-04 07:41:54,768 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751065858] [2025-03-04 07:41:54,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751065858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:54,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:54,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2025-03-04 07:41:54,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360675822] [2025-03-04 07:41:54,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:54,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:41:54,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:54,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:41:54,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=3, NotChecked=0, Total=110 [2025-03-04 07:41:54,769 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-04 07:41:58,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:42:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:01,291 INFO L93 Difference]: Finished difference Result 352 states and 486 transitions. [2025-03-04 07:42:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:42:01,292 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-04 07:42:01,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:01,293 INFO L225 Difference]: With dead ends: 352 [2025-03-04 07:42:01,293 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 07:42:01,293 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-04 07:42:01,294 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-04 07:42:01,294 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-04 07:42:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 07:42:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 339. [2025-03-04 07:42:01,300 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-04 07:42:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 466 transitions. [2025-03-04 07:42:01,301 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 466 transitions. Word has length 27 [2025-03-04 07:42:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:01,301 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 466 transitions. [2025-03-04 07:42:01,301 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-04 07:42:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 466 transitions. [2025-03-04 07:42:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:42:01,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:01,301 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-04 07:42:01,310 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-04 07:42:01,507 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-04 07:42:01,507 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-04 07:42:01,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:01,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2043608466, now seen corresponding path program 1 times [2025-03-04 07:42:01,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:01,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879363311] [2025-03-04 07:42:01,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:01,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:01,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:01,510 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-04 07:42:01,511 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-04 07:42:01,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:42:01,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:42:01,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:01,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:42:01,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:03,000 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-04 07:42:03,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:42:03,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879363311] [2025-03-04 07:42:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879363311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:42:03,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:42:03,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:42:03,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11777218] [2025-03-04 07:42:03,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:42:03,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:42:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:03,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:42:03,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:42:03,001 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-04 07:42:04,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:04,104 INFO L93 Difference]: Finished difference Result 358 states and 477 transitions. [2025-03-04 07:42:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:42:04,105 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-04 07:42:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:04,106 INFO L225 Difference]: With dead ends: 358 [2025-03-04 07:42:04,106 INFO L226 Difference]: Without dead ends: 358 [2025-03-04 07:42:04,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:42:04,106 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 90 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:04,106 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.7s Time] [2025-03-04 07:42:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-04 07:42:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 348. [2025-03-04 07:42:04,112 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-04 07:42:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 475 transitions. [2025-03-04 07:42:04,113 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 475 transitions. Word has length 28 [2025-03-04 07:42:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:04,113 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 475 transitions. [2025-03-04 07:42:04,113 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-04 07:42:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 475 transitions. [2025-03-04 07:42:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:42:04,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:04,114 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-04 07:42:04,120 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-04 07:42:04,314 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-04 07:42:04,314 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-04 07:42:04,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash -309338846, now seen corresponding path program 1 times [2025-03-04 07:42:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424724569] [2025-03-04 07:42:04,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:04,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:04,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:04,317 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-04 07:42:04,318 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-04 07:42:04,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:42:04,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:42:04,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:04,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:04,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:42:04,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:06,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:42:06,071 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-04 07:42:06,678 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-04 07:42:06,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:11,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424724569] [2025-03-04 07:42:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424724569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1674490991] [2025-03-04 07:42:11,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:11,557 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:42:11,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:42:11,569 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-04 07:42:11,570 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-04 07:42:11,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:42:11,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:42:11,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:11,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:11,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:42:11,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:13,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:42:13,411 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-04 07:42:13,714 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-04 07:42:13,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:18,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1674490991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:18,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:18,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2025-03-04 07:42:18,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49424240] [2025-03-04 07:42:18,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:18,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:42:18,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:18,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:42:18,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2025-03-04 07:42:18,317 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-04 07:42:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:21,090 INFO L93 Difference]: Finished difference Result 370 states and 502 transitions. [2025-03-04 07:42:21,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:42:21,091 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-04 07:42:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:21,092 INFO L225 Difference]: With dead ends: 370 [2025-03-04 07:42:21,092 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 07:42:21,092 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-04 07:42:21,093 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 199 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:21,093 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.3s Time] [2025-03-04 07:42:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 07:42:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 363. [2025-03-04 07:42:21,098 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-04 07:42:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 500 transitions. [2025-03-04 07:42:21,099 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 500 transitions. Word has length 29 [2025-03-04 07:42:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:21,099 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 500 transitions. [2025-03-04 07:42:21,099 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-04 07:42:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 500 transitions. [2025-03-04 07:42:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:42:21,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:21,100 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-04 07:42:21,104 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-04 07:42:21,307 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-04 07:42:21,500 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-04 07:42:21,501 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-04 07:42:21,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:21,501 INFO L85 PathProgramCache]: Analyzing trace with hash 179331362, now seen corresponding path program 1 times [2025-03-04 07:42:21,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:21,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957401341] [2025-03-04 07:42:21,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:21,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:21,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:21,504 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-04 07:42:21,505 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-04 07:42:21,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:42:21,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:42:21,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:21,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:21,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:42:21,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:22,046 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-04 07:42:22,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:42:22,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:22,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957401341] [2025-03-04 07:42:22,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957401341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:42:22,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:42:22,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:42:22,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200109369] [2025-03-04 07:42:22,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:42:22,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:42:22,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:22,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:42:22,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:42:22,047 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-04 07:42:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:22,714 INFO L93 Difference]: Finished difference Result 352 states and 463 transitions. [2025-03-04 07:42:22,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:42:22,715 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-04 07:42:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:22,716 INFO L225 Difference]: With dead ends: 352 [2025-03-04 07:42:22,716 INFO L226 Difference]: Without dead ends: 351 [2025-03-04 07:42:22,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:42:22,716 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 88 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:22,716 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.4s Time] [2025-03-04 07:42:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-04 07:42:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 344. [2025-03-04 07:42:22,722 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-04 07:42:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 458 transitions. [2025-03-04 07:42:22,723 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 458 transitions. Word has length 30 [2025-03-04 07:42:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:22,724 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 458 transitions. [2025-03-04 07:42:22,724 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-04 07:42:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 458 transitions. [2025-03-04 07:42:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:42:22,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:22,725 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-04 07:42:22,732 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-04 07:42:22,925 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-04 07:42:22,925 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-04 07:42:22,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash -999569610, now seen corresponding path program 1 times [2025-03-04 07:42:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538547230] [2025-03-04 07:42:22,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:22,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:22,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:22,928 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-04 07:42:22,929 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-04 07:42:22,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:42:22,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:42:22,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:22,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:22,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:42:22,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:23,272 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-04 07:42:23,593 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:42:23,594 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-04 07:42:23,870 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-04 07:42:23,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:24,792 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-04 07:42:24,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:24,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538547230] [2025-03-04 07:42:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538547230] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:24,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2025-03-04 07:42:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632630303] [2025-03-04 07:42:24,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:24,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:42:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:24,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:42:24,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2025-03-04 07:42:24,794 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-04 07:42:26,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:26,670 INFO L93 Difference]: Finished difference Result 466 states and 579 transitions. [2025-03-04 07:42:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:42:26,671 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-04 07:42:26,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:26,672 INFO L225 Difference]: With dead ends: 466 [2025-03-04 07:42:26,672 INFO L226 Difference]: Without dead ends: 466 [2025-03-04 07:42:26,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=265, Unknown=1, NotChecked=36, Total=420 [2025-03-04 07:42:26,673 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 270 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:26,673 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.1s Time] [2025-03-04 07:42:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-04 07:42:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 414. [2025-03-04 07:42:26,678 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-04 07:42:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 534 transitions. [2025-03-04 07:42:26,679 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 534 transitions. Word has length 30 [2025-03-04 07:42:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:26,679 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 534 transitions. [2025-03-04 07:42:26,679 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-04 07:42:26,679 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 534 transitions. [2025-03-04 07:42:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:42:26,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:26,680 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-04 07:42:26,686 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-04 07:42:26,880 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-04 07:42:26,880 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-04 07:42:26,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash -921886816, now seen corresponding path program 1 times [2025-03-04 07:42:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:26,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950745143] [2025-03-04 07:42:26,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:26,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:26,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:26,882 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-04 07:42:26,883 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-04 07:42:26,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:42:26,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:42:26,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:26,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:26,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:42:26,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:27,369 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-04 07:42:27,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:42:27,558 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-04 07:42:28,098 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-04 07:42:28,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:28,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:28,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950745143] [2025-03-04 07:42:28,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950745143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:28,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [61140943] [2025-03-04 07:42:28,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:28,865 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:42:28,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:42:28,867 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-04 07:42:28,868 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-04 07:42:28,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:42:29,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:42:29,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:29,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:29,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:42:29,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:29,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:42:29,630 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-04 07:42:29,897 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-04 07:42:29,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [61140943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:30,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:30,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2025-03-04 07:42:30,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741874291] [2025-03-04 07:42:30,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:30,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:42:30,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:30,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:42:30,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2025-03-04 07:42:30,375 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-04 07:42:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:32,431 INFO L93 Difference]: Finished difference Result 566 states and 679 transitions. [2025-03-04 07:42:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:42:32,432 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-04 07:42:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:32,433 INFO L225 Difference]: With dead ends: 566 [2025-03-04 07:42:32,433 INFO L226 Difference]: Without dead ends: 566 [2025-03-04 07:42:32,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=132, Invalid=291, Unknown=1, NotChecked=38, Total=462 [2025-03-04 07:42:32,434 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-04 07:42:32,434 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-04 07:42:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-04 07:42:32,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 512. [2025-03-04 07:42:32,440 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-04 07:42:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 646 transitions. [2025-03-04 07:42:32,441 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 646 transitions. Word has length 31 [2025-03-04 07:42:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:32,441 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 646 transitions. [2025-03-04 07:42:32,441 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-04 07:42:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 646 transitions. [2025-03-04 07:42:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:42:32,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:32,441 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-04 07:42:32,445 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-04 07:42:32,648 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-04 07:42:32,842 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-04 07:42:32,842 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-04 07:42:32,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1208314165, now seen corresponding path program 1 times [2025-03-04 07:42:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011134917] [2025-03-04 07:42:32,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:32,845 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-04 07:42:32,845 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-04 07:42:32,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:42:32,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:42:32,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:32,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:32,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:42:32,900 INFO L279 TraceCheckSpWp]: Computing forward predicates...