./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_2.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 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:42:12,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:42:12,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:42:12,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:42:12,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:42:12,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:42:12,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:42:12,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:42:12,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:42:12,278 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:42:12,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:42:12,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:42:12,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:42:12,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:42:12,280 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:42:12,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:42:12,281 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:42:12,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:42:12,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:42:12,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:42:12,281 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:42:12,281 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:42:12,281 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:42:12,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:42:12,282 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:42:12,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:42:12,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:42:12,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:42:12,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:42:12,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:42:12,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:42:12,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:42:12,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:42:12,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:42:12,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:42:12,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:42:12,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:42:12,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:42:12,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:42:12,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:42:12,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:42:12,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:42:12,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:42:12,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:42:12,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:42:12,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:42:12,284 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2025-04-30 10:42:12,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:42:12,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:42:12,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:42:12,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:42:12,492 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:42:12,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_2.i [2025-04-30 10:42:13,749 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f328d819b/caab30d29f734a26a1a5dcf65d314cc6/FLAGc9d03e55d [2025-04-30 10:42:13,958 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:42:13,958 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-bftpd/bftpd_2.i [2025-04-30 10:42:13,972 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f328d819b/caab30d29f734a26a1a5dcf65d314cc6/FLAGc9d03e55d [2025-04-30 10:42:14,749 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f328d819b/caab30d29f734a26a1a5dcf65d314cc6 [2025-04-30 10:42:14,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:42:14,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:42:14,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:42:14,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:42:14,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:42:14,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:42:14" (1/1) ... [2025-04-30 10:42:14,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5832a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:14, skipping insertion in model container [2025-04-30 10:42:14,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:42:14" (1/1) ... [2025-04-30 10:42:14,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:42:15,082 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:42:15,089 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:42:15,104 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:42:15,148 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:42:15,172 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:42:15,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15 WrapperNode [2025-04-30 10:42:15,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:42:15,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:42:15,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:42:15,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:42:15,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,205 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-04-30 10:42:15,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:42:15,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:42:15,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:42:15,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:42:15,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,230 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 6, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2025-04-30 10:42:15,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,239 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:42:15,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:42:15,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:42:15,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:42:15,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (1/1) ... [2025-04-30 10:42:15,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:42:15,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:15,281 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-04-30 10:42:15,284 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-04-30 10:42:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:42:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:42:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:42:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-04-30 10:42:15,302 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-04-30 10:42:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:42:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:42:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:42:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:42:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:42:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:42:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:42:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:42:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:42:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:42:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:42:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:42:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:42:15,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:42:15,399 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:42:15,400 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:42:15,546 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-04-30 10:42:15,546 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:42:15,553 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:42:15,553 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:42:15,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:42:15 BoogieIcfgContainer [2025-04-30 10:42:15,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:42:15,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:42:15,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:42:15,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:42:15,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:42:14" (1/3) ... [2025-04-30 10:42:15,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e46d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:42:15, skipping insertion in model container [2025-04-30 10:42:15,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:15" (2/3) ... [2025-04-30 10:42:15,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e46d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:42:15, skipping insertion in model container [2025-04-30 10:42:15,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:42:15" (3/3) ... [2025-04-30 10:42:15,564 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2025-04-30 10:42:15,574 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:42:15,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.i that has 2 procedures, 61 locations, 72 edges, 1 initial locations, 1 loop locations, and 20 error locations. [2025-04-30 10:42:15,608 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:42:15,619 INFO L340 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;@5e36bf0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:42:15,619 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-30 10:42:15,623 INFO L278 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:42:15,628 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:42:15,628 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:15,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:42:15,628 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:15,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash -920361850, now seen corresponding path program 1 times [2025-04-30 10:42:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:15,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107045272] [2025-04-30 10:42:15,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:15,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:42:15,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:42:15,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:15,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:15,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:15,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107045272] [2025-04-30 10:42:15,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107045272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:15,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:15,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:42:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233285222] [2025-04-30 10:42:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:15,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:42:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:15,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:42:15,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:42:15,915 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:16,047 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2025-04-30 10:42:16,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:42:16,049 INFO L79 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-04-30 10:42:16,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:16,054 INFO L225 Difference]: With dead ends: 124 [2025-04-30 10:42:16,054 INFO L226 Difference]: Without dead ends: 118 [2025-04-30 10:42:16,055 INFO L436 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-04-30 10:42:16,057 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 148 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:16,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-30 10:42:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2025-04-30 10:42:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 82 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:42:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2025-04-30 10:42:16,091 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 6 [2025-04-30 10:42:16,091 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:16,091 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2025-04-30 10:42:16,091 INFO L486 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-04-30 10:42:16,091 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2025-04-30 10:42:16,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:42:16,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:16,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:42:16,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:42:16,095 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:16,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash -920361849, now seen corresponding path program 1 times [2025-04-30 10:42:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:16,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106259848] [2025-04-30 10:42:16,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:16,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:42:16,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:42:16,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:16,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:16,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:16,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106259848] [2025-04-30 10:42:16,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106259848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:16,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:16,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:16,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333026922] [2025-04-30 10:42:16,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:16,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:16,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:16,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:16,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:16,294 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:16,384 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2025-04-30 10:42:16,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:42:16,385 INFO L79 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-04-30 10:42:16,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:16,387 INFO L225 Difference]: With dead ends: 191 [2025-04-30 10:42:16,388 INFO L226 Difference]: Without dead ends: 191 [2025-04-30 10:42:16,388 INFO L436 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-04-30 10:42:16,389 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 82 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:16,389 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 204 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-04-30 10:42:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 168. [2025-04-30 10:42:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 150 states have internal predecessors, (216), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-30 10:42:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2025-04-30 10:42:16,410 INFO L79 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 6 [2025-04-30 10:42:16,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:16,410 INFO L485 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2025-04-30 10:42:16,411 INFO L486 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-04-30 10:42:16,411 INFO L278 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2025-04-30 10:42:16,411 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:42:16,411 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:16,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:16,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:42:16,411 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:16,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1533553699, now seen corresponding path program 1 times [2025-04-30 10:42:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:16,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922372321] [2025-04-30 10:42:16,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:16,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:42:16,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:42:16,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:16,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:16,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922372321] [2025-04-30 10:42:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922372321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:16,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:16,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:16,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817969613] [2025-04-30 10:42:16,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:16,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:16,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:16,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:16,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:16,560 INFO L87 Difference]: Start difference. First operand 168 states and 261 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:16,677 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2025-04-30 10:42:16,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:16,678 INFO L79 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-04-30 10:42:16,678 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:16,679 INFO L225 Difference]: With dead ends: 208 [2025-04-30 10:42:16,679 INFO L226 Difference]: Without dead ends: 208 [2025-04-30 10:42:16,679 INFO L436 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-04-30 10:42:16,680 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:16,681 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 157 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-04-30 10:42:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 171. [2025-04-30 10:42:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 153 states have internal predecessors, (219), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-30 10:42:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 264 transitions. [2025-04-30 10:42:16,697 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 264 transitions. Word has length 7 [2025-04-30 10:42:16,697 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:16,697 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 264 transitions. [2025-04-30 10:42:16,697 INFO L486 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-04-30 10:42:16,697 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 264 transitions. [2025-04-30 10:42:16,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:42:16,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:16,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:16,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:42:16,698 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:16,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 295524454, now seen corresponding path program 1 times [2025-04-30 10:42:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:16,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332837772] [2025-04-30 10:42:16,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:16,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:16,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:42:16,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:42:16,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:16,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:16,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:16,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332837772] [2025-04-30 10:42:16,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332837772] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:16,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:16,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:16,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021037695] [2025-04-30 10:42:16,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:16,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:16,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:16,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:16,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:16,902 INFO L87 Difference]: Start difference. First operand 171 states and 264 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:17,004 INFO L93 Difference]: Finished difference Result 193 states and 266 transitions. [2025-04-30 10:42:17,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:17,004 INFO L79 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-04-30 10:42:17,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:17,005 INFO L225 Difference]: With dead ends: 193 [2025-04-30 10:42:17,005 INFO L226 Difference]: Without dead ends: 193 [2025-04-30 10:42:17,006 INFO L436 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-04-30 10:42:17,006 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 63 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:17,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 201 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-30 10:42:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 171. [2025-04-30 10:42:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 153 states have internal predecessors, (217), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-30 10:42:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2025-04-30 10:42:17,021 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 8 [2025-04-30 10:42:17,022 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:17,022 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2025-04-30 10:42:17,022 INFO L486 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-04-30 10:42:17,022 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2025-04-30 10:42:17,022 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:42:17,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:17,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:17,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:42:17,022 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:17,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:17,023 INFO L85 PathProgramCache]: Analyzing trace with hash 571323525, now seen corresponding path program 1 times [2025-04-30 10:42:17,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:17,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916198743] [2025-04-30 10:42:17,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:17,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:17,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:42:17,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:42:17,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:17,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:17,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:17,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916198743] [2025-04-30 10:42:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916198743] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:17,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:17,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279403216] [2025-04-30 10:42:17,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:17,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:17,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:17,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:17,088 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:17,186 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2025-04-30 10:42:17,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:17,187 INFO L79 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-04-30 10:42:17,187 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:17,188 INFO L225 Difference]: With dead ends: 250 [2025-04-30 10:42:17,189 INFO L226 Difference]: Without dead ends: 250 [2025-04-30 10:42:17,189 INFO L436 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-04-30 10:42:17,190 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 133 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:17,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 190 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-04-30 10:42:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2025-04-30 10:42:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 170 states have (on average 1.5705882352941176) internal successors, (267), 188 states have internal predecessors, (267), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-30 10:42:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 312 transitions. [2025-04-30 10:42:17,204 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 312 transitions. Word has length 9 [2025-04-30 10:42:17,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:17,204 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 312 transitions. [2025-04-30 10:42:17,204 INFO L486 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-04-30 10:42:17,205 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 312 transitions. [2025-04-30 10:42:17,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:42:17,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:17,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:17,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:42:17,205 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:17,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash 531160136, now seen corresponding path program 1 times [2025-04-30 10:42:17,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:17,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387203418] [2025-04-30 10:42:17,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:17,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:17,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:42:17,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:42:17,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:17,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:17,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:17,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387203418] [2025-04-30 10:42:17,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387203418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:17,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:17,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:17,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272381950] [2025-04-30 10:42:17,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:17,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:17,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:17,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:17,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:17,266 INFO L87 Difference]: Start difference. First operand 207 states and 312 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:17,336 INFO L93 Difference]: Finished difference Result 245 states and 327 transitions. [2025-04-30 10:42:17,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:17,336 INFO L79 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-04-30 10:42:17,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:17,337 INFO L225 Difference]: With dead ends: 245 [2025-04-30 10:42:17,337 INFO L226 Difference]: Without dead ends: 245 [2025-04-30 10:42:17,338 INFO L436 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-04-30 10:42:17,338 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 120 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 211 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-04-30 10:42:17,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 211 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-30 10:42:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2025-04-30 10:42:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 179 states have (on average 1.5642458100558658) internal successors, (280), 198 states have internal predecessors, (280), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-30 10:42:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2025-04-30 10:42:17,353 INFO L79 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 10 [2025-04-30 10:42:17,353 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:17,354 INFO L485 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2025-04-30 10:42:17,354 INFO L486 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-04-30 10:42:17,354 INFO L278 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2025-04-30 10:42:17,354 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:42:17,354 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:17,354 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:17,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:42:17,354 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:17,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash 738472334, now seen corresponding path program 1 times [2025-04-30 10:42:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:17,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172101437] [2025-04-30 10:42:17,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:17,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:42:17,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:42:17,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:17,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:17,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172101437] [2025-04-30 10:42:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172101437] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:17,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207677333] [2025-04-30 10:42:17,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:17,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:17,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:17,481 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-04-30 10:42:17,483 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-04-30 10:42:17,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:42:17,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:42:17,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:17,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:17,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:42:17,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:17,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:17,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207677333] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:17,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:17,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-04-30 10:42:17,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357374876] [2025-04-30 10:42:17,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:17,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:42:17,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:17,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:42:17,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:42:17,794 INFO L87 Difference]: Start difference. First operand 217 states and 325 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:17,960 INFO L93 Difference]: Finished difference Result 240 states and 324 transitions. [2025-04-30 10:42:17,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:42:17,961 INFO L79 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-04-30 10:42:17,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:17,962 INFO L225 Difference]: With dead ends: 240 [2025-04-30 10:42:17,962 INFO L226 Difference]: Without dead ends: 240 [2025-04-30 10:42:17,963 INFO L436 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-04-30 10:42:17,963 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 233 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:17,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 384 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-04-30 10:42:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2025-04-30 10:42:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 182 states have (on average 1.5054945054945055) internal successors, (274), 201 states have internal predecessors, (274), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-30 10:42:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 319 transitions. [2025-04-30 10:42:17,973 INFO L79 Accepts]: Start accepts. Automaton has 220 states and 319 transitions. Word has length 14 [2025-04-30 10:42:17,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:17,973 INFO L485 AbstractCegarLoop]: Abstraction has 220 states and 319 transitions. [2025-04-30 10:42:17,973 INFO L486 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-04-30 10:42:17,973 INFO L278 IsEmpty]: Start isEmpty. Operand 220 states and 319 transitions. [2025-04-30 10:42:17,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:42:17,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:17,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:17,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:18,178 WARN L466 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-04-30 10:42:18,178 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:18,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:18,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1417805820, now seen corresponding path program 1 times [2025-04-30 10:42:18,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:18,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252664465] [2025-04-30 10:42:18,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:18,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:42:18,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:42:18,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:18,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:18,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:18,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252664465] [2025-04-30 10:42:18,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252664465] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:18,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020007086] [2025-04-30 10:42:18,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:18,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:18,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:18,309 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-04-30 10:42:18,324 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-04-30 10:42:18,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:42:18,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:42:18,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:18,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:18,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:42:18,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:18,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020007086] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:18,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-04-30 10:42:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917941909] [2025-04-30 10:42:18,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:18,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:42:18,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:18,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:42:18,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:42:18,534 INFO L87 Difference]: Start difference. First operand 220 states and 319 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:18,751 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2025-04-30 10:42:18,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:42:18,752 INFO L79 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-04-30 10:42:18,752 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:18,753 INFO L225 Difference]: With dead ends: 258 [2025-04-30 10:42:18,753 INFO L226 Difference]: Without dead ends: 258 [2025-04-30 10:42:18,753 INFO L436 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-04-30 10:42:18,753 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 124 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:18,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 356 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:42:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-30 10:42:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 228. [2025-04-30 10:42:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 190 states have (on average 1.5) internal successors, (285), 209 states have internal predecessors, (285), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-04-30 10:42:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 330 transitions. [2025-04-30 10:42:18,760 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 330 transitions. Word has length 15 [2025-04-30 10:42:18,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:18,760 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 330 transitions. [2025-04-30 10:42:18,760 INFO L486 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-04-30 10:42:18,760 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 330 transitions. [2025-04-30 10:42:18,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:42:18,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:18,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:18,767 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-04-30 10:42:18,965 WARN L466 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-04-30 10:42:18,965 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:18,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1002307501, now seen corresponding path program 1 times [2025-04-30 10:42:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:18,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59834980] [2025-04-30 10:42:18,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:18,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:42:18,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:42:18,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:18,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:19,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:19,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59834980] [2025-04-30 10:42:19,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59834980] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:19,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281466052] [2025-04-30 10:42:19,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:19,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:19,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:19,125 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-04-30 10:42:19,126 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-04-30 10:42:19,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:42:19,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:42:19,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:19,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:19,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:42:19,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:19,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:19,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-04-30 10:42:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281466052] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:19,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-04-30 10:42:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259431718] [2025-04-30 10:42:19,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:19,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:42:19,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:19,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:42:19,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:42:19,441 INFO L87 Difference]: Start difference. First operand 228 states and 330 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:19,880 INFO L93 Difference]: Finished difference Result 385 states and 531 transitions. [2025-04-30 10:42:19,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:42:19,881 INFO L79 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-04-30 10:42:19,881 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:19,882 INFO L225 Difference]: With dead ends: 385 [2025-04-30 10:42:19,882 INFO L226 Difference]: Without dead ends: 385 [2025-04-30 10:42:19,882 INFO L436 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-04-30 10:42:19,883 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 224 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:19,883 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 617 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:42:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-04-30 10:42:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 323. [2025-04-30 10:42:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 279 states have (on average 1.5412186379928314) internal successors, (430), 298 states have internal predecessors, (430), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2025-04-30 10:42:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2025-04-30 10:42:19,899 INFO L79 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 16 [2025-04-30 10:42:19,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:19,899 INFO L485 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2025-04-30 10:42:19,900 INFO L486 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-04-30 10:42:19,900 INFO L278 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2025-04-30 10:42:19,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:42:19,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:19,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:19,906 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-04-30 10:42:20,101 WARN L466 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-04-30 10:42:20,101 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:20,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1943920271, now seen corresponding path program 1 times [2025-04-30 10:42:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:20,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291527351] [2025-04-30 10:42:20,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:20,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:42:20,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:42:20,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:20,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:20,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291527351] [2025-04-30 10:42:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291527351] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:20,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:20,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:42:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330863503] [2025-04-30 10:42:20,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:20,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:20,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:20,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:20,149 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:20,168 INFO L93 Difference]: Finished difference Result 334 states and 480 transitions. [2025-04-30 10:42:20,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:20,168 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:42:20,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:20,170 INFO L225 Difference]: With dead ends: 334 [2025-04-30 10:42:20,170 INFO L226 Difference]: Without dead ends: 334 [2025-04-30 10:42:20,170 INFO L436 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-04-30 10:42:20,171 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 26 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:20,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 112 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-30 10:42:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 325. [2025-04-30 10:42:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 284 states have (on average 1.528169014084507) internal successors, (434), 305 states have internal predecessors, (434), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (33), 11 states have call predecessors, (33), 11 states have call successors, (33) [2025-04-30 10:42:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 478 transitions. [2025-04-30 10:42:20,180 INFO L79 Accepts]: Start accepts. Automaton has 325 states and 478 transitions. Word has length 18 [2025-04-30 10:42:20,180 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:20,180 INFO L485 AbstractCegarLoop]: Abstraction has 325 states and 478 transitions. [2025-04-30 10:42:20,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:20,180 INFO L278 IsEmpty]: Start isEmpty. Operand 325 states and 478 transitions. [2025-04-30 10:42:20,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:42:20,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:20,181 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-04-30 10:42:20,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:42:20,181 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:20,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2036164058, now seen corresponding path program 1 times [2025-04-30 10:42:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:20,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376803960] [2025-04-30 10:42:20,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:20,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:42:20,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:42:20,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:20,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:20,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:20,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376803960] [2025-04-30 10:42:20,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376803960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:20,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:20,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:20,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844525719] [2025-04-30 10:42:20,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:20,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:20,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:20,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:20,212 INFO L87 Difference]: Start difference. First operand 325 states and 478 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:42:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:20,216 INFO L93 Difference]: Finished difference Result 251 states and 356 transitions. [2025-04-30 10:42:20,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:20,217 INFO L79 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-04-30 10:42:20,217 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:20,217 INFO L225 Difference]: With dead ends: 251 [2025-04-30 10:42:20,218 INFO L226 Difference]: Without dead ends: 251 [2025-04-30 10:42:20,218 INFO L436 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-04-30 10:42:20,218 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:20,218 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-04-30 10:42:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-04-30 10:42:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 216 states have (on average 1.5092592592592593) internal successors, (326), 236 states have internal predecessors, (326), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2025-04-30 10:42:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 356 transitions. [2025-04-30 10:42:20,224 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 356 transitions. Word has length 25 [2025-04-30 10:42:20,224 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:20,224 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 356 transitions. [2025-04-30 10:42:20,224 INFO L486 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-04-30 10:42:20,224 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 356 transitions. [2025-04-30 10:42:20,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:42:20,224 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:20,224 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-04-30 10:42:20,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:42:20,224 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:20,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:20,225 INFO L85 PathProgramCache]: Analyzing trace with hash -72255190, now seen corresponding path program 1 times [2025-04-30 10:42:20,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:20,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36224866] [2025-04-30 10:42:20,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:20,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:42:20,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:42:20,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:20,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:20,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:20,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36224866] [2025-04-30 10:42:20,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36224866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:20,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642485824] [2025-04-30 10:42:20,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:20,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:20,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:20,378 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-04-30 10:42:20,388 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-04-30 10:42:20,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:42:20,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:42:20,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:20,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:20,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:42:20,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:20,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:20,651 INFO L354 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-04-30 10:42:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:20,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642485824] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:20,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:20,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2025-04-30 10:42:20,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806334714] [2025-04-30 10:42:20,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:20,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:42:20,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:20,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:42:20,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:42:20,820 INFO L87 Difference]: Start difference. First operand 251 states and 356 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:42:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:21,122 INFO L93 Difference]: Finished difference Result 284 states and 381 transitions. [2025-04-30 10:42:21,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:42:21,122 INFO L79 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-04-30 10:42:21,122 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:21,123 INFO L225 Difference]: With dead ends: 284 [2025-04-30 10:42:21,123 INFO L226 Difference]: Without dead ends: 284 [2025-04-30 10:42:21,124 INFO L436 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-04-30 10:42:21,124 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 363 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:21,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 183 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-30 10:42:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2025-04-30 10:42:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 235 states have (on average 1.4553191489361703) internal successors, (342), 259 states have internal predecessors, (342), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2025-04-30 10:42:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 376 transitions. [2025-04-30 10:42:21,130 INFO L79 Accepts]: Start accepts. Automaton has 274 states and 376 transitions. Word has length 27 [2025-04-30 10:42:21,132 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:21,132 INFO L485 AbstractCegarLoop]: Abstraction has 274 states and 376 transitions. [2025-04-30 10:42:21,133 INFO L486 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-04-30 10:42:21,133 INFO L278 IsEmpty]: Start isEmpty. Operand 274 states and 376 transitions. [2025-04-30 10:42:21,133 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:42:21,134 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:21,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:21,140 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-04-30 10:42:21,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:21,335 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:21,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:21,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1506398064, now seen corresponding path program 1 times [2025-04-30 10:42:21,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:21,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112888652] [2025-04-30 10:42:21,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:21,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:21,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:42:21,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:42:21,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:21,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:21,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112888652] [2025-04-30 10:42:21,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112888652] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:21,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721864803] [2025-04-30 10:42:21,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:21,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:21,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:21,422 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-04-30 10:42:21,424 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-04-30 10:42:21,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:42:21,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:42:21,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:21,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:21,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:42:21,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:21,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:21,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721864803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:21,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:42:21,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-04-30 10:42:21,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469904650] [2025-04-30 10:42:21,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:21,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:42:21,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:21,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:42:21,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:42:21,558 INFO L87 Difference]: Start difference. First operand 274 states and 376 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:42:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:21,605 INFO L93 Difference]: Finished difference Result 293 states and 391 transitions. [2025-04-30 10:42:21,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:42:21,606 INFO L79 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-04-30 10:42:21,606 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:21,607 INFO L225 Difference]: With dead ends: 293 [2025-04-30 10:42:21,607 INFO L226 Difference]: Without dead ends: 293 [2025-04-30 10:42:21,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:42:21,607 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 68 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:21,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 186 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-04-30 10:42:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 282. [2025-04-30 10:42:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 243 states have (on average 1.440329218106996) internal successors, (350), 267 states have internal predecessors, (350), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2025-04-30 10:42:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 384 transitions. [2025-04-30 10:42:21,615 INFO L79 Accepts]: Start accepts. Automaton has 282 states and 384 transitions. Word has length 28 [2025-04-30 10:42:21,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:21,616 INFO L485 AbstractCegarLoop]: Abstraction has 282 states and 384 transitions. [2025-04-30 10:42:21,616 INFO L486 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-04-30 10:42:21,616 INFO L278 IsEmpty]: Start isEmpty. Operand 282 states and 384 transitions. [2025-04-30 10:42:21,618 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:42:21,618 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:21,618 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-04-30 10:42:21,624 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-04-30 10:42:21,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:42:21,819 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:21,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash -717762487, now seen corresponding path program 1 times [2025-04-30 10:42:21,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:21,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139662655] [2025-04-30 10:42:21,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:21,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:42:21,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:42:21,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:21,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:22,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:22,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139662655] [2025-04-30 10:42:22,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139662655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:22,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864125938] [2025-04-30 10:42:22,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:22,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:22,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:22,170 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-04-30 10:42:22,172 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-04-30 10:42:22,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:42:22,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:42:22,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:22,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:22,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:42:22,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:22,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:22,469 INFO L354 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-04-30 10:42:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:22,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864125938] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:22,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2025-04-30 10:42:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900884832] [2025-04-30 10:42:22,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:22,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:42:22,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:22,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:42:22,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:42:22,651 INFO L87 Difference]: Start difference. First operand 282 states and 384 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-04-30 10:42:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:22,989 INFO L93 Difference]: Finished difference Result 289 states and 383 transitions. [2025-04-30 10:42:22,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:42:22,989 INFO L79 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-04-30 10:42:22,989 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:22,991 INFO L225 Difference]: With dead ends: 289 [2025-04-30 10:42:22,991 INFO L226 Difference]: Without dead ends: 289 [2025-04-30 10:42:22,992 INFO L436 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-04-30 10:42:22,992 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 302 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:22,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 258 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:42:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-04-30 10:42:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 282. [2025-04-30 10:42:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 243 states have (on average 1.4238683127572016) internal successors, (346), 267 states have internal predecessors, (346), 8 states have call successors, (8), 6 states have call predecessors, (8), 13 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2025-04-30 10:42:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 380 transitions. [2025-04-30 10:42:23,001 INFO L79 Accepts]: Start accepts. Automaton has 282 states and 380 transitions. Word has length 29 [2025-04-30 10:42:23,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:23,001 INFO L485 AbstractCegarLoop]: Abstraction has 282 states and 380 transitions. [2025-04-30 10:42:23,001 INFO L486 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-04-30 10:42:23,002 INFO L278 IsEmpty]: Start isEmpty. Operand 282 states and 380 transitions. [2025-04-30 10:42:23,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:42:23,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:23,003 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-04-30 10:42:23,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:42:23,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:23,208 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:23,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash -775800574, now seen corresponding path program 1 times [2025-04-30 10:42:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:23,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949996391] [2025-04-30 10:42:23,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:23,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:23,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:42:23,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:42:23,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:23,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:23,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:23,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949996391] [2025-04-30 10:42:23,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949996391] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:23,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277338803] [2025-04-30 10:42:23,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:23,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:23,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:23,354 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-04-30 10:42:23,355 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-04-30 10:42:23,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:42:23,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:42:23,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:23,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:23,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:42:23,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:23,482 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:42:23,482 INFO L354 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-04-30 10:42:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:23,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277338803] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:23,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:23,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-04-30 10:42:23,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458114307] [2025-04-30 10:42:23,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:23,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:42:23,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:23,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:42:23,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:42:23,568 INFO L87 Difference]: Start difference. First operand 282 states and 380 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:42:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:23,851 INFO L93 Difference]: Finished difference Result 407 states and 509 transitions. [2025-04-30 10:42:23,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:42:23,852 INFO L79 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-04-30 10:42:23,852 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:23,853 INFO L225 Difference]: With dead ends: 407 [2025-04-30 10:42:23,853 INFO L226 Difference]: Without dead ends: 407 [2025-04-30 10:42:23,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:42:23,854 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 363 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:23,854 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 399 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:42:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-04-30 10:42:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 362. [2025-04-30 10:42:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 320 states have (on average 1.378125) internal successors, (441), 345 states have internal predecessors, (441), 8 states have call successors, (8), 8 states have call predecessors, (8), 16 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2025-04-30 10:42:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 474 transitions. [2025-04-30 10:42:23,861 INFO L79 Accepts]: Start accepts. Automaton has 362 states and 474 transitions. Word has length 30 [2025-04-30 10:42:23,861 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:23,861 INFO L485 AbstractCegarLoop]: Abstraction has 362 states and 474 transitions. [2025-04-30 10:42:23,861 INFO L486 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-04-30 10:42:23,861 INFO L278 IsEmpty]: Start isEmpty. Operand 362 states and 474 transitions. [2025-04-30 10:42:23,861 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:42:23,861 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:23,861 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-04-30 10:42:23,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:42:24,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:24,062 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:24,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:24,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1719986027, now seen corresponding path program 1 times [2025-04-30 10:42:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:24,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658449206] [2025-04-30 10:42:24,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:24,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:24,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:42:24,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:42:24,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:24,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:24,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:24,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658449206] [2025-04-30 10:42:24,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658449206] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:24,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506872149] [2025-04-30 10:42:24,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:24,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:24,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:24,188 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-04-30 10:42:24,188 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-04-30 10:42:24,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:42:24,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:42:24,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:24,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:24,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:42:24,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:24,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:24,331 INFO L354 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-04-30 10:42:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:24,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:24,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506872149] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:24,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:24,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2025-04-30 10:42:24,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573525302] [2025-04-30 10:42:24,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:24,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:42:24,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:24,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:42:24,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:42:24,485 INFO L87 Difference]: Start difference. First operand 362 states and 474 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:42:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:24,929 INFO L93 Difference]: Finished difference Result 428 states and 524 transitions. [2025-04-30 10:42:24,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:42:24,930 INFO L79 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-04-30 10:42:24,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:24,931 INFO L225 Difference]: With dead ends: 428 [2025-04-30 10:42:24,932 INFO L226 Difference]: Without dead ends: 428 [2025-04-30 10:42:24,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:42:24,933 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 592 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:24,934 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 355 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:42:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-04-30 10:42:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 378. [2025-04-30 10:42:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 335 states have (on average 1.3850746268656717) internal successors, (464), 361 states have internal predecessors, (464), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-30 10:42:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 493 transitions. [2025-04-30 10:42:24,942 INFO L79 Accepts]: Start accepts. Automaton has 378 states and 493 transitions. Word has length 31 [2025-04-30 10:42:24,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:24,942 INFO L485 AbstractCegarLoop]: Abstraction has 378 states and 493 transitions. [2025-04-30 10:42:24,942 INFO L486 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-04-30 10:42:24,942 INFO L278 IsEmpty]: Start isEmpty. Operand 378 states and 493 transitions. [2025-04-30 10:42:24,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:42:24,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:24,943 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-04-30 10:42:24,949 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-04-30 10:42:25,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:42:25,144 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:25,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1104147249, now seen corresponding path program 1 times [2025-04-30 10:42:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:25,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376416134] [2025-04-30 10:42:25,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:25,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:25,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:42:25,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:42:25,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:25,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:25,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376416134] [2025-04-30 10:42:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376416134] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:25,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148813722] [2025-04-30 10:42:25,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:25,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:25,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:25,314 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-04-30 10:42:25,315 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-04-30 10:42:25,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:42:25,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:42:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:25,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:25,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:42:25,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:25,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:25,549 INFO L354 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-04-30 10:42:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:25,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:25,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148813722] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:25,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:25,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2025-04-30 10:42:25,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633814751] [2025-04-30 10:42:25,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:25,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:42:25,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:25,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:42:25,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:42:25,777 INFO L87 Difference]: Start difference. First operand 378 states and 493 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:42:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:26,153 INFO L93 Difference]: Finished difference Result 395 states and 493 transitions. [2025-04-30 10:42:26,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:42:26,153 INFO L79 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-04-30 10:42:26,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:26,154 INFO L225 Difference]: With dead ends: 395 [2025-04-30 10:42:26,154 INFO L226 Difference]: Without dead ends: 395 [2025-04-30 10:42:26,155 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:42:26,155 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 332 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:26,155 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 285 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:42:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-04-30 10:42:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 377. [2025-04-30 10:42:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 337 states have (on average 1.3264094955489614) internal successors, (447), 360 states have internal predecessors, (447), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-30 10:42:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 476 transitions. [2025-04-30 10:42:26,161 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 476 transitions. Word has length 35 [2025-04-30 10:42:26,161 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:26,161 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 476 transitions. [2025-04-30 10:42:26,161 INFO L486 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-04-30 10:42:26,161 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 476 transitions. [2025-04-30 10:42:26,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:42:26,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:26,162 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-04-30 10:42:26,168 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-04-30 10:42:26,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:42:26,362 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:26,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:26,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1181916468, now seen corresponding path program 1 times [2025-04-30 10:42:26,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:26,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149338538] [2025-04-30 10:42:26,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:26,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:42:26,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:42:26,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:26,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:26,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149338538] [2025-04-30 10:42:26,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149338538] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:26,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813728804] [2025-04-30 10:42:26,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:26,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:26,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:26,398 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-04-30 10:42:26,399 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-04-30 10:42:26,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:42:26,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:42:26,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:26,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:26,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:42:26,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:26,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:26,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813728804] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:26,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:26,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-30 10:42:26,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867205444] [2025-04-30 10:42:26,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:26,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:42:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:26,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:42:26,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:42:26,511 INFO L87 Difference]: Start difference. First operand 377 states and 476 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:42:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:26,530 INFO L93 Difference]: Finished difference Result 375 states and 470 transitions. [2025-04-30 10:42:26,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:42:26,530 INFO L79 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-04-30 10:42:26,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:26,531 INFO L225 Difference]: With dead ends: 375 [2025-04-30 10:42:26,531 INFO L226 Difference]: Without dead ends: 375 [2025-04-30 10:42:26,531 INFO L436 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-04-30 10:42:26,532 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:26,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 96 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-04-30 10:42:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-04-30 10:42:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 337 states have (on average 1.3086053412462908) internal successors, (441), 358 states have internal predecessors, (441), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-30 10:42:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 470 transitions. [2025-04-30 10:42:26,539 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 470 transitions. Word has length 40 [2025-04-30 10:42:26,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:26,540 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 470 transitions. [2025-04-30 10:42:26,540 INFO L486 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-04-30 10:42:26,540 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 470 transitions. [2025-04-30 10:42:26,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:42:26,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:26,541 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-04-30 10:42:26,547 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-04-30 10:42:26,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:42:26,745 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:26,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:26,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2015295062, now seen corresponding path program 1 times [2025-04-30 10:42:26,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:26,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438079262] [2025-04-30 10:42:26,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:26,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:42:26,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:42:26,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:26,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:26,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:26,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438079262] [2025-04-30 10:42:26,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438079262] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:26,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174889203] [2025-04-30 10:42:26,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:26,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:26,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:26,788 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-04-30 10:42:26,790 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-04-30 10:42:26,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:42:26,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:42:26,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:26,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:26,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:42:26,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:26,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174889203] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:26,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-30 10:42:26,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99001415] [2025-04-30 10:42:26,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:26,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:42:26,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:26,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:42:26,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:42:26,928 INFO L87 Difference]: Start difference. First operand 375 states and 470 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:42:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:26,960 INFO L93 Difference]: Finished difference Result 373 states and 464 transitions. [2025-04-30 10:42:26,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:42:26,961 INFO L79 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-04-30 10:42:26,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:26,962 INFO L225 Difference]: With dead ends: 373 [2025-04-30 10:42:26,962 INFO L226 Difference]: Without dead ends: 373 [2025-04-30 10:42:26,962 INFO L436 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-04-30 10:42:26,962 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:26,962 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 75 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-04-30 10:42:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-04-30 10:42:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 337 states have (on average 1.2908011869436202) internal successors, (435), 356 states have internal predecessors, (435), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-30 10:42:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 464 transitions. [2025-04-30 10:42:26,971 INFO L79 Accepts]: Start accepts. Automaton has 373 states and 464 transitions. Word has length 41 [2025-04-30 10:42:26,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:26,971 INFO L485 AbstractCegarLoop]: Abstraction has 373 states and 464 transitions. [2025-04-30 10:42:26,971 INFO L486 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-04-30 10:42:26,971 INFO L278 IsEmpty]: Start isEmpty. Operand 373 states and 464 transitions. [2025-04-30 10:42:26,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-30 10:42:26,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:26,972 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-04-30 10:42:26,978 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-04-30 10:42:27,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:27,177 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:27,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1950362614, now seen corresponding path program 1 times [2025-04-30 10:42:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:27,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532175776] [2025-04-30 10:42:27,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:27,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:27,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:42:27,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:42:27,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:27,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:27,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532175776] [2025-04-30 10:42:27,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532175776] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:27,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002393788] [2025-04-30 10:42:27,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:27,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:27,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:27,302 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-04-30 10:42:27,303 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-04-30 10:42:27,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:42:27,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:42:27,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:27,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:27,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:42:27,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:27,368 INFO L354 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-04-30 10:42:27,394 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:42:27,394 INFO L354 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-04-30 10:42:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:27,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002393788] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:27,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-30 10:42:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787039793] [2025-04-30 10:42:27,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:27,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:42:27,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:27,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:42:27,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:42:27,443 INFO L87 Difference]: Start difference. First operand 373 states and 464 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:42:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:27,495 INFO L93 Difference]: Finished difference Result 401 states and 491 transitions. [2025-04-30 10:42:27,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:27,496 INFO L79 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-04-30 10:42:27,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:27,497 INFO L225 Difference]: With dead ends: 401 [2025-04-30 10:42:27,498 INFO L226 Difference]: Without dead ends: 401 [2025-04-30 10:42:27,498 INFO L436 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-04-30 10:42:27,498 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 31 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:27,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 131 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-04-30 10:42:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 373. [2025-04-30 10:42:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 337 states have (on average 1.28486646884273) internal successors, (433), 356 states have internal predecessors, (433), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-30 10:42:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 462 transitions. [2025-04-30 10:42:27,505 INFO L79 Accepts]: Start accepts. Automaton has 373 states and 462 transitions. Word has length 42 [2025-04-30 10:42:27,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:27,505 INFO L485 AbstractCegarLoop]: Abstraction has 373 states and 462 transitions. [2025-04-30 10:42:27,506 INFO L486 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-04-30 10:42:27,506 INFO L278 IsEmpty]: Start isEmpty. Operand 373 states and 462 transitions. [2025-04-30 10:42:27,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:42:27,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:27,506 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-04-30 10:42:27,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-30 10:42:27,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:27,706 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:27,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash -709967401, now seen corresponding path program 1 times [2025-04-30 10:42:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:27,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697997678] [2025-04-30 10:42:27,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:27,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:42:27,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:42:27,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:27,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:42:27,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:27,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697997678] [2025-04-30 10:42:27,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697997678] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:27,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960214147] [2025-04-30 10:42:27,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:27,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:27,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:27,762 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-04-30 10:42:27,766 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-04-30 10:42:27,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:42:27,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:42:27,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:27,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:27,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:42:27,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:42:27,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:27,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960214147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:27,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:42:27,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-04-30 10:42:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770377036] [2025-04-30 10:42:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:27,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:27,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:27,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:42:27,845 INFO L87 Difference]: Start difference. First operand 373 states and 462 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:42:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:27,862 INFO L93 Difference]: Finished difference Result 366 states and 441 transitions. [2025-04-30 10:42:27,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:27,862 INFO L79 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-04-30 10:42:27,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:27,863 INFO L225 Difference]: With dead ends: 366 [2025-04-30 10:42:27,863 INFO L226 Difference]: Without dead ends: 366 [2025-04-30 10:42:27,864 INFO L436 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-04-30 10:42:27,864 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:27,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 158 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:27,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-04-30 10:42:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2025-04-30 10:42:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 328 states have (on average 1.2560975609756098) internal successors, (412), 347 states have internal predecessors, (412), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2025-04-30 10:42:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 441 transitions. [2025-04-30 10:42:27,869 INFO L79 Accepts]: Start accepts. Automaton has 364 states and 441 transitions. Word has length 45 [2025-04-30 10:42:27,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:27,869 INFO L485 AbstractCegarLoop]: Abstraction has 364 states and 441 transitions. [2025-04-30 10:42:27,869 INFO L486 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-04-30 10:42:27,870 INFO L278 IsEmpty]: Start isEmpty. Operand 364 states and 441 transitions. [2025-04-30 10:42:27,870 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:42:27,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:27,870 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:27,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:42:28,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-30 10:42:28,075 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:28,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1420213817, now seen corresponding path program 1 times [2025-04-30 10:42:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:28,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873527047] [2025-04-30 10:42:28,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:28,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:42:28,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:42:28,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:28,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-30 10:42:28,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:28,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873527047] [2025-04-30 10:42:28,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873527047] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:28,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:28,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645643928] [2025-04-30 10:42:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:28,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:28,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:28,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:28,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:28,101 INFO L87 Difference]: Start difference. First operand 364 states and 441 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:42:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:28,104 INFO L93 Difference]: Finished difference Result 299 states and 349 transitions. [2025-04-30 10:42:28,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:28,106 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-04-30 10:42:28,106 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:28,107 INFO L225 Difference]: With dead ends: 299 [2025-04-30 10:42:28,107 INFO L226 Difference]: Without dead ends: 299 [2025-04-30 10:42:28,107 INFO L436 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-04-30 10:42:28,108 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:28,108 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-04-30 10:42:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2025-04-30 10:42:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 270 states have (on average 1.2074074074074075) internal successors, (326), 281 states have internal predecessors, (326), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-30 10:42:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2025-04-30 10:42:28,113 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 47 [2025-04-30 10:42:28,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:28,113 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2025-04-30 10:42:28,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:42:28,113 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2025-04-30 10:42:28,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:42:28,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:28,113 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-04-30 10:42:28,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:42:28,114 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:28,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1750915867, now seen corresponding path program 1 times [2025-04-30 10:42:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:28,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444873297] [2025-04-30 10:42:28,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:28,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:42:28,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:42:28,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:28,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:28,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:28,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444873297] [2025-04-30 10:42:28,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444873297] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:28,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098905655] [2025-04-30 10:42:28,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:28,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:28,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:28,160 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-04-30 10:42:28,162 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-04-30 10:42:28,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:42:28,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:42:28,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:28,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:28,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:42:28,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:28,263 WARN L871 $PredicateComparison]: unable to prove that (exists ((|v_parse_input_c1_~x~0#1.base_62| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_parse_input_c1_~x~0#1.base_62| (select |c_#valid| |v_parse_input_c1_~x~0#1.base_62|))) (<= |v_parse_input_c1_~x~0#1.base_62| c_~global~0.base))) is different from true [2025-04-30 10:42:28,287 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:42:28,287 INFO L354 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-04-30 10:42:28,393 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:42:28,393 INFO L354 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-04-30 10:42:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-04-30 10:42:28,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:28,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098905655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:28,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:28,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 16 [2025-04-30 10:42:28,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230023693] [2025-04-30 10:42:28,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:28,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:42:28,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:28,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:42:28,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2025-04-30 10:42:28,502 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:42:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:28,941 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2025-04-30 10:42:28,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:42:28,941 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2025-04-30 10:42:28,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:28,942 INFO L225 Difference]: With dead ends: 274 [2025-04-30 10:42:28,942 INFO L226 Difference]: Without dead ends: 274 [2025-04-30 10:42:28,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1053, Unknown=1, NotChecked=70, Total=1406 [2025-04-30 10:42:28,943 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 331 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:28,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 419 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 413 Invalid, 0 Unknown, 168 Unchecked, 0.2s Time] [2025-04-30 10:42:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-04-30 10:42:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 257. [2025-04-30 10:42:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 235 states have (on average 1.1787234042553192) internal successors, (277), 244 states have internal predecessors, (277), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-30 10:42:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 292 transitions. [2025-04-30 10:42:28,947 INFO L79 Accepts]: Start accepts. Automaton has 257 states and 292 transitions. Word has length 51 [2025-04-30 10:42:28,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:28,947 INFO L485 AbstractCegarLoop]: Abstraction has 257 states and 292 transitions. [2025-04-30 10:42:28,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:42:28,947 INFO L278 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2025-04-30 10:42:28,947 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:42:28,947 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:28,948 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-04-30 10:42:28,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:42:29,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:29,152 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:29,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash 827255584, now seen corresponding path program 1 times [2025-04-30 10:42:29,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:29,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646725091] [2025-04-30 10:42:29,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:29,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:29,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:42:29,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:42:29,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:29,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:29,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:29,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646725091] [2025-04-30 10:42:29,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646725091] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:29,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496031114] [2025-04-30 10:42:29,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:29,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:29,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:29,306 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-04-30 10:42:29,307 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-04-30 10:42:29,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:42:29,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:42:29,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:29,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:29,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-30 10:42:29,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:29,439 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:42:29,439 INFO L354 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-04-30 10:42:29,509 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:42:29,509 INFO L354 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-04-30 10:42:29,542 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:42:29,542 INFO L354 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-04-30 10:42:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:29,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:29,609 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:42:29,610 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2025-04-30 10:42:29,755 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:42:29,756 INFO L354 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-04-30 10:42:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:29,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496031114] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:29,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:29,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2025-04-30 10:42:29,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046033854] [2025-04-30 10:42:29,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:29,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-30 10:42:29,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:29,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-30 10:42:29,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:42:29,873 INFO L87 Difference]: Start difference. First operand 257 states and 292 transitions. Second operand has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:42:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:29,991 INFO L93 Difference]: Finished difference Result 265 states and 300 transitions. [2025-04-30 10:42:29,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:42:29,992 INFO L79 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-04-30 10:42:29,992 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:29,992 INFO L225 Difference]: With dead ends: 265 [2025-04-30 10:42:29,992 INFO L226 Difference]: Without dead ends: 265 [2025-04-30 10:42:29,993 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:42:29,993 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 180 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:29,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 122 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-04-30 10:42:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 256. [2025-04-30 10:42:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 235 states have (on average 1.174468085106383) internal successors, (276), 243 states have internal predecessors, (276), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-30 10:42:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 291 transitions. [2025-04-30 10:42:29,997 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 291 transitions. Word has length 51 [2025-04-30 10:42:29,998 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:29,998 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 291 transitions. [2025-04-30 10:42:29,998 INFO L486 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-04-30 10:42:29,998 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 291 transitions. [2025-04-30 10:42:29,998 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-30 10:42:29,998 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:29,998 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-04-30 10:42:30,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:30,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:30,199 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:30,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -124880695, now seen corresponding path program 1 times [2025-04-30 10:42:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:30,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751505854] [2025-04-30 10:42:30,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:30,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:30,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:42:30,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:42:30,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:30,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:30,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:30,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751505854] [2025-04-30 10:42:30,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751505854] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:30,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810128745] [2025-04-30 10:42:30,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:30,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:30,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:30,646 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-04-30 10:42:30,647 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-04-30 10:42:30,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:42:30,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:42:30,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:30,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:30,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:42:30,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:30,847 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:42:30,847 INFO L354 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-04-30 10:42:31,002 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:42:31,003 INFO L354 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-04-30 10:42:31,036 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:42:31,036 INFO L354 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-04-30 10:42:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:31,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:31,198 INFO L325 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-04-30 10:42:31,198 INFO L354 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-04-30 10:42:31,370 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-30 10:42:31,370 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2025-04-30 10:42:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:31,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810128745] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:31,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:31,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 14] total 42 [2025-04-30 10:42:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468995075] [2025-04-30 10:42:31,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:31,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-30 10:42:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:31,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-30 10:42:31,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1611, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:42:31,622 INFO L87 Difference]: Start difference. First operand 256 states and 291 transitions. Second operand has 43 states, 39 states have (on average 3.58974358974359) internal successors, (140), 35 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-04-30 10:42:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:32,114 INFO L93 Difference]: Finished difference Result 266 states and 299 transitions. [2025-04-30 10:42:32,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:42:32,115 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 3.58974358974359) internal successors, (140), 35 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-04-30 10:42:32,115 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:32,115 INFO L225 Difference]: With dead ends: 266 [2025-04-30 10:42:32,115 INFO L226 Difference]: Without dead ends: 266 [2025-04-30 10:42:32,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=433, Invalid=2219, Unknown=0, NotChecked=0, Total=2652 [2025-04-30 10:42:32,116 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 361 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:32,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 335 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:42:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-04-30 10:42:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2025-04-30 10:42:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 235 states have (on average 1.1702127659574468) internal successors, (275), 243 states have internal predecessors, (275), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-30 10:42:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 290 transitions. [2025-04-30 10:42:32,120 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 290 transitions. Word has length 52 [2025-04-30 10:42:32,120 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:32,120 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 290 transitions. [2025-04-30 10:42:32,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 3.58974358974359) internal successors, (140), 35 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-04-30 10:42:32,120 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 290 transitions. [2025-04-30 10:42:32,120 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-30 10:42:32,121 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:32,121 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-04-30 10:42:32,127 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-04-30 10:42:32,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-30 10:42:32,325 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:32,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:32,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2017261651, now seen corresponding path program 1 times [2025-04-30 10:42:32,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:32,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337110249] [2025-04-30 10:42:32,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:32,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:32,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:42:32,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:42:32,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:32,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:42:32,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:32,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337110249] [2025-04-30 10:42:32,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337110249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:32,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638027090] [2025-04-30 10:42:32,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:32,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:32,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:32,481 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-04-30 10:42:32,483 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-04-30 10:42:32,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:42:32,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:42:32,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:32,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:32,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-30 10:42:32,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:32,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:32,623 INFO L354 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-04-30 10:42:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:42:32,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638027090] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:32,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2025-04-30 10:42:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127485108] [2025-04-30 10:42:32,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:32,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:42:32,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:32,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:42:32,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:42:32,833 INFO L87 Difference]: Start difference. First operand 256 states and 290 transitions. Second operand has 17 states, 14 states have (on average 5.571428571428571) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:42:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:33,177 INFO L93 Difference]: Finished difference Result 267 states and 295 transitions. [2025-04-30 10:42:33,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:42:33,178 INFO L79 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-04-30 10:42:33,178 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:33,179 INFO L225 Difference]: With dead ends: 267 [2025-04-30 10:42:33,179 INFO L226 Difference]: Without dead ends: 267 [2025-04-30 10:42:33,179 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:42:33,179 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 350 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:33,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 221 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-04-30 10:42:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 255. [2025-04-30 10:42:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 242 states have internal predecessors, (269), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-30 10:42:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 284 transitions. [2025-04-30 10:42:33,185 INFO L79 Accepts]: Start accepts. Automaton has 255 states and 284 transitions. Word has length 52 [2025-04-30 10:42:33,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:33,185 INFO L485 AbstractCegarLoop]: Abstraction has 255 states and 284 transitions. [2025-04-30 10:42:33,185 INFO L486 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-04-30 10:42:33,185 INFO L278 IsEmpty]: Start isEmpty. Operand 255 states and 284 transitions. [2025-04-30 10:42:33,185 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:42:33,185 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:33,186 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-04-30 10:42:33,192 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-04-30 10:42:33,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-30 10:42:33,390 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:33,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash 248737707, now seen corresponding path program 1 times [2025-04-30 10:42:33,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:33,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948081603] [2025-04-30 10:42:33,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:33,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:33,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:42:33,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:42:33,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:33,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:33,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:33,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948081603] [2025-04-30 10:42:33,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948081603] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:33,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335651646] [2025-04-30 10:42:33,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:33,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:33,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:33,644 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-04-30 10:42:33,647 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-04-30 10:42:33,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:42:33,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:42:33,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:33,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:33,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:42:33,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:33,779 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:42:33,779 INFO L354 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-04-30 10:42:33,949 INFO L325 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2025-04-30 10:42:33,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2025-04-30 10:42:34,023 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-30 10:42:34,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2025-04-30 10:42:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:34,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:34,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335651646] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:34,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:34,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-04-30 10:42:34,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838216212] [2025-04-30 10:42:34,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:34,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:42:34,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:34,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:42:34,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:42:34,127 INFO L87 Difference]: Start difference. First operand 255 states and 284 transitions. Second operand has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-30 10:42:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:34,529 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2025-04-30 10:42:34,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:42:34,529 INFO L79 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-04-30 10:42:34,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:34,530 INFO L225 Difference]: With dead ends: 263 [2025-04-30 10:42:34,530 INFO L226 Difference]: Without dead ends: 263 [2025-04-30 10:42:34,530 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:42:34,530 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 238 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:34,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 216 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:42:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-04-30 10:42:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2025-04-30 10:42:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 235 states have (on average 1.1404255319148937) internal successors, (268), 241 states have internal predecessors, (268), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-30 10:42:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 283 transitions. [2025-04-30 10:42:34,535 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 283 transitions. Word has length 54 [2025-04-30 10:42:34,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:34,535 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 283 transitions. [2025-04-30 10:42:34,535 INFO L486 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-04-30 10:42:34,535 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 283 transitions. [2025-04-30 10:42:34,536 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-04-30 10:42:34,536 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:34,536 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-04-30 10:42:34,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:34,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-30 10:42:34,737 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:34,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash -520337758, now seen corresponding path program 1 times [2025-04-30 10:42:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:34,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735282489] [2025-04-30 10:42:34,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:34,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:42:34,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:42:34,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:34,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:35,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:35,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735282489] [2025-04-30 10:42:35,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735282489] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:35,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327331647] [2025-04-30 10:42:35,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:35,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:35,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:35,084 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-04-30 10:42:35,084 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-04-30 10:42:35,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:42:35,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:42:35,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:35,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:35,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-30 10:42:35,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:35,337 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:42:35,337 INFO L354 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-04-30 10:42:35,594 INFO L325 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2025-04-30 10:42:35,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2025-04-30 10:42:35,685 INFO L325 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2025-04-30 10:42:35,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 64 [2025-04-30 10:42:35,739 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-30 10:42:35,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2025-04-30 10:42:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:35,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:35,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327331647] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:35,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:35,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 25 [2025-04-30 10:42:35,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702772246] [2025-04-30 10:42:35,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:35,944 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-30 10:42:35,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:35,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-30 10:42:35,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:42:35,945 INFO L87 Difference]: Start difference. First operand 254 states and 283 transitions. Second operand has 27 states, 24 states have (on average 4.583333333333333) internal successors, (110), 23 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:42:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:36,385 INFO L93 Difference]: Finished difference Result 262 states and 291 transitions. [2025-04-30 10:42:36,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:42:36,385 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 4.583333333333333) internal successors, (110), 23 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 60 [2025-04-30 10:42:36,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:36,386 INFO L225 Difference]: With dead ends: 262 [2025-04-30 10:42:36,386 INFO L226 Difference]: Without dead ends: 262 [2025-04-30 10:42:36,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1300, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:42:36,387 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 281 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:36,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 242 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:42:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-04-30 10:42:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 253. [2025-04-30 10:42:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 235 states have (on average 1.1361702127659574) internal successors, (267), 240 states have internal predecessors, (267), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-30 10:42:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 282 transitions. [2025-04-30 10:42:36,390 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 282 transitions. Word has length 60 [2025-04-30 10:42:36,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:36,390 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 282 transitions. [2025-04-30 10:42:36,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 4.583333333333333) internal successors, (110), 23 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:42:36,390 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 282 transitions. [2025-04-30 10:42:36,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-04-30 10:42:36,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:36,391 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-04-30 10:42:36,398 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-04-30 10:42:36,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:36,595 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:36,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:36,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1049398727, now seen corresponding path program 1 times [2025-04-30 10:42:36,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:36,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789682904] [2025-04-30 10:42:36,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:36,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:36,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-30 10:42:36,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-30 10:42:36,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:36,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:36,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:36,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789682904] [2025-04-30 10:42:36,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789682904] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:36,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660779674] [2025-04-30 10:42:36,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:36,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:36,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:36,991 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-04-30 10:42:36,992 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-04-30 10:42:37,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-30 10:42:37,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-30 10:42:37,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:37,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:37,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-30 10:42:37,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:37,290 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:42:37,290 INFO L354 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-04-30 10:42:37,294 INFO L354 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-04-30 10:42:37,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:42:37,490 INFO L354 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-04-30 10:42:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:42:37,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:37,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660779674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:37,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:37,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 23 [2025-04-30 10:42:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564811098] [2025-04-30 10:42:37,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:37,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:42:37,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:37,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:42:37,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:42:37,785 INFO L87 Difference]: Start difference. First operand 253 states and 282 transitions. Second operand has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:42:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:38,511 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2025-04-30 10:42:38,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:42:38,511 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2025-04-30 10:42:38,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:38,512 INFO L225 Difference]: With dead ends: 278 [2025-04-30 10:42:38,512 INFO L226 Difference]: Without dead ends: 278 [2025-04-30 10:42:38,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=1952, Unknown=0, NotChecked=0, Total=2352 [2025-04-30 10:42:38,513 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 391 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:38,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 265 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:42:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-04-30 10:42:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 252. [2025-04-30 10:42:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 235 states have (on average 1.1319148936170214) internal successors, (266), 239 states have internal predecessors, (266), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-04-30 10:42:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 281 transitions. [2025-04-30 10:42:38,520 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 281 transitions. Word has length 61 [2025-04-30 10:42:38,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:38,520 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 281 transitions. [2025-04-30 10:42:38,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:42:38,520 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 281 transitions. [2025-04-30 10:42:38,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:42:38,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:38,521 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-04-30 10:42:38,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-30 10:42:38,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:42:38,721 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:38,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1213223649, now seen corresponding path program 1 times [2025-04-30 10:42:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:38,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518417521] [2025-04-30 10:42:38,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:38,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:42:38,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:42:38,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:38,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:38,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:38,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518417521] [2025-04-30 10:42:38,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518417521] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:38,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514454319] [2025-04-30 10:42:38,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:38,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:38,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:38,878 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-04-30 10:42:38,879 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-04-30 10:42:38,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:42:38,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:42:38,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:38,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:38,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:42:38,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:38,950 INFO L354 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-04-30 10:42:39,025 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:42:39,025 INFO L354 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-04-30 10:42:39,046 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:42:39,046 INFO L354 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-04-30 10:42:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:39,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:39,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514454319] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:39,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:39,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-04-30 10:42:39,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163585787] [2025-04-30 10:42:39,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:39,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:42:39,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:39,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:42:39,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:42:39,108 INFO L87 Difference]: Start difference. First operand 252 states and 281 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:42:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:39,236 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2025-04-30 10:42:39,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:42:39,236 INFO L79 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-04-30 10:42:39,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:39,237 INFO L225 Difference]: With dead ends: 263 [2025-04-30 10:42:39,237 INFO L226 Difference]: Without dead ends: 263 [2025-04-30 10:42:39,238 INFO L436 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-04-30 10:42:39,238 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 21 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:39,238 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 219 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-04-30 10:42:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 207. [2025-04-30 10:42:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-30 10:42:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 231 transitions. [2025-04-30 10:42:39,242 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 231 transitions. Word has length 66 [2025-04-30 10:42:39,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:39,243 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 231 transitions. [2025-04-30 10:42:39,243 INFO L486 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-04-30 10:42:39,243 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 231 transitions. [2025-04-30 10:42:39,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-30 10:42:39,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:39,243 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-04-30 10:42:39,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-30 10:42:39,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:39,448 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:39,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1024292242, now seen corresponding path program 1 times [2025-04-30 10:42:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:39,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363676638] [2025-04-30 10:42:39,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:39,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:39,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-30 10:42:39,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-30 10:42:39,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:39,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:42:39,462 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:42:39,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-30 10:42:39,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-30 10:42:39,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:39,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:42:39,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:42:39,490 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:42:39,490 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2025-04-30 10:42:39,492 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2025-04-30 10:42:39,492 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2025-04-30 10:42:39,492 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2025-04-30 10:42:39,492 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2025-04-30 10:42:39,492 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2025-04-30 10:42:39,492 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2025-04-30 10:42:39,492 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2025-04-30 10:42:39,492 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2025-04-30 10:42:39,493 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2025-04-30 10:42:39,493 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-04-30 10:42:39,493 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2025-04-30 10:42:39,493 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2025-04-30 10:42:39,493 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2025-04-30 10:42:39,493 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2025-04-30 10:42:39,493 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2025-04-30 10:42:39,493 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2025-04-30 10:42:39,493 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2025-04-30 10:42:39,493 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2025-04-30 10:42:39,494 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2025-04-30 10:42:39,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-30 10:42:39,497 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:39,570 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:42:39,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:42:39 BoogieIcfgContainer [2025-04-30 10:42:39,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:42:39,579 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:42:39,579 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:42:39,579 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:42:39,579 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:42:15" (3/4) ... [2025-04-30 10:42:39,581 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:42:39,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:42:39,582 INFO L158 Benchmark]: Toolchain (without parser) took 24829.98ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 131.7MB in the beginning and 146.7MB in the end (delta: -15.0MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. [2025-04-30 10:42:39,582 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:42:39,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.68ms. Allocated memory is still 167.8MB. Free memory was 131.3MB in the beginning and 108.2MB in the end (delta: 23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:42:39,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.38ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 106.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:42:39,582 INFO L158 Benchmark]: Boogie Preprocessor took 48.98ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 103.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:42:39,582 INFO L158 Benchmark]: RCFGBuilder took 297.84ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 87.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:42:39,583 INFO L158 Benchmark]: TraceAbstraction took 24023.23ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 86.7MB in the beginning and 146.8MB in the end (delta: -60.0MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2025-04-30 10:42:39,583 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 293.6MB. Free memory was 146.8MB in the beginning and 146.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:42:39,583 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.25ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.68ms. Allocated memory is still 167.8MB. Free memory was 131.3MB in the beginning and 108.2MB in the end (delta: 23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.38ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 106.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.98ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 103.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 297.84ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 87.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24023.23ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 86.7MB in the beginning and 146.8MB in the end (delta: -60.0MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 293.6MB. Free memory was 146.8MB in the beginning and 146.7MB in the end (delta: 92.3kB). 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: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L692] COND TRUE i < 2 VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0] [L693] EXPR commands[i].name VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=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 [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=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 [\at(global, Pre)={0:0}, \at(input, Pre)={3:0}, \at(state, Pre)=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 [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L706] COND FALSE !(\read(*global)) VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L709] global = x [L710] state = STATE_2 VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L722] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L723] CALL parse_input("c1") VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=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 [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=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 [\at(global, Pre)={7:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=2, input={4:0}, state=1] [L692] COND FALSE !(i < 2) [L723] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L724] CALL parse_input("c2") VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=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 [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L693] EXPR commands[i].name VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=1, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=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 [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, i=2, input={5:0}, state=1] [L692] COND FALSE !(i < 2) [L724] RET parse_input("c2") VAL [commands={6:0}, global={7:0}, state=1] [L725] return 0; VAL [\result=0, commands={6:0}, global={7:0}, state=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 72 edges, 20 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 31, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5543 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5543 mSDsluCounter, 6906 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 168 IncrementalHoareTripleChecker+Unchecked, 5410 mSDsCounter, 650 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6146 IncrementalHoareTripleChecker+Invalid, 6964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 650 mSolverCounterUnsat, 1496 mSDtfsCounter, 6146 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1607 GetRequests, 1091 SyntacticMatches, 8 SemanticMatches, 508 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3096 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred in iteration=16, InterpolantAutomatonStates: 277, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 622 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 1883 NumberOfCodeBlocks, 1883 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2028 ConstructedInterpolants, 119 QuantifiedInterpolants, 22243 SizeOfPredicates, 80 NumberOfNonLiveVariables, 5374 ConjunctsInSsa, 412 ConjunctsInUnsatCore, 59 InterpolantComputations, 11 PerfectInterpolantSequences, 400/1020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:42:39,600 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 ../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_2.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 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:42:41,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:42:41,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-30 10:42:41,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:42:41,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:42:41,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:42:41,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:42:41,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:42:41,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:42:41,573 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:42:41,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:42:41,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:42:41,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:42:41,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:42:41,573 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:42:41,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:42:41,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:42:41,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:42:41,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:42:41,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:42:41,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:42:41,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:42:41,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:42:41,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:42:41,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:42:41,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:42:41,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:42:41,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:42:41,575 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-30 10:42:41,575 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-30 10:42:41,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:42:41,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:42:41,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:42:41,575 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2025-04-30 10:42:41,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:42:41,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:42:41,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:42:41,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:42:41,836 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:42:41,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_2.i [2025-04-30 10:42:43,151 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5912d9e29/422b363b2e7f4b709007c59d3615df02/FLAG5655c1faa [2025-04-30 10:42:43,323 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:42:43,323 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-bftpd/bftpd_2.i [2025-04-30 10:42:43,331 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5912d9e29/422b363b2e7f4b709007c59d3615df02/FLAG5655c1faa [2025-04-30 10:42:44,353 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5912d9e29/422b363b2e7f4b709007c59d3615df02 [2025-04-30 10:42:44,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:42:44,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:42:44,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:42:44,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:42:44,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:42:44,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed6cbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44, skipping insertion in model container [2025-04-30 10:42:44,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:42:44,619 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:42:44,626 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:42:44,639 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:42:44,700 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:42:44,735 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:42:44,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44 WrapperNode [2025-04-30 10:42:44,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:42:44,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:42:44,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:42:44,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:42:44,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,784 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 93 [2025-04-30 10:42:44,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:42:44,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:42:44,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:42:44,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:42:44,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,815 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-04-30 10:42:44,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:42:44,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:42:44,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:42:44,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:42:44,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (1/1) ... [2025-04-30 10:42:44,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:42:44,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:44,873 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-04-30 10:42:44,875 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-04-30 10:42:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-04-30 10:42:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-04-30 10:42:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-04-30 10:42:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-04-30 10:42:44,897 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-04-30 10:42:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:42:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:42:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:42:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:42:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:42:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:42:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:42:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:42:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:42:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-04-30 10:42:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-04-30 10:42:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-04-30 10:42:44,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:42:44,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:42:45,001 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:42:45,003 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:42:45,253 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-04-30 10:42:45,253 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:42:45,261 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:42:45,261 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:42:45,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:42:45 BoogieIcfgContainer [2025-04-30 10:42:45,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:42:45,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:42:45,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:42:45,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:42:45,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:42:44" (1/3) ... [2025-04-30 10:42:45,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd6d576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:42:45, skipping insertion in model container [2025-04-30 10:42:45,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:44" (2/3) ... [2025-04-30 10:42:45,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd6d576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:42:45, skipping insertion in model container [2025-04-30 10:42:45,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:42:45" (3/3) ... [2025-04-30 10:42:45,271 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2025-04-30 10:42:45,282 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:42:45,284 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.i that has 2 procedures, 61 locations, 72 edges, 1 initial locations, 1 loop locations, and 20 error locations. [2025-04-30 10:42:45,315 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:42:45,326 INFO L340 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;@5b993d57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:42:45,326 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-30 10:42:45,329 INFO L278 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:42:45,334 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:42:45,334 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:45,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:42:45,335 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:45,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash -920361850, now seen corresponding path program 1 times [2025-04-30 10:42:45,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:45,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299569717] [2025-04-30 10:42:45,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:45,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:45,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:45,367 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-04-30 10:42:45,369 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-04-30 10:42:45,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:42:45,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:42:45,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:45,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:45,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:42:45,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:45,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:45,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:45,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299569717] [2025-04-30 10:42:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299569717] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:45,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:45,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:42:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973047607] [2025-04-30 10:42:45,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:45,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:45,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:45,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:45,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:45,575 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:45,725 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2025-04-30 10:42:45,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:45,727 INFO L79 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-04-30 10:42:45,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:45,734 INFO L225 Difference]: With dead ends: 110 [2025-04-30 10:42:45,735 INFO L226 Difference]: Without dead ends: 106 [2025-04-30 10:42:45,736 INFO L436 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-04-30 10:42:45,739 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 52 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:45,741 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 101 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-30 10:42:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2025-04-30 10:42:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 76 states have internal predecessors, (97), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-30 10:42:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2025-04-30 10:42:45,777 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 6 [2025-04-30 10:42:45,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:45,777 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2025-04-30 10:42:45,777 INFO L486 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-04-30 10:42:45,777 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2025-04-30 10:42:45,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:42:45,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:45,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:42:45,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:42:45,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:45,983 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:45,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash -920361849, now seen corresponding path program 1 times [2025-04-30 10:42:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:45,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251375592] [2025-04-30 10:42:45,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:45,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:45,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:45,986 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-04-30 10:42:45,987 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-04-30 10:42:46,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:42:46,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:42:46,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:46,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:46,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:42:46,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:46,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:46,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:46,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251375592] [2025-04-30 10:42:46,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251375592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:46,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:46,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:42:46,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330879713] [2025-04-30 10:42:46,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:46,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:42:46,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:46,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:42:46,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:42:46,151 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:46,277 INFO L93 Difference]: Finished difference Result 180 states and 242 transitions. [2025-04-30 10:42:46,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:42:46,277 INFO L79 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-04-30 10:42:46,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:46,279 INFO L225 Difference]: With dead ends: 180 [2025-04-30 10:42:46,279 INFO L226 Difference]: Without dead ends: 180 [2025-04-30 10:42:46,279 INFO L436 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-04-30 10:42:46,279 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 86 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:46,280 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 139 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-04-30 10:42:46,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2025-04-30 10:42:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.7394957983193278) internal successors, (207), 138 states have internal predecessors, (207), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-30 10:42:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 238 transitions. [2025-04-30 10:42:46,320 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 238 transitions. Word has length 6 [2025-04-30 10:42:46,320 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:46,320 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 238 transitions. [2025-04-30 10:42:46,320 INFO L486 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-04-30 10:42:46,320 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 238 transitions. [2025-04-30 10:42:46,320 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:42:46,320 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:46,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:46,329 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-04-30 10:42:46,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:46,527 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:46,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1533553699, now seen corresponding path program 1 times [2025-04-30 10:42:46,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:46,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2077717629] [2025-04-30 10:42:46,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:46,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:46,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:46,530 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-04-30 10:42:46,531 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-04-30 10:42:46,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:42:46,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:42:46,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:46,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:46,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:42:46,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:46,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:46,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:46,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077717629] [2025-04-30 10:42:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077717629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865120446] [2025-04-30 10:42:46,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:46,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:46,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:46,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:46,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:46,702 INFO L87 Difference]: Start difference. First operand 152 states and 238 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:46,866 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-04-30 10:42:46,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:46,867 INFO L79 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-04-30 10:42:46,867 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:46,869 INFO L225 Difference]: With dead ends: 192 [2025-04-30 10:42:46,869 INFO L226 Difference]: Without dead ends: 192 [2025-04-30 10:42:46,869 INFO L436 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-04-30 10:42:46,869 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 80 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:46,869 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 159 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-30 10:42:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 155. [2025-04-30 10:42:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.721311475409836) internal successors, (210), 141 states have internal predecessors, (210), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-30 10:42:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 241 transitions. [2025-04-30 10:42:46,887 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 241 transitions. Word has length 7 [2025-04-30 10:42:46,887 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:46,888 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 241 transitions. [2025-04-30 10:42:46,888 INFO L486 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-04-30 10:42:46,888 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2025-04-30 10:42:46,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:42:46,888 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:46,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:46,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:42:47,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:47,089 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:47,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:47,089 INFO L85 PathProgramCache]: Analyzing trace with hash 295524454, now seen corresponding path program 1 times [2025-04-30 10:42:47,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:47,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181291353] [2025-04-30 10:42:47,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:47,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:47,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:47,092 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-04-30 10:42:47,093 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-04-30 10:42:47,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:42:47,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:42:47,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:47,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:47,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:42:47,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:47,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:47,288 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:47,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181291353] [2025-04-30 10:42:47,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181291353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:47,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:47,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:47,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520468327] [2025-04-30 10:42:47,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:47,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:47,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:47,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:47,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:47,291 INFO L87 Difference]: Start difference. First operand 155 states and 241 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:47,447 INFO L93 Difference]: Finished difference Result 182 states and 243 transitions. [2025-04-30 10:42:47,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:47,448 INFO L79 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-04-30 10:42:47,448 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:47,449 INFO L225 Difference]: With dead ends: 182 [2025-04-30 10:42:47,450 INFO L226 Difference]: Without dead ends: 182 [2025-04-30 10:42:47,450 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:42:47,451 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 68 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:47,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 205 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-30 10:42:47,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 155. [2025-04-30 10:42:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.7049180327868851) internal successors, (208), 141 states have internal predecessors, (208), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-30 10:42:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2025-04-30 10:42:47,469 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 8 [2025-04-30 10:42:47,469 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:47,469 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2025-04-30 10:42:47,469 INFO L486 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-04-30 10:42:47,469 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2025-04-30 10:42:47,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:42:47,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:47,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:47,478 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-04-30 10:42:47,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:47,670 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:47,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:47,671 INFO L85 PathProgramCache]: Analyzing trace with hash 571323525, now seen corresponding path program 1 times [2025-04-30 10:42:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:47,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357940166] [2025-04-30 10:42:47,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:47,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:47,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:47,673 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-04-30 10:42:47,674 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-04-30 10:42:47,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:42:47,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:42:47,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:47,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:47,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:42:47,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:47,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:47,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:47,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357940166] [2025-04-30 10:42:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357940166] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:47,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:47,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:47,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508003676] [2025-04-30 10:42:47,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:47,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:47,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:47,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:47,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:47,775 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:47,897 INFO L93 Difference]: Finished difference Result 234 states and 321 transitions. [2025-04-30 10:42:47,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:47,897 INFO L79 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-04-30 10:42:47,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:47,898 INFO L225 Difference]: With dead ends: 234 [2025-04-30 10:42:47,898 INFO L226 Difference]: Without dead ends: 234 [2025-04-30 10:42:47,898 INFO L436 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-04-30 10:42:47,899 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 172 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:47,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 170 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-04-30 10:42:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 191. [2025-04-30 10:42:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.6538461538461537) internal successors, (258), 176 states have internal predecessors, (258), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-30 10:42:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 289 transitions. [2025-04-30 10:42:47,910 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 289 transitions. Word has length 9 [2025-04-30 10:42:47,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:47,910 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 289 transitions. [2025-04-30 10:42:47,910 INFO L486 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-04-30 10:42:47,910 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 289 transitions. [2025-04-30 10:42:47,910 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:42:47,910 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:47,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:47,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:42:48,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:48,111 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:48,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash 531160136, now seen corresponding path program 1 times [2025-04-30 10:42:48,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:48,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1239549108] [2025-04-30 10:42:48,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:48,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:48,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:48,113 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-04-30 10:42:48,114 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-04-30 10:42:48,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:42:48,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:42:48,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:48,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:48,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:42:48,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:48,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:48,236 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:48,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239549108] [2025-04-30 10:42:48,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239549108] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:48,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:48,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:48,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165483798] [2025-04-30 10:42:48,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:48,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:48,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:48,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:48,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:48,237 INFO L87 Difference]: Start difference. First operand 191 states and 289 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:48,371 INFO L93 Difference]: Finished difference Result 231 states and 304 transitions. [2025-04-30 10:42:48,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:48,371 INFO L79 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-04-30 10:42:48,372 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:48,374 INFO L225 Difference]: With dead ends: 231 [2025-04-30 10:42:48,374 INFO L226 Difference]: Without dead ends: 231 [2025-04-30 10:42:48,374 INFO L436 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-04-30 10:42:48,374 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:48,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 204 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:48,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-04-30 10:42:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 201. [2025-04-30 10:42:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 165 states have (on average 1.6424242424242423) internal successors, (271), 186 states have internal predecessors, (271), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-30 10:42:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2025-04-30 10:42:48,384 INFO L79 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 10 [2025-04-30 10:42:48,384 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:48,384 INFO L485 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2025-04-30 10:42:48,384 INFO L486 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-04-30 10:42:48,385 INFO L278 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2025-04-30 10:42:48,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:42:48,385 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:48,385 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:48,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:42:48,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:48,586 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:48,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:48,586 INFO L85 PathProgramCache]: Analyzing trace with hash 738472334, now seen corresponding path program 1 times [2025-04-30 10:42:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:48,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809074363] [2025-04-30 10:42:48,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:48,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:48,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:48,589 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-04-30 10:42:48,589 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-04-30 10:42:48,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:42:48,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:42:48,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:48,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:48,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:42:48,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:48,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:48,955 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:48,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809074363] [2025-04-30 10:42:48,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809074363] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:48,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:48,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-04-30 10:42:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935832253] [2025-04-30 10:42:48,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:48,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:42:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:48,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:42:48,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:42:48,957 INFO L87 Difference]: Start difference. First operand 201 states and 302 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:49,263 INFO L93 Difference]: Finished difference Result 269 states and 359 transitions. [2025-04-30 10:42:49,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:42:49,264 INFO L79 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-04-30 10:42:49,264 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:49,265 INFO L225 Difference]: With dead ends: 269 [2025-04-30 10:42:49,265 INFO L226 Difference]: Without dead ends: 269 [2025-04-30 10:42:49,265 INFO L436 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-04-30 10:42:49,266 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 132 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:49,266 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 321 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:42:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-04-30 10:42:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2025-04-30 10:42:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 195 states have (on average 1.6358974358974359) internal successors, (319), 216 states have internal predecessors, (319), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-30 10:42:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 350 transitions. [2025-04-30 10:42:49,276 INFO L79 Accepts]: Start accepts. Automaton has 231 states and 350 transitions. Word has length 14 [2025-04-30 10:42:49,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:49,276 INFO L485 AbstractCegarLoop]: Abstraction has 231 states and 350 transitions. [2025-04-30 10:42:49,276 INFO L486 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-04-30 10:42:49,276 INFO L278 IsEmpty]: Start isEmpty. Operand 231 states and 350 transitions. [2025-04-30 10:42:49,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:42:49,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:49,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:49,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:42:49,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:49,478 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:49,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1417805820, now seen corresponding path program 1 times [2025-04-30 10:42:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:49,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038269987] [2025-04-30 10:42:49,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:49,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:49,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:49,481 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-04-30 10:42:49,482 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-04-30 10:42:49,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:42:49,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:42:49,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:49,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:49,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:42:49,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:49,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:50,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:50,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038269987] [2025-04-30 10:42:50,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038269987] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:50,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:50,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-04-30 10:42:50,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854105628] [2025-04-30 10:42:50,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:50,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:42:50,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:50,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:42:50,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:42:50,067 INFO L87 Difference]: Start difference. First operand 231 states and 350 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:51,227 INFO L93 Difference]: Finished difference Result 353 states and 485 transitions. [2025-04-30 10:42:51,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:42:51,227 INFO L79 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-04-30 10:42:51,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:51,229 INFO L225 Difference]: With dead ends: 353 [2025-04-30 10:42:51,229 INFO L226 Difference]: Without dead ends: 353 [2025-04-30 10:42:51,229 INFO L436 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-04-30 10:42:51,230 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 324 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:51,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 315 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:42:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-04-30 10:42:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 269. [2025-04-30 10:42:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 233 states have (on average 1.6351931330472103) internal successors, (381), 254 states have internal predecessors, (381), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2025-04-30 10:42:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 412 transitions. [2025-04-30 10:42:51,237 INFO L79 Accepts]: Start accepts. Automaton has 269 states and 412 transitions. Word has length 15 [2025-04-30 10:42:51,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:51,237 INFO L485 AbstractCegarLoop]: Abstraction has 269 states and 412 transitions. [2025-04-30 10:42:51,237 INFO L486 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-04-30 10:42:51,238 INFO L278 IsEmpty]: Start isEmpty. Operand 269 states and 412 transitions. [2025-04-30 10:42:51,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:42:51,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:51,238 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:51,244 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-04-30 10:42:51,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:51,439 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:51,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1002307501, now seen corresponding path program 1 times [2025-04-30 10:42:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:51,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890797334] [2025-04-30 10:42:51,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:51,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:51,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:51,441 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-04-30 10:42:51,442 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-04-30 10:42:51,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:42:51,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:42:51,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:51,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:51,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:42:51,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:51,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:52,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:52,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890797334] [2025-04-30 10:42:52,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890797334] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:52,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:52,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-04-30 10:42:52,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442759255] [2025-04-30 10:42:52,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:52,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:42:52,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:52,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:42:52,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:42:52,039 INFO L87 Difference]: Start difference. First operand 269 states and 412 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:53,157 INFO L93 Difference]: Finished difference Result 492 states and 681 transitions. [2025-04-30 10:42:53,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:42:53,158 INFO L79 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-04-30 10:42:53,158 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:53,160 INFO L225 Difference]: With dead ends: 492 [2025-04-30 10:42:53,160 INFO L226 Difference]: Without dead ends: 492 [2025-04-30 10:42:53,160 INFO L436 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-04-30 10:42:53,160 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 369 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:53,161 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 341 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:42:53,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-04-30 10:42:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 371. [2025-04-30 10:42:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 331 states have (on average 1.6676737160120847) internal successors, (552), 352 states have internal predecessors, (552), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-04-30 10:42:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 594 transitions. [2025-04-30 10:42:53,173 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 594 transitions. Word has length 16 [2025-04-30 10:42:53,173 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:53,173 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 594 transitions. [2025-04-30 10:42:53,174 INFO L486 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-04-30 10:42:53,174 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 594 transitions. [2025-04-30 10:42:53,174 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:42:53,174 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:53,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:53,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:42:53,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:53,375 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:53,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:53,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1943920271, now seen corresponding path program 1 times [2025-04-30 10:42:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:53,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546042896] [2025-04-30 10:42:53,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:53,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:53,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:53,378 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-04-30 10:42:53,379 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-04-30 10:42:53,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:42:53,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:42:53,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:53,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:53,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-30 10:42:53,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:53,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:53,431 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:53,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546042896] [2025-04-30 10:42:53,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546042896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:53,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:53,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:42:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851809249] [2025-04-30 10:42:53,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:53,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:53,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:53,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:53,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:53,432 INFO L87 Difference]: Start difference. First operand 371 states and 594 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:53,442 INFO L93 Difference]: Finished difference Result 370 states and 590 transitions. [2025-04-30 10:42:53,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:53,444 INFO L79 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-04-30 10:42:53,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:53,445 INFO L225 Difference]: With dead ends: 370 [2025-04-30 10:42:53,445 INFO L226 Difference]: Without dead ends: 370 [2025-04-30 10:42:53,445 INFO L436 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-04-30 10:42:53,445 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:53,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-30 10:42:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-04-30 10:42:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 331 states have (on average 1.6555891238670695) internal successors, (548), 351 states have internal predecessors, (548), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-04-30 10:42:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 590 transitions. [2025-04-30 10:42:53,460 INFO L79 Accepts]: Start accepts. Automaton has 370 states and 590 transitions. Word has length 18 [2025-04-30 10:42:53,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:53,460 INFO L485 AbstractCegarLoop]: Abstraction has 370 states and 590 transitions. [2025-04-30 10:42:53,460 INFO L486 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-04-30 10:42:53,460 INFO L278 IsEmpty]: Start isEmpty. Operand 370 states and 590 transitions. [2025-04-30 10:42:53,461 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:42:53,461 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:53,461 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-04-30 10:42:53,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:42:53,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:53,661 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:53,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 132632823, now seen corresponding path program 1 times [2025-04-30 10:42:53,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:53,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370033613] [2025-04-30 10:42:53,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:53,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:53,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:53,664 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-04-30 10:42:53,665 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-04-30 10:42:53,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:42:53,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:42:53,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:53,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:53,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:42:53,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:53,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:53,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:53,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370033613] [2025-04-30 10:42:53,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370033613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:53,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:53,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:42:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053001406] [2025-04-30 10:42:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:53,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:53,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:53,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:53,738 INFO L87 Difference]: Start difference. First operand 370 states and 590 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:53,757 INFO L93 Difference]: Finished difference Result 512 states and 817 transitions. [2025-04-30 10:42:53,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:53,758 INFO L79 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-04-30 10:42:53,758 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:53,759 INFO L225 Difference]: With dead ends: 512 [2025-04-30 10:42:53,760 INFO L226 Difference]: Without dead ends: 512 [2025-04-30 10:42:53,760 INFO L436 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-04-30 10:42:53,760 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:53,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 112 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-04-30 10:42:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 497. [2025-04-30 10:42:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 449 states have (on average 1.6547884187082404) internal successors, (743), 471 states have internal predecessors, (743), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (57), 15 states have call predecessors, (57), 15 states have call successors, (57) [2025-04-30 10:42:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 815 transitions. [2025-04-30 10:42:53,775 INFO L79 Accepts]: Start accepts. Automaton has 497 states and 815 transitions. Word has length 19 [2025-04-30 10:42:53,775 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:53,775 INFO L485 AbstractCegarLoop]: Abstraction has 497 states and 815 transitions. [2025-04-30 10:42:53,775 INFO L486 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-04-30 10:42:53,775 INFO L278 IsEmpty]: Start isEmpty. Operand 497 states and 815 transitions. [2025-04-30 10:42:53,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:42:53,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:53,775 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-04-30 10:42:53,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:42:53,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:53,976 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:53,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash 131986327, now seen corresponding path program 1 times [2025-04-30 10:42:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:53,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [74274592] [2025-04-30 10:42:53,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:53,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:53,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:53,978 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-04-30 10:42:53,979 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-04-30 10:42:54,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:42:54,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:42:54,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:54,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:54,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:42:54,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:54,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:54,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:54,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74274592] [2025-04-30 10:42:54,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74274592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:54,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:54,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:54,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822302994] [2025-04-30 10:42:54,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:54,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:54,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:54,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:54,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:54,046 INFO L87 Difference]: Start difference. First operand 497 states and 815 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:54,052 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2025-04-30 10:42:54,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:54,053 INFO L79 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-04-30 10:42:54,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:54,054 INFO L225 Difference]: With dead ends: 356 [2025-04-30 10:42:54,054 INFO L226 Difference]: Without dead ends: 356 [2025-04-30 10:42:54,055 INFO L436 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-04-30 10:42:54,055 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:54,055 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-04-30 10:42:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-04-30 10:42:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 320 states have (on average 1.58125) internal successors, (506), 335 states have internal predecessors, (506), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-04-30 10:42:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 554 transitions. [2025-04-30 10:42:54,067 INFO L79 Accepts]: Start accepts. Automaton has 356 states and 554 transitions. Word has length 19 [2025-04-30 10:42:54,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:54,067 INFO L485 AbstractCegarLoop]: Abstraction has 356 states and 554 transitions. [2025-04-30 10:42:54,067 INFO L486 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-04-30 10:42:54,067 INFO L278 IsEmpty]: Start isEmpty. Operand 356 states and 554 transitions. [2025-04-30 10:42:54,069 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:42:54,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:54,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:54,078 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-04-30 10:42:54,273 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:54,273 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:54,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash -183349689, now seen corresponding path program 1 times [2025-04-30 10:42:54,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:54,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874609395] [2025-04-30 10:42:54,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:54,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:54,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:54,277 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-04-30 10:42:54,278 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-04-30 10:42:54,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:42:54,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:42:54,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:54,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:54,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:42:54,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:54,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:54,362 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:54,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874609395] [2025-04-30 10:42:54,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874609395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:54,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:54,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:54,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722164575] [2025-04-30 10:42:54,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:54,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:42:54,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:54,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:42:54,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:42:54,362 INFO L87 Difference]: Start difference. First operand 356 states and 554 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:54,385 INFO L93 Difference]: Finished difference Result 328 states and 476 transitions. [2025-04-30 10:42:54,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:54,385 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-30 10:42:54,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:54,386 INFO L225 Difference]: With dead ends: 328 [2025-04-30 10:42:54,386 INFO L226 Difference]: Without dead ends: 326 [2025-04-30 10:42:54,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:54,387 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:54,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-04-30 10:42:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 315. [2025-04-30 10:42:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 282 states have (on average 1.5390070921985815) internal successors, (434), 297 states have internal predecessors, (434), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-04-30 10:42:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 470 transitions. [2025-04-30 10:42:54,394 INFO L79 Accepts]: Start accepts. Automaton has 315 states and 470 transitions. Word has length 20 [2025-04-30 10:42:54,394 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:54,394 INFO L485 AbstractCegarLoop]: Abstraction has 315 states and 470 transitions. [2025-04-30 10:42:54,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:54,394 INFO L278 IsEmpty]: Start isEmpty. Operand 315 states and 470 transitions. [2025-04-30 10:42:54,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:42:54,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:54,395 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-30 10:42:54,402 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-04-30 10:42:54,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:54,596 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:54,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash 447088533, now seen corresponding path program 2 times [2025-04-30 10:42:54,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:54,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718549014] [2025-04-30 10:42:54,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:42:54,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:54,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:54,598 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-04-30 10:42:54,600 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-04-30 10:42:54,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-30 10:42:54,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:42:54,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:42:54,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:54,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:42:54,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:54,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:54,710 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:54,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718549014] [2025-04-30 10:42:54,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718549014] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:54,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:42:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-04-30 10:42:54,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037168406] [2025-04-30 10:42:54,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:54,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:42:54,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:54,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:42:54,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:42:54,711 INFO L87 Difference]: Start difference. First operand 315 states and 470 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:54,776 INFO L93 Difference]: Finished difference Result 282 states and 393 transitions. [2025-04-30 10:42:54,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:54,777 INFO L79 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-04-30 10:42:54,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:54,778 INFO L225 Difference]: With dead ends: 282 [2025-04-30 10:42:54,778 INFO L226 Difference]: Without dead ends: 282 [2025-04-30 10:42:54,778 INFO L436 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-04-30 10:42:54,779 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:54,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 252 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-04-30 10:42:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2025-04-30 10:42:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 235 states have (on average 1.4638297872340424) internal successors, (344), 250 states have internal predecessors, (344), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-04-30 10:42:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 380 transitions. [2025-04-30 10:42:54,785 INFO L79 Accepts]: Start accepts. Automaton has 268 states and 380 transitions. Word has length 22 [2025-04-30 10:42:54,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:54,785 INFO L485 AbstractCegarLoop]: Abstraction has 268 states and 380 transitions. [2025-04-30 10:42:54,785 INFO L486 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-04-30 10:42:54,785 INFO L278 IsEmpty]: Start isEmpty. Operand 268 states and 380 transitions. [2025-04-30 10:42:54,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:42:54,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:54,786 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-04-30 10:42:54,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:42:54,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:54,987 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:54,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2036164058, now seen corresponding path program 1 times [2025-04-30 10:42:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:54,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512414148] [2025-04-30 10:42:54,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:54,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:54,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:54,989 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-04-30 10:42:54,990 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-04-30 10:42:55,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:42:55,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:42:55,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:55,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:55,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-30 10:42:55,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:55,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:42:55,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:42:55,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512414148] [2025-04-30 10:42:55,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512414148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:55,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:55,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453652041] [2025-04-30 10:42:55,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:55,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:55,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:42:55,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:55,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:55,047 INFO L87 Difference]: Start difference. First operand 268 states and 380 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:42:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:55,057 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2025-04-30 10:42:55,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:55,058 INFO L79 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-04-30 10:42:55,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:55,059 INFO L225 Difference]: With dead ends: 197 [2025-04-30 10:42:55,059 INFO L226 Difference]: Without dead ends: 197 [2025-04-30 10:42:55,059 INFO L436 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-04-30 10:42:55,059 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:55,059 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-04-30 10:42:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-04-30 10:42:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 170 states have (on average 1.4294117647058824) internal successors, (243), 184 states have internal predecessors, (243), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2025-04-30 10:42:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 265 transitions. [2025-04-30 10:42:55,065 INFO L79 Accepts]: Start accepts. Automaton has 197 states and 265 transitions. Word has length 25 [2025-04-30 10:42:55,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:55,065 INFO L485 AbstractCegarLoop]: Abstraction has 197 states and 265 transitions. [2025-04-30 10:42:55,066 INFO L486 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-04-30 10:42:55,066 INFO L278 IsEmpty]: Start isEmpty. Operand 197 states and 265 transitions. [2025-04-30 10:42:55,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:42:55,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:55,066 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-04-30 10:42:55,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-30 10:42:55,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:55,267 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:42:55,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:55,267 INFO L85 PathProgramCache]: Analyzing trace with hash -72255190, now seen corresponding path program 1 times [2025-04-30 10:42:55,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:42:55,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267698799] [2025-04-30 10:42:55,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:55,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:55,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:55,269 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-04-30 10:42:55,270 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-04-30 10:42:55,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:42:55,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:42:55,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:55,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:55,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:42:55,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:55,466 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-30 10:42:55,467 INFO L354 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-04-30 10:42:55,563 INFO L354 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-04-30 10:42:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:55,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:55,727 INFO L325 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-04-30 10:42:55,727 INFO L354 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-04-30 10:43:00,177 INFO L325 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-04-30 10:43:00,177 INFO L354 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-04-30 10:43:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:00,292 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:43:00,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267698799] [2025-04-30 10:43:00,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267698799] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:00,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:43:00,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2025-04-30 10:43:00,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651056485] [2025-04-30 10:43:00,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:00,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:43:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:43:00,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:43:00,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=3, NotChecked=0, Total=110 [2025-04-30 10:43:00,294 INFO L87 Difference]: Start difference. First operand 197 states and 265 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:04,307 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:43:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:06,848 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2025-04-30 10:43:06,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:43:06,849 INFO L79 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-04-30 10:43:06,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:06,849 INFO L225 Difference]: With dead ends: 220 [2025-04-30 10:43:06,849 INFO L226 Difference]: Without dead ends: 220 [2025-04-30 10:43:06,850 INFO L436 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-04-30 10:43:06,850 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 156 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 33 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:06,850 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 77 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 92 Invalid, 10 Unknown, 0 Unchecked, 5.5s Time] [2025-04-30 10:43:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-04-30 10:43:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 208. [2025-04-30 10:43:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 195 states have internal predecessors, (241), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2025-04-30 10:43:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 265 transitions. [2025-04-30 10:43:06,855 INFO L79 Accepts]: Start accepts. Automaton has 208 states and 265 transitions. Word has length 27 [2025-04-30 10:43:06,855 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:06,855 INFO L485 AbstractCegarLoop]: Abstraction has 208 states and 265 transitions. [2025-04-30 10:43:06,856 INFO L486 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-04-30 10:43:06,856 INFO L278 IsEmpty]: Start isEmpty. Operand 208 states and 265 transitions. [2025-04-30 10:43:06,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:43:06,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:06,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:06,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-30 10:43:07,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:07,058 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:43:07,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1506398064, now seen corresponding path program 1 times [2025-04-30 10:43:07,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:43:07,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315270715] [2025-04-30 10:43:07,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:07,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:07,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:07,062 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-04-30 10:43:07,063 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-04-30 10:43:07,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:43:07,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:43:07,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:07,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:07,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:43:07,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:07,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:08,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:43:08,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315270715] [2025-04-30 10:43:08,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315270715] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:08,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:43:08,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-04-30 10:43:08,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506148018] [2025-04-30 10:43:08,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:08,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:43:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:43:08,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:43:08,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:43:08,406 INFO L87 Difference]: Start difference. First operand 208 states and 265 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:09,704 INFO L93 Difference]: Finished difference Result 313 states and 367 transitions. [2025-04-30 10:43:09,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:43:09,704 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-04-30 10:43:09,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:09,705 INFO L225 Difference]: With dead ends: 313 [2025-04-30 10:43:09,705 INFO L226 Difference]: Without dead ends: 313 [2025-04-30 10:43:09,706 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:43:09,706 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 216 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:09,706 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 213 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-30 10:43:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-04-30 10:43:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 280. [2025-04-30 10:43:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 250 states have (on average 1.296) internal successors, (324), 265 states have internal predecessors, (324), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-04-30 10:43:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 347 transitions. [2025-04-30 10:43:09,711 INFO L79 Accepts]: Start accepts. Automaton has 280 states and 347 transitions. Word has length 28 [2025-04-30 10:43:09,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:09,711 INFO L485 AbstractCegarLoop]: Abstraction has 280 states and 347 transitions. [2025-04-30 10:43:09,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:09,711 INFO L278 IsEmpty]: Start isEmpty. Operand 280 states and 347 transitions. [2025-04-30 10:43:09,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:43:09,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:09,711 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-04-30 10:43:09,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-30 10:43:09,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:09,913 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-30 10:43:09,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash -717762487, now seen corresponding path program 1 times [2025-04-30 10:43:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:43:09,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610214504] [2025-04-30 10:43:09,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:09,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:09,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:09,915 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-04-30 10:43:09,916 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-04-30 10:43:09,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:43:09,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:43:09,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:09,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:09,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:43:09,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:11,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:11,583 INFO L354 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-04-30 10:43:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:12,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:17,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:43:17,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610214504] [2025-04-30 10:43:17,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610214504] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:17,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [273212427] [2025-04-30 10:43:17,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:17,032 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-04-30 10:43:17,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-04-30 10:43:17,034 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-04-30 10:43:17,035 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-04-30 10:43:17,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:43:17,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:43:17,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:17,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:17,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:43:17,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... Killed by 15