./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_3.c --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_3.c -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 ad9008297d469fdf1b53895572d7ca26f03d4a3ba390cb2ca57d3d5734b41bc4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:22:35,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:22:35,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:22:35,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:22:35,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:22:35,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:22:35,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:22:35,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:22:35,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:22:35,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:22:35,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:22:35,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:22:35,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:22:35,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:22:35,848 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:22:35,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:22:35,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:22:35,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:22:35,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:22:35,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:35,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:35,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:35,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:22:35,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:22:35,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:22:35,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:22:35,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:22:35,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:22:35,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:22:35,851 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 -> ad9008297d469fdf1b53895572d7ca26f03d4a3ba390cb2ca57d3d5734b41bc4 [2025-04-29 11:22:36,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:22:36,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:22:36,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:22:36,079 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:22:36,080 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:22:36,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_3.c [2025-04-29 11:22:37,312 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/552b7155a/8c8584566a414def92e44239332428f0/FLAG3c84cd565 [2025-04-29 11:22:37,542 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:22:37,543 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-bftpd/bftpd_3.c [2025-04-29 11:22:37,544 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:37,544 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:37,548 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/552b7155a/8c8584566a414def92e44239332428f0/FLAG3c84cd565 [2025-04-29 11:22:38,310 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/552b7155a/8c8584566a414def92e44239332428f0 [2025-04-29 11:22:38,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:22:38,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:22:38,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:38,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:22:38,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:22:38,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c216120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38, skipping insertion in model container [2025-04-29 11:22:38,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:22:38,453 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-29 11:22:38,457 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:38,469 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:22:38,491 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:38,505 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:22:38,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38 WrapperNode [2025-04-29 11:22:38,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:38,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:38,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:22:38,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:22:38,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,539 INFO L138 Inliner]: procedures = 16, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-04-29 11:22:38,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:38,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:22:38,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:22:38,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:22:38,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,566 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 9, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-04-29 11:22:38,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:22:38,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:22:38,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:22:38,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:22:38,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (1/1) ... [2025-04-29 11:22:38,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:38,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:38,621 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-29 11:22:38,623 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-29 11:22:38,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:22:38,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:22:38,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:22:38,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:22:38,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:22:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:22:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:22:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:22:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:22:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:22:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-04-29 11:22:38,645 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-04-29 11:22:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:22:38,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:22:38,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:22:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:22:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:22:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:22:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:22:38,731 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:22:38,732 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:22:38,875 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-04-29 11:22:38,876 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:22:38,884 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:22:38,884 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:22:38,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:38 BoogieIcfgContainer [2025-04-29 11:22:38,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:22:38,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:22:38,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:22:38,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:22:38,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:22:38" (1/3) ... [2025-04-29 11:22:38,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613bdb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:38, skipping insertion in model container [2025-04-29 11:22:38,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:38" (2/3) ... [2025-04-29 11:22:38,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613bdb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:22:38, skipping insertion in model container [2025-04-29 11:22:38,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:38" (3/3) ... [2025-04-29 11:22:38,891 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_3.c [2025-04-29 11:22:38,900 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:22:38,901 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_3.c that has 2 procedures, 61 locations, 72 edges, 1 initial locations, 1 loop locations, and 20 error locations. [2025-04-29 11:22:38,925 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:22:38,933 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;@5012f58b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:22:38,933 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-29 11:22:38,935 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-29 11:22:38,942 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:38,942 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:38,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:38,943 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-29 11:22:38,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash -920361850, now seen corresponding path program 1 times [2025-04-29 11:22:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:38,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266643832] [2025-04-29 11:22:38,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:38,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:39,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:39,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:39,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:39,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:39,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:39,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266643832] [2025-04-29 11:22:39,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266643832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:39,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:39,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:22:39,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119591905] [2025-04-29 11:22:39,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:39,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:39,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:39,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:39,194 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-29 11:22:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:39,312 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2025-04-29 11:22:39,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:39,313 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-29 11:22:39,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:39,319 INFO L225 Difference]: With dead ends: 120 [2025-04-29 11:22:39,319 INFO L226 Difference]: Without dead ends: 114 [2025-04-29 11:22:39,320 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-29 11:22:39,323 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 145 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 104 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-29 11:22:39,324 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 104 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-04-29 11:22:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2025-04-29 11:22:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.65) internal successors, (99), 77 states have internal predecessors, (99), 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-29 11:22:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2025-04-29 11:22:39,362 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 6 [2025-04-29 11:22:39,363 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:39,363 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2025-04-29 11:22:39,363 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-29 11:22:39,363 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2025-04-29 11:22:39,364 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:22:39,364 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:39,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:22:39,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:22:39,365 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-29 11:22:39,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:39,365 INFO L85 PathProgramCache]: Analyzing trace with hash -920361849, now seen corresponding path program 1 times [2025-04-29 11:22:39,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:39,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404322770] [2025-04-29 11:22:39,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:39,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:22:39,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:22:39,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:39,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:39,505 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-29 11:22:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:39,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404322770] [2025-04-29 11:22:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404322770] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:39,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:39,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4535647] [2025-04-29 11:22:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:39,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:39,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:39,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:39,507 INFO L87 Difference]: Start difference. First operand 87 states and 117 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-29 11:22:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:39,620 INFO L93 Difference]: Finished difference Result 186 states and 250 transitions. [2025-04-29 11:22:39,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:39,620 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-29 11:22:39,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:39,622 INFO L225 Difference]: With dead ends: 186 [2025-04-29 11:22:39,623 INFO L226 Difference]: Without dead ends: 186 [2025-04-29 11:22:39,623 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-29 11:22:39,624 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 153 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:39,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 140 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-04-29 11:22:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 160. [2025-04-29 11:22:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 126 states have (on average 1.6666666666666667) internal successors, (210), 143 states have internal predecessors, (210), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-04-29 11:22:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 246 transitions. [2025-04-29 11:22:39,644 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 246 transitions. Word has length 6 [2025-04-29 11:22:39,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:39,644 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 246 transitions. [2025-04-29 11:22:39,644 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-29 11:22:39,644 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 246 transitions. [2025-04-29 11:22:39,644 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:22:39,644 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:39,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:39,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:22:39,645 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-29 11:22:39,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1533553699, now seen corresponding path program 1 times [2025-04-29 11:22:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:39,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001033415] [2025-04-29 11:22:39,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:39,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:39,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:22:39,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:22:39,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:39,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:39,832 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-29 11:22:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:39,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001033415] [2025-04-29 11:22:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001033415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:39,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126296642] [2025-04-29 11:22:39,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:39,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:39,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:39,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:39,836 INFO L87 Difference]: Start difference. First operand 160 states and 246 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-29 11:22:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:39,951 INFO L93 Difference]: Finished difference Result 205 states and 295 transitions. [2025-04-29 11:22:39,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:39,951 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-29 11:22:39,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:39,953 INFO L225 Difference]: With dead ends: 205 [2025-04-29 11:22:39,955 INFO L226 Difference]: Without dead ends: 205 [2025-04-29 11:22:39,955 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-29 11:22:39,956 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 79 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 158 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-29 11:22:39,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 158 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-04-29 11:22:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2025-04-29 11:22:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 146 states have internal predecessors, (213), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-04-29 11:22:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 249 transitions. [2025-04-29 11:22:39,972 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 249 transitions. Word has length 7 [2025-04-29 11:22:39,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:39,972 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 249 transitions. [2025-04-29 11:22:39,972 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-29 11:22:39,972 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 249 transitions. [2025-04-29 11:22:39,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:22:39,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:39,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:39,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:22:39,972 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-29 11:22:39,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 295524454, now seen corresponding path program 1 times [2025-04-29 11:22:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:39,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423955789] [2025-04-29 11:22:39,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:39,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:22:39,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:22:39,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:39,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:40,154 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-29 11:22:40,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:40,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423955789] [2025-04-29 11:22:40,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423955789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:40,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:40,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:40,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764328004] [2025-04-29 11:22:40,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:40,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:40,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:40,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:40,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:40,156 INFO L87 Difference]: Start difference. First operand 163 states and 249 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-29 11:22:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:40,248 INFO L93 Difference]: Finished difference Result 188 states and 251 transitions. [2025-04-29 11:22:40,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:40,248 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-29 11:22:40,248 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:40,267 INFO L225 Difference]: With dead ends: 188 [2025-04-29 11:22:40,268 INFO L226 Difference]: Without dead ends: 188 [2025-04-29 11:22:40,268 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-29 11:22:40,271 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 69 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 193 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-29 11:22:40,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 193 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-29 11:22:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2025-04-29 11:22:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 146 states have internal predecessors, (211), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-04-29 11:22:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 247 transitions. [2025-04-29 11:22:40,279 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 247 transitions. Word has length 8 [2025-04-29 11:22:40,279 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:40,279 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 247 transitions. [2025-04-29 11:22:40,279 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-29 11:22:40,279 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 247 transitions. [2025-04-29 11:22:40,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:22:40,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:40,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:40,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:22:40,280 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-29 11:22:40,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash 571323525, now seen corresponding path program 1 times [2025-04-29 11:22:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:40,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447151469] [2025-04-29 11:22:40,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:40,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:22:40,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:22:40,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:40,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:40,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:40,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447151469] [2025-04-29 11:22:40,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447151469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:40,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:40,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:40,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652867407] [2025-04-29 11:22:40,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:40,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:40,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:40,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:40,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:40,340 INFO L87 Difference]: Start difference. First operand 163 states and 247 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-29 11:22:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:40,415 INFO L93 Difference]: Finished difference Result 245 states and 337 transitions. [2025-04-29 11:22:40,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:40,415 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-29 11:22:40,415 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:40,416 INFO L225 Difference]: With dead ends: 245 [2025-04-29 11:22:40,416 INFO L226 Difference]: Without dead ends: 245 [2025-04-29 11:22:40,417 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-29 11:22:40,417 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 131 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:40,417 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 175 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-29 11:22:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 196. [2025-04-29 11:22:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.60625) internal successors, (257), 178 states have internal predecessors, (257), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-04-29 11:22:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 293 transitions. [2025-04-29 11:22:40,427 INFO L79 Accepts]: Start accepts. Automaton has 196 states and 293 transitions. Word has length 9 [2025-04-29 11:22:40,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:40,427 INFO L485 AbstractCegarLoop]: Abstraction has 196 states and 293 transitions. [2025-04-29 11:22:40,427 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-29 11:22:40,427 INFO L278 IsEmpty]: Start isEmpty. Operand 196 states and 293 transitions. [2025-04-29 11:22:40,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:22:40,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:40,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:40,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:22:40,427 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-29 11:22:40,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:40,428 INFO L85 PathProgramCache]: Analyzing trace with hash 531160136, now seen corresponding path program 1 times [2025-04-29 11:22:40,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:40,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369155797] [2025-04-29 11:22:40,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:40,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:40,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:22:40,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:22:40,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:40,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:40,515 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-29 11:22:40,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:40,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369155797] [2025-04-29 11:22:40,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369155797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:40,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:40,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:40,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748060384] [2025-04-29 11:22:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:40,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:40,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:40,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:40,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:40,516 INFO L87 Difference]: Start difference. First operand 196 states and 293 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-29 11:22:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:40,588 INFO L93 Difference]: Finished difference Result 244 states and 316 transitions. [2025-04-29 11:22:40,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:40,588 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-29 11:22:40,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:40,589 INFO L225 Difference]: With dead ends: 244 [2025-04-29 11:22:40,589 INFO L226 Difference]: Without dead ends: 244 [2025-04-29 11:22:40,589 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-29 11:22:40,593 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 138 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 208 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-29 11:22:40,593 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 208 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-04-29 11:22:40,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2025-04-29 11:22:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 173 states have (on average 1.606936416184971) internal successors, (278), 192 states have internal predecessors, (278), 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-29 11:22:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 314 transitions. [2025-04-29 11:22:40,602 INFO L79 Accepts]: Start accepts. Automaton has 210 states and 314 transitions. Word has length 10 [2025-04-29 11:22:40,602 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:40,602 INFO L485 AbstractCegarLoop]: Abstraction has 210 states and 314 transitions. [2025-04-29 11:22:40,602 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-29 11:22:40,602 INFO L278 IsEmpty]: Start isEmpty. Operand 210 states and 314 transitions. [2025-04-29 11:22:40,602 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:22:40,602 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:40,602 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:40,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:22:40,603 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-29 11:22:40,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:40,603 INFO L85 PathProgramCache]: Analyzing trace with hash 738472334, now seen corresponding path program 1 times [2025-04-29 11:22:40,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:40,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271600832] [2025-04-29 11:22:40,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:40,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:40,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:40,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:40,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:40,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:40,697 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-29 11:22:40,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:40,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271600832] [2025-04-29 11:22:40,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271600832] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:40,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115198920] [2025-04-29 11:22:40,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:40,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:40,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:40,699 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-29 11:22:40,701 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-29 11:22:40,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:22:40,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:22:40,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:40,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:40,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:22:40,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:40,900 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-29 11:22:40,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:41,001 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-29 11:22:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115198920] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:41,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:41,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2025-04-29 11:22:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491110151] [2025-04-29 11:22:41,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:41,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:22:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:41,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:22:41,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:22:41,002 INFO L87 Difference]: Start difference. First operand 210 states and 314 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-29 11:22:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:41,171 INFO L93 Difference]: Finished difference Result 236 states and 313 transitions. [2025-04-29 11:22:41,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:41,171 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-29 11:22:41,171 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:41,172 INFO L225 Difference]: With dead ends: 236 [2025-04-29 11:22:41,172 INFO L226 Difference]: Without dead ends: 236 [2025-04-29 11:22:41,173 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-29 11:22:41,173 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 203 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:41,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 428 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-29 11:22:41,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 213. [2025-04-29 11:22:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 195 states have internal predecessors, (272), 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-29 11:22:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 308 transitions. [2025-04-29 11:22:41,182 INFO L79 Accepts]: Start accepts. Automaton has 213 states and 308 transitions. Word has length 14 [2025-04-29 11:22:41,183 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:41,183 INFO L485 AbstractCegarLoop]: Abstraction has 213 states and 308 transitions. [2025-04-29 11:22:41,183 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-29 11:22:41,183 INFO L278 IsEmpty]: Start isEmpty. Operand 213 states and 308 transitions. [2025-04-29 11:22:41,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:22:41,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:41,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:41,189 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-29 11:22:41,384 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-29 11:22:41,384 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-29 11:22:41,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1417805820, now seen corresponding path program 1 times [2025-04-29 11:22:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:41,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259885852] [2025-04-29 11:22:41,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:41,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:22:41,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:22:41,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:41,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:41,510 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-29 11:22:41,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:41,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259885852] [2025-04-29 11:22:41,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259885852] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:41,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302139452] [2025-04-29 11:22:41,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:41,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:41,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:41,513 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-29 11:22:41,515 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-29 11:22:41,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:22:41,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:22:41,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:41,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:41,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:22:41,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:41,694 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-29 11:22:41,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:41,748 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-29 11:22:41,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302139452] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:41,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:41,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-04-29 11:22:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232378300] [2025-04-29 11:22:41,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:41,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:22:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:41,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:22:41,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:22:41,750 INFO L87 Difference]: Start difference. First operand 213 states and 308 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-29 11:22:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:42,018 INFO L93 Difference]: Finished difference Result 256 states and 353 transitions. [2025-04-29 11:22:42,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:22:42,019 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-29 11:22:42,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:42,020 INFO L225 Difference]: With dead ends: 256 [2025-04-29 11:22:42,020 INFO L226 Difference]: Without dead ends: 256 [2025-04-29 11:22:42,020 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-29 11:22:42,021 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:42,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 414 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-04-29 11:22:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 221. [2025-04-29 11:22:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 184 states have (on average 1.5380434782608696) internal successors, (283), 203 states have internal predecessors, (283), 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-29 11:22:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 319 transitions. [2025-04-29 11:22:42,029 INFO L79 Accepts]: Start accepts. Automaton has 221 states and 319 transitions. Word has length 15 [2025-04-29 11:22:42,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:42,030 INFO L485 AbstractCegarLoop]: Abstraction has 221 states and 319 transitions. [2025-04-29 11:22:42,030 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-29 11:22:42,030 INFO L278 IsEmpty]: Start isEmpty. Operand 221 states and 319 transitions. [2025-04-29 11:22:42,030 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:22:42,031 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:42,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:42,037 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-29 11:22:42,235 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-29 11:22:42,235 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-29 11:22:42,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1002307501, now seen corresponding path program 1 times [2025-04-29 11:22:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:42,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732278584] [2025-04-29 11:22:42,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:42,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:42,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:42,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:42,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:42,388 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-29 11:22:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:42,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732278584] [2025-04-29 11:22:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732278584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:42,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686679315] [2025-04-29 11:22:42,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:42,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:42,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:42,391 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-29 11:22:42,392 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-29 11:22:42,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:22:42,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:22:42,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:42,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:42,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:22:42,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:42,609 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-29 11:22:42,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:42,711 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-29 11:22:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686679315] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:42,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:42,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-04-29 11:22:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975136583] [2025-04-29 11:22:42,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:42,712 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:22:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:42,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:22:42,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:22:42,713 INFO L87 Difference]: Start difference. First operand 221 states and 319 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-29 11:22:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:43,074 INFO L93 Difference]: Finished difference Result 355 states and 471 transitions. [2025-04-29 11:22:43,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:22:43,075 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-29 11:22:43,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:43,076 INFO L225 Difference]: With dead ends: 355 [2025-04-29 11:22:43,076 INFO L226 Difference]: Without dead ends: 355 [2025-04-29 11:22:43,077 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-29 11:22:43,077 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 272 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:43,077 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 584 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-04-29 11:22:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 292. [2025-04-29 11:22:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 251 states have (on average 1.5577689243027888) internal successors, (391), 272 states have internal predecessors, (391), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-04-29 11:22:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 434 transitions. [2025-04-29 11:22:43,084 INFO L79 Accepts]: Start accepts. Automaton has 292 states and 434 transitions. Word has length 16 [2025-04-29 11:22:43,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:43,084 INFO L485 AbstractCegarLoop]: Abstraction has 292 states and 434 transitions. [2025-04-29 11:22:43,084 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-29 11:22:43,085 INFO L278 IsEmpty]: Start isEmpty. Operand 292 states and 434 transitions. [2025-04-29 11:22:43,085 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:43,085 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:43,085 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-29 11:22:43,091 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-29 11:22:43,285 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-29 11:22:43,286 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-29 11:22:43,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:43,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1943920207, now seen corresponding path program 1 times [2025-04-29 11:22:43,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:43,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312321760] [2025-04-29 11:22:43,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:43,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:43,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:43,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:43,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:43,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:43,328 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-29 11:22:43,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:43,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312321760] [2025-04-29 11:22:43,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312321760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:43,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:43,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:22:43,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530077276] [2025-04-29 11:22:43,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:43,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:43,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:43,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:43,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:43,330 INFO L87 Difference]: Start difference. First operand 292 states and 434 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:43,348 INFO L93 Difference]: Finished difference Result 428 states and 642 transitions. [2025-04-29 11:22:43,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:43,348 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:22:43,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:43,350 INFO L225 Difference]: With dead ends: 428 [2025-04-29 11:22:43,350 INFO L226 Difference]: Without dead ends: 428 [2025-04-29 11:22:43,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:43,351 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 103 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-29 11:22:43,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 103 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-04-29 11:22:43,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 411. [2025-04-29 11:22:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 361 states have (on average 1.5650969529085872) internal successors, (565), 384 states have internal predecessors, (565), 15 states have call successors, (15), 11 states have call predecessors, (15), 17 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2025-04-29 11:22:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 634 transitions. [2025-04-29 11:22:43,361 INFO L79 Accepts]: Start accepts. Automaton has 411 states and 634 transitions. Word has length 18 [2025-04-29 11:22:43,361 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:43,361 INFO L485 AbstractCegarLoop]: Abstraction has 411 states and 634 transitions. [2025-04-29 11:22:43,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:43,361 INFO L278 IsEmpty]: Start isEmpty. Operand 411 states and 634 transitions. [2025-04-29 11:22:43,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:22:43,361 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:43,361 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-29 11:22:43,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:22:43,361 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:43,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1943920463, now seen corresponding path program 1 times [2025-04-29 11:22:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:43,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651956398] [2025-04-29 11:22:43,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:43,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:22:43,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:22:43,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:43,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:43,379 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-29 11:22:43,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:43,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651956398] [2025-04-29 11:22:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651956398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:43,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:43,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367963028] [2025-04-29 11:22:43,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:43,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:43,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:43,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:43,380 INFO L87 Difference]: Start difference. First operand 411 states and 634 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:43,385 INFO L93 Difference]: Finished difference Result 373 states and 568 transitions. [2025-04-29 11:22:43,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:43,385 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:22:43,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:43,386 INFO L225 Difference]: With dead ends: 373 [2025-04-29 11:22:43,386 INFO L226 Difference]: Without dead ends: 373 [2025-04-29 11:22:43,387 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-29 11:22:43,387 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 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-29 11:22:43,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-04-29 11:22:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-04-29 11:22:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 329 states have (on average 1.5167173252279635) internal successors, (499), 346 states have internal predecessors, (499), 15 states have call successors, (15), 11 states have call predecessors, (15), 17 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2025-04-29 11:22:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 568 transitions. [2025-04-29 11:22:43,397 INFO L79 Accepts]: Start accepts. Automaton has 373 states and 568 transitions. Word has length 18 [2025-04-29 11:22:43,397 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:43,397 INFO L485 AbstractCegarLoop]: Abstraction has 373 states and 568 transitions. [2025-04-29 11:22:43,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:22:43,398 INFO L278 IsEmpty]: Start isEmpty. Operand 373 states and 568 transitions. [2025-04-29 11:22:43,398 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:22:43,398 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:43,398 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-29 11:22:43,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:22:43,398 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-29 11:22:43,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash 131984341, now seen corresponding path program 1 times [2025-04-29 11:22:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:43,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778444106] [2025-04-29 11:22:43,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:43,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:43,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:22:43,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:22:43,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:43,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:43,441 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-29 11:22:43,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:43,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778444106] [2025-04-29 11:22:43,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778444106] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:43,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:43,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:22:43,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358915251] [2025-04-29 11:22:43,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:43,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:43,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:43,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:43,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:43,442 INFO L87 Difference]: Start difference. First operand 373 states and 568 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-29 11:22:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:43,464 INFO L93 Difference]: Finished difference Result 438 states and 647 transitions. [2025-04-29 11:22:43,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:43,464 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-29 11:22:43,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:43,465 INFO L225 Difference]: With dead ends: 438 [2025-04-29 11:22:43,465 INFO L226 Difference]: Without dead ends: 438 [2025-04-29 11:22:43,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:43,466 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:43,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-04-29 11:22:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 421. [2025-04-29 11:22:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 373 states have (on average 1.5120643431635388) internal successors, (564), 392 states have internal predecessors, (564), 16 states have call successors, (16), 12 states have call predecessors, (16), 20 states have return successors, (57), 16 states have call predecessors, (57), 16 states have call successors, (57) [2025-04-29 11:22:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 637 transitions. [2025-04-29 11:22:43,477 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 637 transitions. Word has length 19 [2025-04-29 11:22:43,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:43,477 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 637 transitions. [2025-04-29 11:22:43,478 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-29 11:22:43,478 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 637 transitions. [2025-04-29 11:22:43,478 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:22:43,478 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:43,478 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-29 11:22:43,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:22:43,478 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:43,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1175069978, now seen corresponding path program 1 times [2025-04-29 11:22:43,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:43,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120114354] [2025-04-29 11:22:43,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:43,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:43,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:22:43,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:22:43,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:43,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:43,514 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-29 11:22:43,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:43,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120114354] [2025-04-29 11:22:43,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120114354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:43,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:43,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:43,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240294857] [2025-04-29 11:22:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:43,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:22:43,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:43,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:22:43,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:22:43,518 INFO L87 Difference]: Start difference. First operand 421 states and 637 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-29 11:22:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:43,523 INFO L93 Difference]: Finished difference Result 292 states and 421 transitions. [2025-04-29 11:22:43,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:22:43,523 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-29 11:22:43,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:43,525 INFO L225 Difference]: With dead ends: 292 [2025-04-29 11:22:43,525 INFO L226 Difference]: Without dead ends: 292 [2025-04-29 11:22:43,525 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-29 11:22:43,526 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 94 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-29 11:22:43,526 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 94 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-04-29 11:22:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2025-04-29 11:22:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 255 states have (on average 1.4784313725490197) internal successors, (377), 271 states have internal predecessors, (377), 11 states have call successors, (11), 8 states have call predecessors, (11), 13 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-04-29 11:22:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 420 transitions. [2025-04-29 11:22:43,535 INFO L79 Accepts]: Start accepts. Automaton has 291 states and 420 transitions. Word has length 25 [2025-04-29 11:22:43,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:43,535 INFO L485 AbstractCegarLoop]: Abstraction has 291 states and 420 transitions. [2025-04-29 11:22:43,535 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-29 11:22:43,535 INFO L278 IsEmpty]: Start isEmpty. Operand 291 states and 420 transitions. [2025-04-29 11:22:43,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:22:43,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:43,537 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-29 11:22:43,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:22:43,537 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-29 11:22:43,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:43,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1096505428, now seen corresponding path program 1 times [2025-04-29 11:22:43,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:43,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052065241] [2025-04-29 11:22:43,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:43,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:43,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:22:43,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:22:43,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:43,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:43,624 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-29 11:22:43,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:43,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052065241] [2025-04-29 11:22:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052065241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:43,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:43,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:22:43,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999449564] [2025-04-29 11:22:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:43,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:43,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:43,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:22:43,627 INFO L87 Difference]: Start difference. First operand 291 states and 420 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-29 11:22:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:43,693 INFO L93 Difference]: Finished difference Result 314 states and 436 transitions. [2025-04-29 11:22:43,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:43,693 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 27 [2025-04-29 11:22:43,693 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:43,695 INFO L225 Difference]: With dead ends: 314 [2025-04-29 11:22:43,695 INFO L226 Difference]: Without dead ends: 314 [2025-04-29 11:22:43,695 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:22:43,695 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:43,696 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 168 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:43,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-04-29 11:22:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 295. [2025-04-29 11:22:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 257 states have (on average 1.4630350194552528) internal successors, (376), 275 states have internal predecessors, (376), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-04-29 11:22:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 419 transitions. [2025-04-29 11:22:43,705 INFO L79 Accepts]: Start accepts. Automaton has 295 states and 419 transitions. Word has length 27 [2025-04-29 11:22:43,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:43,705 INFO L485 AbstractCegarLoop]: Abstraction has 295 states and 419 transitions. [2025-04-29 11:22:43,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-29 11:22:43,705 INFO L278 IsEmpty]: Start isEmpty. Operand 295 states and 419 transitions. [2025-04-29 11:22:43,706 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:22:43,706 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:43,706 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-29 11:22:43,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:22:43,706 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-29 11:22:43,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1489532438, now seen corresponding path program 1 times [2025-04-29 11:22:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:43,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523317531] [2025-04-29 11:22:43,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:43,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:22:43,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:22:43,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:43,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:43,884 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-29 11:22:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:43,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523317531] [2025-04-29 11:22:43,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523317531] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:43,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044669316] [2025-04-29 11:22:43,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:43,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:43,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:43,886 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-29 11:22:43,888 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-29 11:22:43,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:22:43,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:22:43,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:43,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:43,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:22:43,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:44,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:44,184 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-29 11:22:44,235 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-29 11:22:44,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:44,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044669316] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:44,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2025-04-29 11:22:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460057723] [2025-04-29 11:22:44,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:44,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:22:44,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:44,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:22:44,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:22:44,368 INFO L87 Difference]: Start difference. First operand 295 states and 419 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-29 11:22:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:44,690 INFO L93 Difference]: Finished difference Result 311 states and 420 transitions. [2025-04-29 11:22:44,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:22:44,691 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-29 11:22:44,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:44,692 INFO L225 Difference]: With dead ends: 311 [2025-04-29 11:22:44,692 INFO L226 Difference]: Without dead ends: 311 [2025-04-29 11:22:44,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:22:44,693 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 293 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:44,693 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 115 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-04-29 11:22:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2025-04-29 11:22:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 261 states have (on average 1.417624521072797) internal successors, (370), 279 states have internal predecessors, (370), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-04-29 11:22:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 413 transitions. [2025-04-29 11:22:44,723 INFO L79 Accepts]: Start accepts. Automaton has 299 states and 413 transitions. Word has length 27 [2025-04-29 11:22:44,723 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:44,723 INFO L485 AbstractCegarLoop]: Abstraction has 299 states and 413 transitions. [2025-04-29 11:22:44,724 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-29 11:22:44,724 INFO L278 IsEmpty]: Start isEmpty. Operand 299 states and 413 transitions. [2025-04-29 11:22:44,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:22:44,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:44,725 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:44,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:22:44,926 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,SelfDestructingSolverStorable14 [2025-04-29 11:22:44,926 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:44,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:44,927 INFO L85 PathProgramCache]: Analyzing trace with hash 394047059, now seen corresponding path program 1 times [2025-04-29 11:22:44,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:44,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538303264] [2025-04-29 11:22:44,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:44,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:44,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:22:44,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:22:44,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:44,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:45,031 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-29 11:22:45,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:45,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538303264] [2025-04-29 11:22:45,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538303264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:45,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322306859] [2025-04-29 11:22:45,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:45,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:45,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:45,033 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-29 11:22:45,035 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-29 11:22:45,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:22:45,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:22:45,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:45,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:45,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:22:45,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:45,178 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-29 11:22:45,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:45,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322306859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:45,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:22:45,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-04-29 11:22:45,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842563724] [2025-04-29 11:22:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:45,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:22:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:45,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:22:45,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:45,180 INFO L87 Difference]: Start difference. First operand 299 states and 413 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-29 11:22:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:45,225 INFO L93 Difference]: Finished difference Result 320 states and 430 transitions. [2025-04-29 11:22:45,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:22:45,227 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-29 11:22:45,227 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:45,228 INFO L225 Difference]: With dead ends: 320 [2025-04-29 11:22:45,228 INFO L226 Difference]: Without dead ends: 320 [2025-04-29 11:22:45,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:22:45,229 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 62 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 134 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-29 11:22:45,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 134 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-04-29 11:22:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 310. [2025-04-29 11:22:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 272 states have (on average 1.400735294117647) internal successors, (381), 290 states have internal predecessors, (381), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-04-29 11:22:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 424 transitions. [2025-04-29 11:22:45,236 INFO L79 Accepts]: Start accepts. Automaton has 310 states and 424 transitions. Word has length 28 [2025-04-29 11:22:45,236 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:45,236 INFO L485 AbstractCegarLoop]: Abstraction has 310 states and 424 transitions. [2025-04-29 11:22:45,236 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-29 11:22:45,236 INFO L278 IsEmpty]: Start isEmpty. Operand 310 states and 424 transitions. [2025-04-29 11:22:45,236 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:22:45,237 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:45,237 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-29 11:22:45,243 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-29 11:22:45,437 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,SelfDestructingSolverStorable15 [2025-04-29 11:22:45,437 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:45,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1216564983, now seen corresponding path program 1 times [2025-04-29 11:22:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:45,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123019126] [2025-04-29 11:22:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:45,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:22:45,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:22:45,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:45,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:45,750 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-29 11:22:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:45,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123019126] [2025-04-29 11:22:45,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123019126] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:45,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919589546] [2025-04-29 11:22:45,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:45,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:45,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:45,753 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-29 11:22:45,754 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-29 11:22:45,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:22:45,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:22:45,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:45,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:45,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:22:45,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:46,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:46,022 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-29 11:22:46,100 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-29 11:22:46,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:46,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919589546] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:46,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:46,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2025-04-29 11:22:46,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032302022] [2025-04-29 11:22:46,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:46,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:22:46,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:46,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:22:46,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:22:46,197 INFO L87 Difference]: Start difference. First operand 310 states and 424 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-29 11:22:46,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:46,510 INFO L93 Difference]: Finished difference Result 319 states and 424 transitions. [2025-04-29 11:22:46,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:22:46,513 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-29 11:22:46,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:46,515 INFO L225 Difference]: With dead ends: 319 [2025-04-29 11:22:46,515 INFO L226 Difference]: Without dead ends: 319 [2025-04-29 11:22:46,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:22:46,516 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 271 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:46,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 187 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-29 11:22:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 311. [2025-04-29 11:22:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 273 states have (on average 1.380952380952381) internal successors, (377), 291 states have internal predecessors, (377), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-04-29 11:22:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 420 transitions. [2025-04-29 11:22:46,524 INFO L79 Accepts]: Start accepts. Automaton has 311 states and 420 transitions. Word has length 29 [2025-04-29 11:22:46,524 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:46,524 INFO L485 AbstractCegarLoop]: Abstraction has 311 states and 420 transitions. [2025-04-29 11:22:46,524 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-29 11:22:46,524 INFO L278 IsEmpty]: Start isEmpty. Operand 311 states and 420 transitions. [2025-04-29 11:22:46,525 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:22:46,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:46,525 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-29 11:22:46,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:46,725 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,SelfDestructingSolverStorable16 [2025-04-29 11:22:46,726 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:46,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 941191234, now seen corresponding path program 1 times [2025-04-29 11:22:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:46,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429887359] [2025-04-29 11:22:46,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:46,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:46,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:46,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:46,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:46,837 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-29 11:22:46,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:46,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429887359] [2025-04-29 11:22:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429887359] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:46,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377964113] [2025-04-29 11:22:46,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:46,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:46,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:46,840 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-29 11:22:46,842 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-29 11:22:46,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:22:46,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:22:46,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:46,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:46,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 11:22:46,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:46,917 WARN L871 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (and (= (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (select |c_#valid| |parse_input_c1_~x~0#1.base|))))) is different from true [2025-04-29 11:22:46,960 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:46,961 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-29 11:22:46,993 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-29 11:22:46,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:47,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377964113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:47,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-04-29 11:22:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969598641] [2025-04-29 11:22:47,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:47,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:22:47,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:47,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:22:47,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2025-04-29 11:22:47,032 INFO L87 Difference]: Start difference. First operand 311 states and 420 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-29 11:22:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:47,305 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2025-04-29 11:22:47,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:22:47,306 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-29 11:22:47,306 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:47,307 INFO L225 Difference]: With dead ends: 442 [2025-04-29 11:22:47,307 INFO L226 Difference]: Without dead ends: 442 [2025-04-29 11:22:47,307 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=427, Unknown=1, NotChecked=46, Total=650 [2025-04-29 11:22:47,308 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 357 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:47,308 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 214 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 152 Unchecked, 0.1s Time] [2025-04-29 11:22:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-04-29 11:22:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 386. [2025-04-29 11:22:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 345 states have (on average 1.3478260869565217) internal successors, (465), 364 states have internal predecessors, (465), 11 states have call successors, (11), 10 states have call predecessors, (11), 18 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-04-29 11:22:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 507 transitions. [2025-04-29 11:22:47,316 INFO L79 Accepts]: Start accepts. Automaton has 386 states and 507 transitions. Word has length 30 [2025-04-29 11:22:47,316 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:47,316 INFO L485 AbstractCegarLoop]: Abstraction has 386 states and 507 transitions. [2025-04-29 11:22:47,316 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-29 11:22:47,316 INFO L278 IsEmpty]: Start isEmpty. Operand 386 states and 507 transitions. [2025-04-29 11:22:47,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:22:47,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:47,316 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-29 11:22:47,322 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-29 11:22:47,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:47,517 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:47,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:47,518 INFO L85 PathProgramCache]: Analyzing trace with hash -887842773, now seen corresponding path program 1 times [2025-04-29 11:22:47,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:47,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755154249] [2025-04-29 11:22:47,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:47,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:47,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:22:47,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:22:47,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:47,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:47,675 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-29 11:22:47,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:47,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755154249] [2025-04-29 11:22:47,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755154249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:47,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752343247] [2025-04-29 11:22:47,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:47,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:47,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:47,678 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-29 11:22:47,680 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-29 11:22:47,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:22:47,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:22:47,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:47,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:47,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:22:47,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:47,783 WARN L871 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (and (= (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| (select |c_#length| |parse_input_c1_~x~0#1.base|)) |c_#length|))) is different from true [2025-04-29 11:22:47,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:47,816 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-29 11:22:47,874 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-29 11:22:47,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:47,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752343247] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:47,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:47,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2025-04-29 11:22:47,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2212348] [2025-04-29 11:22:47,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:47,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:22:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:47,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:22:47,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=247, Unknown=1, NotChecked=32, Total=342 [2025-04-29 11:22:47,972 INFO L87 Difference]: Start difference. First operand 386 states and 507 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-29 11:22:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:48,433 INFO L93 Difference]: Finished difference Result 538 states and 653 transitions. [2025-04-29 11:22:48,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:22:48,434 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-29 11:22:48,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:48,436 INFO L225 Difference]: With dead ends: 538 [2025-04-29 11:22:48,436 INFO L226 Difference]: Without dead ends: 538 [2025-04-29 11:22:48,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=938, Unknown=1, NotChecked=68, Total=1332 [2025-04-29 11:22:48,437 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 417 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:48,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 234 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 298 Invalid, 0 Unknown, 155 Unchecked, 0.2s Time] [2025-04-29 11:22:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-04-29 11:22:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 474. [2025-04-29 11:22:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 430 states have (on average 1.3255813953488371) internal successors, (570), 451 states have internal predecessors, (570), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2025-04-29 11:22:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 608 transitions. [2025-04-29 11:22:48,448 INFO L79 Accepts]: Start accepts. Automaton has 474 states and 608 transitions. Word has length 31 [2025-04-29 11:22:48,448 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:48,448 INFO L485 AbstractCegarLoop]: Abstraction has 474 states and 608 transitions. [2025-04-29 11:22:48,448 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-29 11:22:48,448 INFO L278 IsEmpty]: Start isEmpty. Operand 474 states and 608 transitions. [2025-04-29 11:22:48,448 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:22:48,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:48,449 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-29 11:22:48,455 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-29 11:22:48,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:48,649 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:48,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2120662031, now seen corresponding path program 1 times [2025-04-29 11:22:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:48,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477192157] [2025-04-29 11:22:48,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:48,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:48,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:22:48,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:22:48,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:48,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:48,808 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-29 11:22:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:48,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477192157] [2025-04-29 11:22:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477192157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:48,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548511107] [2025-04-29 11:22:48,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:48,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:48,811 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-29 11:22:48,812 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-29 11:22:48,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:22:48,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:22:48,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:48,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:48,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:22:48,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:49,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:49,020 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-29 11:22:49,133 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-29 11:22:49,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:49,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548511107] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:49,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:49,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2025-04-29 11:22:49,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87948519] [2025-04-29 11:22:49,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:49,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:22:49,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:49,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:22:49,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:22:49,284 INFO L87 Difference]: Start difference. First operand 474 states and 608 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-29 11:22:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:49,650 INFO L93 Difference]: Finished difference Result 488 states and 601 transitions. [2025-04-29 11:22:49,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:22:49,651 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-29 11:22:49,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:49,652 INFO L225 Difference]: With dead ends: 488 [2025-04-29 11:22:49,652 INFO L226 Difference]: Without dead ends: 488 [2025-04-29 11:22:49,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:22:49,653 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 245 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:49,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 180 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-04-29 11:22:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 471. [2025-04-29 11:22:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 430 states have (on average 1.2767441860465116) internal successors, (549), 448 states have internal predecessors, (549), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2025-04-29 11:22:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 587 transitions. [2025-04-29 11:22:49,662 INFO L79 Accepts]: Start accepts. Automaton has 471 states and 587 transitions. Word has length 35 [2025-04-29 11:22:49,662 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:49,662 INFO L485 AbstractCegarLoop]: Abstraction has 471 states and 587 transitions. [2025-04-29 11:22:49,662 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-29 11:22:49,662 INFO L278 IsEmpty]: Start isEmpty. Operand 471 states and 587 transitions. [2025-04-29 11:22:49,663 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:22:49,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:49,663 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:49,669 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-29 11:22:49,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:49,867 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:49,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash 942664730, now seen corresponding path program 1 times [2025-04-29 11:22:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:49,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778667068] [2025-04-29 11:22:49,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:49,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:49,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:22:49,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:22:49,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:49,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:22:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:49,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778667068] [2025-04-29 11:22:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778667068] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:49,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838497036] [2025-04-29 11:22:49,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:49,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:49,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:49,955 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-29 11:22:49,957 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-29 11:22:49,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:22:50,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:22:50,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:50,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:50,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:22:50,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:50,118 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:50,119 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-29 11:22:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:22:50,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:50,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-29 11:22:50,340 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-29 11:22:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:22:50,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838497036] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:50,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:50,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2025-04-29 11:22:50,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068074467] [2025-04-29 11:22:50,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:50,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:22:50,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:50,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:22:50,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:22:50,359 INFO L87 Difference]: Start difference. First operand 471 states and 587 transitions. Second operand has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:22:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:50,625 INFO L93 Difference]: Finished difference Result 510 states and 613 transitions. [2025-04-29 11:22:50,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:22:50,625 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2025-04-29 11:22:50,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:50,626 INFO L225 Difference]: With dead ends: 510 [2025-04-29 11:22:50,627 INFO L226 Difference]: Without dead ends: 510 [2025-04-29 11:22:50,627 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:22:50,627 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 156 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:50,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 225 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-04-29 11:22:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 474. [2025-04-29 11:22:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 433 states have (on average 1.2748267898383372) internal successors, (552), 451 states have internal predecessors, (552), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2025-04-29 11:22:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 589 transitions. [2025-04-29 11:22:50,635 INFO L79 Accepts]: Start accepts. Automaton has 474 states and 589 transitions. Word has length 36 [2025-04-29 11:22:50,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:50,635 INFO L485 AbstractCegarLoop]: Abstraction has 474 states and 589 transitions. [2025-04-29 11:22:50,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:22:50,636 INFO L278 IsEmpty]: Start isEmpty. Operand 474 states and 589 transitions. [2025-04-29 11:22:50,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:22:50,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:50,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:50,642 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-29 11:22:50,836 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,SelfDestructingSolverStorable20 [2025-04-29 11:22:50,837 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:50,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash -842164465, now seen corresponding path program 1 times [2025-04-29 11:22:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:50,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322695393] [2025-04-29 11:22:50,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:50,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:50,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:22:50,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:22:50,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:50,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:51,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322695393] [2025-04-29 11:22:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322695393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:51,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135666196] [2025-04-29 11:22:51,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:51,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:51,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:51,128 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-29 11:22:51,130 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-29 11:22:51,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:22:51,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:22:51,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:51,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:51,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:22:51,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135666196] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:51,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2025-04-29 11:22:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570538495] [2025-04-29 11:22:51,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:51,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 11:22:51,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:51,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 11:22:51,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:22:51,599 INFO L87 Difference]: Start difference. First operand 474 states and 589 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:22:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:52,637 INFO L93 Difference]: Finished difference Result 682 states and 817 transitions. [2025-04-29 11:22:52,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-29 11:22:52,637 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2025-04-29 11:22:52,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:52,639 INFO L225 Difference]: With dead ends: 682 [2025-04-29 11:22:52,639 INFO L226 Difference]: Without dead ends: 682 [2025-04-29 11:22:52,640 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=571, Invalid=2621, Unknown=0, NotChecked=0, Total=3192 [2025-04-29 11:22:52,641 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 843 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:52,641 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 441 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:22:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-04-29 11:22:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 478. [2025-04-29 11:22:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 439 states have (on average 1.2642369020501139) internal successors, (555), 457 states have internal predecessors, (555), 10 states have call successors, (10), 10 states have call predecessors, (10), 20 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2025-04-29 11:22:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 589 transitions. [2025-04-29 11:22:52,651 INFO L79 Accepts]: Start accepts. Automaton has 478 states and 589 transitions. Word has length 37 [2025-04-29 11:22:52,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:52,651 INFO L485 AbstractCegarLoop]: Abstraction has 478 states and 589 transitions. [2025-04-29 11:22:52,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:22:52,651 INFO L278 IsEmpty]: Start isEmpty. Operand 478 states and 589 transitions. [2025-04-29 11:22:52,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:22:52,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:52,652 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-29 11:22:52,657 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-29 11:22:52,855 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,SelfDestructingSolverStorable21 [2025-04-29 11:22:52,855 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:52,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash -778427753, now seen corresponding path program 1 times [2025-04-29 11:22:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:52,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072423359] [2025-04-29 11:22:52,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:52,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:22:52,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:22:52,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:52,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:52,899 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-29 11:22:52,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:52,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072423359] [2025-04-29 11:22:52,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072423359] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:52,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134523607] [2025-04-29 11:22:52,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:52,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:52,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:52,902 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-29 11:22:52,903 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-29 11:22:52,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:22:52,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:22:52,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:52,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:52,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:22:52,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:52,974 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-29 11:22:52,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:22:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134523607] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:52,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:22:52,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-04-29 11:22:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344439566] [2025-04-29 11:22:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:52,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:22:52,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:52,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:22:52,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:22:52,976 INFO L87 Difference]: Start difference. First operand 478 states and 589 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-29 11:22:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:52,990 INFO L93 Difference]: Finished difference Result 285 states and 334 transitions. [2025-04-29 11:22:52,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:52,990 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-29 11:22:52,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:52,991 INFO L225 Difference]: With dead ends: 285 [2025-04-29 11:22:52,991 INFO L226 Difference]: Without dead ends: 285 [2025-04-29 11:22:52,991 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-29 11:22:52,992 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 131 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-29 11:22:52,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 131 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-04-29 11:22:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2025-04-29 11:22:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 253 states have (on average 1.233201581027668) internal successors, (312), 266 states have internal predecessors, (312), 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-29 11:22:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 332 transitions. [2025-04-29 11:22:52,996 INFO L79 Accepts]: Start accepts. Automaton has 281 states and 332 transitions. Word has length 45 [2025-04-29 11:22:52,996 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:52,996 INFO L485 AbstractCegarLoop]: Abstraction has 281 states and 332 transitions. [2025-04-29 11:22:52,996 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-29 11:22:52,996 INFO L278 IsEmpty]: Start isEmpty. Operand 281 states and 332 transitions. [2025-04-29 11:22:52,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:22:52,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:52,997 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-29 11:22:53,003 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-29 11:22:53,197 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,SelfDestructingSolverStorable22 [2025-04-29 11:22:53,198 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:53,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,198 INFO L85 PathProgramCache]: Analyzing trace with hash 54324921, now seen corresponding path program 1 times [2025-04-29 11:22:53,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015019760] [2025-04-29 11:22:53,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:22:53,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:22:53,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:22:53,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015019760] [2025-04-29 11:22:53,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015019760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:53,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069242667] [2025-04-29 11:22:53,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:53,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:53,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:53,244 INFO L87 Difference]: Start difference. First operand 281 states and 332 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-29 11:22:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,257 INFO L93 Difference]: Finished difference Result 280 states and 329 transitions. [2025-04-29 11:22:53,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:53,258 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 47 [2025-04-29 11:22:53,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,259 INFO L225 Difference]: With dead ends: 280 [2025-04-29 11:22:53,259 INFO L226 Difference]: Without dead ends: 280 [2025-04-29 11:22:53,259 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-29 11:22:53,260 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 80 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-04-29 11:22:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-04-29 11:22:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 253 states have (on average 1.2213438735177866) internal successors, (309), 265 states have internal predecessors, (309), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-29 11:22:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 329 transitions. [2025-04-29 11:22:53,266 INFO L79 Accepts]: Start accepts. Automaton has 280 states and 329 transitions. Word has length 47 [2025-04-29 11:22:53,266 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,266 INFO L485 AbstractCegarLoop]: Abstraction has 280 states and 329 transitions. [2025-04-29 11:22:53,266 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-29 11:22:53,266 INFO L278 IsEmpty]: Start isEmpty. Operand 280 states and 329 transitions. [2025-04-29 11:22:53,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:22:53,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,267 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, 1] [2025-04-29 11:22:53,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:22:53,267 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:53,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1684072619, now seen corresponding path program 1 times [2025-04-29 11:22:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589614689] [2025-04-29 11:22:53,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:22:53,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:22:53,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:22:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589614689] [2025-04-29 11:22:53,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589614689] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176950016] [2025-04-29 11:22:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:53,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:53,340 INFO L87 Difference]: Start difference. First operand 280 states and 329 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-29 11:22:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,363 INFO L93 Difference]: Finished difference Result 279 states and 325 transitions. [2025-04-29 11:22:53,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:22:53,364 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 48 [2025-04-29 11:22:53,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,364 INFO L225 Difference]: With dead ends: 279 [2025-04-29 11:22:53,364 INFO L226 Difference]: Without dead ends: 279 [2025-04-29 11:22:53,365 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-29 11:22:53,365 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 66 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:53,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-04-29 11:22:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-04-29 11:22:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.2055335968379446) internal successors, (305), 264 states have internal predecessors, (305), 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-29 11:22:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 325 transitions. [2025-04-29 11:22:53,371 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 325 transitions. Word has length 48 [2025-04-29 11:22:53,371 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,371 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 325 transitions. [2025-04-29 11:22:53,371 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-29 11:22:53,371 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 325 transitions. [2025-04-29 11:22:53,372 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:22:53,372 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,372 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, 1, 1] [2025-04-29 11:22:53,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:22:53,372 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:53,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash 666643707, now seen corresponding path program 1 times [2025-04-29 11:22:53,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470245625] [2025-04-29 11:22:53,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:22:53,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:22:53,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:22:53,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470245625] [2025-04-29 11:22:53,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470245625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:22:53,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:22:53,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:22:53,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682738986] [2025-04-29 11:22:53,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:22:53,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:22:53,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:22:53,429 INFO L87 Difference]: Start difference. First operand 279 states and 325 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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-29 11:22:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:53,476 INFO L93 Difference]: Finished difference Result 293 states and 333 transitions. [2025-04-29 11:22:53,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:22:53,477 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 49 [2025-04-29 11:22:53,477 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:53,478 INFO L225 Difference]: With dead ends: 293 [2025-04-29 11:22:53,478 INFO L226 Difference]: Without dead ends: 293 [2025-04-29 11:22:53,478 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-29 11:22:53,479 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:53,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:22:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-04-29 11:22:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2025-04-29 11:22:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.1936758893280632) internal successors, (302), 264 states have internal predecessors, (302), 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-29 11:22:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2025-04-29 11:22:53,484 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 49 [2025-04-29 11:22:53,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:53,484 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2025-04-29 11:22:53,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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-29 11:22:53,484 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2025-04-29 11:22:53,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:22:53,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:53,485 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] [2025-04-29 11:22:53,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:22:53,485 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-29 11:22:53,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1132732387, now seen corresponding path program 1 times [2025-04-29 11:22:53,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:53,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906122607] [2025-04-29 11:22:53,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:53,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:53,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:53,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,633 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-29 11:22:53,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:53,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906122607] [2025-04-29 11:22:53,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906122607] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:53,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341276815] [2025-04-29 11:22:53,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:53,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:53,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:53,635 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-29 11:22:53,637 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-29 11:22:53,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:22:53,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:22:53,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:53,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:53,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:22:53,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:53,713 WARN L871 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (and (= (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (select |c_#valid| |parse_input_c1_~x~0#1.base|))))) is different from true [2025-04-29 11:22:53,751 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:53,752 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-29 11:22:53,795 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:53,795 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-29 11:22:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 11:22:53,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:53,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341276815] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:53,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:53,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2025-04-29 11:22:53,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114839128] [2025-04-29 11:22:53,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:53,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:22:53,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:53,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:22:53,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=141, Unknown=1, NotChecked=24, Total=210 [2025-04-29 11:22:53,849 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-29 11:22:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:54,071 INFO L93 Difference]: Finished difference Result 295 states and 332 transitions. [2025-04-29 11:22:54,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:22:54,072 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2025-04-29 11:22:54,072 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:54,073 INFO L225 Difference]: With dead ends: 295 [2025-04-29 11:22:54,073 INFO L226 Difference]: Without dead ends: 295 [2025-04-29 11:22:54,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=434, Unknown=1, NotChecked=46, Total=650 [2025-04-29 11:22:54,073 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 228 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:54,073 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 209 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 255 Invalid, 0 Unknown, 108 Unchecked, 0.1s Time] [2025-04-29 11:22:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-04-29 11:22:54,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 279. [2025-04-29 11:22:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.1818181818181819) internal successors, (299), 264 states have internal predecessors, (299), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-04-29 11:22:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 319 transitions. [2025-04-29 11:22:54,077 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 319 transitions. Word has length 51 [2025-04-29 11:22:54,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:54,077 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 319 transitions. [2025-04-29 11:22:54,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-04-29 11:22:54,077 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 319 transitions. [2025-04-29 11:22:54,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:22:54,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:54,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:54,084 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-29 11:22:54,278 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,SelfDestructingSolverStorable26 [2025-04-29 11:22:54,279 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:54,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash 754965674, now seen corresponding path program 1 times [2025-04-29 11:22:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:54,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152692943] [2025-04-29 11:22:54,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:54,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:22:54,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:22:54,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:54,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:54,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152692943] [2025-04-29 11:22:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152692943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:54,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420144852] [2025-04-29 11:22:54,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:54,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:54,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:54,542 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-29 11:22:54,544 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-29 11:22:54,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:22:54,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:22:54,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:54,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:54,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:22:54,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:54,669 WARN L871 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (and (= (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (select |c_#valid| |parse_input_c1_~x~0#1.base|))) (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| (select |c_#length| |parse_input_c1_~x~0#1.base|)) |c_#length|))) is different from true [2025-04-29 11:22:54,711 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:22:54,711 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-29 11:22:54,715 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-29 11:22:54,747 WARN L871 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (and (= (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|) 0) (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| (select |c_#length| |parse_input_c1_~x~0#1.base|)) |c_#length|))) is different from true [2025-04-29 11:22:54,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:54,770 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-29 11:22:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 7 not checked. [2025-04-29 11:22:54,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420144852] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:54,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:54,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 18 [2025-04-29 11:22:54,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921041733] [2025-04-29 11:22:54,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:54,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:22:54,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:54,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:22:54,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=390, Unknown=2, NotChecked=82, Total=552 [2025-04-29 11:22:54,928 INFO L87 Difference]: Start difference. First operand 279 states and 319 transitions. Second operand has 20 states, 16 states have (on average 5.125) internal successors, (82), 14 states have internal predecessors, (82), 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-29 11:22:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:55,349 INFO L93 Difference]: Finished difference Result 308 states and 340 transitions. [2025-04-29 11:22:55,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:22:55,350 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 5.125) internal successors, (82), 14 states have internal predecessors, (82), 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 52 [2025-04-29 11:22:55,350 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:55,350 INFO L225 Difference]: With dead ends: 308 [2025-04-29 11:22:55,350 INFO L226 Difference]: Without dead ends: 308 [2025-04-29 11:22:55,351 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=980, Unknown=2, NotChecked=142, Total=1482 [2025-04-29 11:22:55,351 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 287 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:55,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 245 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 274 Invalid, 0 Unknown, 184 Unchecked, 0.1s Time] [2025-04-29 11:22:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-04-29 11:22:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 278. [2025-04-29 11:22:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 253 states have (on average 1.150197628458498) internal successors, (291), 263 states have internal predecessors, (291), 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-29 11:22:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 311 transitions. [2025-04-29 11:22:55,355 INFO L79 Accepts]: Start accepts. Automaton has 278 states and 311 transitions. Word has length 52 [2025-04-29 11:22:55,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:55,356 INFO L485 AbstractCegarLoop]: Abstraction has 278 states and 311 transitions. [2025-04-29 11:22:55,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 5.125) internal successors, (82), 14 states have internal predecessors, (82), 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-29 11:22:55,356 INFO L278 IsEmpty]: Start isEmpty. Operand 278 states and 311 transitions. [2025-04-29 11:22:55,356 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:22:55,356 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:55,356 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:55,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-29 11:22:55,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:55,561 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:55,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash 773249533, now seen corresponding path program 1 times [2025-04-29 11:22:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:55,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385419101] [2025-04-29 11:22:55,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:55,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:22:55,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:22:55,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:55,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:22:55,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:55,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385419101] [2025-04-29 11:22:55,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385419101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:55,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746309881] [2025-04-29 11:22:55,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:55,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:55,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:55,692 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-29 11:22:55,693 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-29 11:22:55,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:22:55,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:22:55,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:55,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:55,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:22:55,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:55,828 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:55,828 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-29 11:22:55,950 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:55,950 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-29 11:22:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:22:55,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:56,009 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-29 11:22:56,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 24 treesize of output 20 [2025-04-29 11:22:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:22:56,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746309881] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:56,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:56,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 22 [2025-04-29 11:22:56,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004575985] [2025-04-29 11:22:56,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:56,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:22:56,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:56,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:22:56,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:22:56,231 INFO L87 Difference]: Start difference. First operand 278 states and 311 transitions. Second operand has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 22 states have internal predecessors, (141), 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-29 11:22:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:56,340 INFO L93 Difference]: Finished difference Result 288 states and 321 transitions. [2025-04-29 11:22:56,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:22:56,340 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 22 states have internal predecessors, (141), 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 57 [2025-04-29 11:22:56,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:56,341 INFO L225 Difference]: With dead ends: 288 [2025-04-29 11:22:56,341 INFO L226 Difference]: Without dead ends: 288 [2025-04-29 11:22:56,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:22:56,341 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 201 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:56,341 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 78 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:22:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-04-29 11:22:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 277. [2025-04-29 11:22:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 253 states have (on average 1.1462450592885376) internal successors, (290), 262 states have internal predecessors, (290), 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-29 11:22:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 310 transitions. [2025-04-29 11:22:56,345 INFO L79 Accepts]: Start accepts. Automaton has 277 states and 310 transitions. Word has length 57 [2025-04-29 11:22:56,345 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:56,345 INFO L485 AbstractCegarLoop]: Abstraction has 277 states and 310 transitions. [2025-04-29 11:22:56,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 22 states have internal predecessors, (141), 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-29 11:22:56,345 INFO L278 IsEmpty]: Start isEmpty. Operand 277 states and 310 transitions. [2025-04-29 11:22:56,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-29 11:22:56,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:56,346 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] [2025-04-29 11:22:56,355 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-29 11:22:56,550 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,SelfDestructingSolverStorable28 [2025-04-29 11:22:56,550 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:56,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash -336089457, now seen corresponding path program 1 times [2025-04-29 11:22:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:56,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686584846] [2025-04-29 11:22:56,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:56,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:56,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:22:56,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:22:56,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:56,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:56,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:56,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686584846] [2025-04-29 11:22:56,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686584846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:56,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460248436] [2025-04-29 11:22:56,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:56,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:56,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:56,900 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-29 11:22:56,901 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-29 11:22:56,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:22:56,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:22:56,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:56,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:56,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:22:56,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:57,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:57,196 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-29 11:22:57,364 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:57,364 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-29 11:22:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:57,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:57,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460248436] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:57,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:57,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 23 [2025-04-29 11:22:57,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062746401] [2025-04-29 11:22:57,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:57,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 11:22:57,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:57,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 11:22:57,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:22:57,700 INFO L87 Difference]: Start difference. First operand 277 states and 310 transitions. Second operand has 25 states, 22 states have (on average 4.818181818181818) internal successors, (106), 20 states have internal predecessors, (106), 6 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-29 11:22:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:58,391 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2025-04-29 11:22:58,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:22:58,391 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.818181818181818) internal successors, (106), 20 states have internal predecessors, (106), 6 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 58 [2025-04-29 11:22:58,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:58,392 INFO L225 Difference]: With dead ends: 301 [2025-04-29 11:22:58,392 INFO L226 Difference]: Without dead ends: 301 [2025-04-29 11:22:58,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=447, Invalid=1715, Unknown=0, NotChecked=0, Total=2162 [2025-04-29 11:22:58,393 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 323 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:58,393 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 284 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:22:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-04-29 11:22:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 237. [2025-04-29 11:22:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 218 states have (on average 1.1422018348623852) internal successors, (249), 224 states have internal predecessors, (249), 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-29 11:22:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 264 transitions. [2025-04-29 11:22:58,397 INFO L79 Accepts]: Start accepts. Automaton has 237 states and 264 transitions. Word has length 58 [2025-04-29 11:22:58,397 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:58,397 INFO L485 AbstractCegarLoop]: Abstraction has 237 states and 264 transitions. [2025-04-29 11:22:58,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.818181818181818) internal successors, (106), 20 states have internal predecessors, (106), 6 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-29 11:22:58,397 INFO L278 IsEmpty]: Start isEmpty. Operand 237 states and 264 transitions. [2025-04-29 11:22:58,398 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-29 11:22:58,398 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:58,398 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:58,404 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-29 11:22:58,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:58,599 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:22:58,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1799068276, now seen corresponding path program 1 times [2025-04-29 11:22:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:58,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015481871] [2025-04-29 11:22:58,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:58,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:22:58,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:22:58,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:22:58,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:58,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015481871] [2025-04-29 11:22:58,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015481871] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:58,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378439581] [2025-04-29 11:22:58,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:58,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:58,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:58,934 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-29 11:22:58,936 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-29 11:22:58,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:22:58,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:22:58,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:58,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:58,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-29 11:22:59,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:59,145 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:22:59,145 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-29 11:22:59,360 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:22:59,361 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-29 11:22:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:22:59,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:59,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-04-29 11:22:59,629 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:22:59,629 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 36 treesize of output 40 [2025-04-29 11:22:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:22:59,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378439581] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:22:59,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:22:59,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 39 [2025-04-29 11:22:59,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071671068] [2025-04-29 11:22:59,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:59,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 11:22:59,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:59,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 11:22:59,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2025-04-29 11:22:59,804 INFO L87 Difference]: Start difference. First operand 237 states and 264 transitions. Second operand has 41 states, 37 states have (on average 3.945945945945946) internal successors, (146), 32 states have internal predecessors, (146), 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-29 11:23:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:00,185 INFO L93 Difference]: Finished difference Result 251 states and 277 transitions. [2025-04-29 11:23:00,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:23:00,186 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 3.945945945945946) internal successors, (146), 32 states have internal predecessors, (146), 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 58 [2025-04-29 11:23:00,186 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:00,187 INFO L225 Difference]: With dead ends: 251 [2025-04-29 11:23:00,187 INFO L226 Difference]: Without dead ends: 251 [2025-04-29 11:23:00,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=368, Invalid=1984, Unknown=0, NotChecked=0, Total=2352 [2025-04-29 11:23:00,188 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 282 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:00,188 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 276 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-04-29 11:23:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 237. [2025-04-29 11:23:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 218 states have (on average 1.1376146788990826) internal successors, (248), 224 states have internal predecessors, (248), 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-29 11:23:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 263 transitions. [2025-04-29 11:23:00,193 INFO L79 Accepts]: Start accepts. Automaton has 237 states and 263 transitions. Word has length 58 [2025-04-29 11:23:00,193 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:00,193 INFO L485 AbstractCegarLoop]: Abstraction has 237 states and 263 transitions. [2025-04-29 11:23:00,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 3.945945945945946) internal successors, (146), 32 states have internal predecessors, (146), 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-29 11:23:00,194 INFO L278 IsEmpty]: Start isEmpty. Operand 237 states and 263 transitions. [2025-04-29 11:23:00,194 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-04-29 11:23:00,194 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:00,194 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:00,200 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-29 11:23:00,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:00,399 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:00,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1967208366, now seen corresponding path program 1 times [2025-04-29 11:23:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:00,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320758942] [2025-04-29 11:23:00,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:00,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:23:00,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:23:00,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:00,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:23:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:00,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320758942] [2025-04-29 11:23:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320758942] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:00,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413812320] [2025-04-29 11:23:00,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:00,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:00,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:00,577 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-29 11:23:00,578 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-29 11:23:00,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:23:00,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:23:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:00,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:23:00,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:00,722 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:23:00,722 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-29 11:23:00,802 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-29 11:23:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:23:00,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413812320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:01,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:23:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-04-29 11:23:01,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489100979] [2025-04-29 11:23:01,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:23:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:01,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:23:01,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:23:01,026 INFO L87 Difference]: Start difference. First operand 237 states and 263 transitions. Second operand has 17 states, 15 states have (on average 5.6) internal successors, (84), 13 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-29 11:23:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,277 INFO L93 Difference]: Finished difference Result 250 states and 276 transitions. [2025-04-29 11:23:01,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:23:01,277 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.6) internal successors, (84), 13 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 60 [2025-04-29 11:23:01,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,278 INFO L225 Difference]: With dead ends: 250 [2025-04-29 11:23:01,278 INFO L226 Difference]: Without dead ends: 250 [2025-04-29 11:23:01,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:23:01,279 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 166 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:01,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 278 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-04-29 11:23:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2025-04-29 11:23:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 218 states have (on average 1.1330275229357798) internal successors, (247), 223 states have internal predecessors, (247), 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-29 11:23:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 262 transitions. [2025-04-29 11:23:01,287 INFO L79 Accepts]: Start accepts. Automaton has 236 states and 262 transitions. Word has length 60 [2025-04-29 11:23:01,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,287 INFO L485 AbstractCegarLoop]: Abstraction has 236 states and 262 transitions. [2025-04-29 11:23:01,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.6) internal successors, (84), 13 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-29 11:23:01,287 INFO L278 IsEmpty]: Start isEmpty. Operand 236 states and 262 transitions. [2025-04-29 11:23:01,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-29 11:23:01,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,288 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 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-29 11:23:01,293 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-29 11:23:01,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:01,488 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:01,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2124857445, now seen corresponding path program 2 times [2025-04-29 11:23:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:01,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508010875] [2025-04-29 11:23:01,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:23:01,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:01,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-04-29 11:23:01,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:23:01,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:23:01,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 20 proven. 39 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:23:01,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:01,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508010875] [2025-04-29 11:23:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508010875] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:01,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509408029] [2025-04-29 11:23:01,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:23:01,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:01,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:01,717 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-29 11:23:01,718 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-29 11:23:01,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-04-29 11:23:01,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:23:01,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:23:01,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:23:01,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:01,917 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:23:01,917 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-29 11:23:02,121 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:23:02,121 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-29 11:23:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:02,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:02,399 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2025-04-29 11:23:02,504 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:02,504 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 42 treesize of output 46 [2025-04-29 11:23:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509408029] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:02,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:02,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 16] total 41 [2025-04-29 11:23:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818996101] [2025-04-29 11:23:02,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:02,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 11:23:02,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:02,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 11:23:02,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1604, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:23:02,763 INFO L87 Difference]: Start difference. First operand 236 states and 262 transitions. Second operand has 43 states, 39 states have (on average 4.512820512820513) internal successors, (176), 36 states have internal predecessors, (176), 7 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-29 11:23:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:03,184 INFO L93 Difference]: Finished difference Result 249 states and 275 transitions. [2025-04-29 11:23:03,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:23:03,185 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 4.512820512820513) internal successors, (176), 36 states have internal predecessors, (176), 7 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 66 [2025-04-29 11:23:03,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:03,185 INFO L225 Difference]: With dead ends: 249 [2025-04-29 11:23:03,185 INFO L226 Difference]: Without dead ends: 249 [2025-04-29 11:23:03,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=442, Invalid=2314, Unknown=0, NotChecked=0, Total=2756 [2025-04-29 11:23:03,186 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 304 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:03,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 308 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-04-29 11:23:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 235. [2025-04-29 11:23:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 218 states have (on average 1.128440366972477) internal successors, (246), 222 states have internal predecessors, (246), 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-29 11:23:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 261 transitions. [2025-04-29 11:23:03,189 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 261 transitions. Word has length 66 [2025-04-29 11:23:03,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:03,190 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 261 transitions. [2025-04-29 11:23:03,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 4.512820512820513) internal successors, (176), 36 states have internal predecessors, (176), 7 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-29 11:23:03,190 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 261 transitions. [2025-04-29 11:23:03,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-29 11:23:03,190 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:03,191 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:03,196 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-29 11:23:03,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:03,395 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:03,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:03,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1785092942, now seen corresponding path program 1 times [2025-04-29 11:23:03,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:03,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992337637] [2025-04-29 11:23:03,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:03,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:03,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:23:03,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:23:03,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:03,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:23:03,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:23:03,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:23:03,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:23:03,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:03,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:23:03,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:23:03,449 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:23:03,450 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2025-04-29 11:23:03,451 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2025-04-29 11:23:03,451 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2025-04-29 11:23:03,452 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2025-04-29 11:23:03,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2025-04-29 11:23:03,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2025-04-29 11:23:03,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2025-04-29 11:23:03,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2025-04-29 11:23:03,453 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2025-04-29 11:23:03,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-29 11:23:03,455 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:03,522 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:23:03,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:23:03 BoogieIcfgContainer [2025-04-29 11:23:03,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:23:03,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:23:03,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:23:03,525 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:23:03,525 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:22:38" (3/4) ... [2025-04-29 11:23:03,526 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 11:23:03,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:23:03,528 INFO L158 Benchmark]: Toolchain (without parser) took 25214.14ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 121.6MB in the beginning and 167.2MB in the end (delta: -45.6MB). Peak memory consumption was 257.1MB. Max. memory is 16.1GB. [2025-04-29 11:23:03,528 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:23:03,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.65ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 107.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:23:03,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.43ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:23:03,528 INFO L158 Benchmark]: Boogie Preprocessor took 44.00ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:23:03,528 INFO L158 Benchmark]: RCFGBuilder took 295.14ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 86.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:23:03,528 INFO L158 Benchmark]: TraceAbstraction took 24637.84ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 86.0MB in the beginning and 167.3MB in the end (delta: -81.3MB). Peak memory consumption was 223.5MB. Max. memory is 16.1GB. [2025-04-29 11:23:03,528 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 469.8MB. Free memory was 167.3MB in the beginning and 167.2MB in the end (delta: 96.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:23:03,529 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.96ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.65ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 107.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.43ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.00ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 295.14ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 86.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24637.84ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 86.0MB in the beginning and 167.3MB in the end (delta: -81.3MB). Peak memory consumption was 223.5MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 469.8MB. Free memory was 167.3MB in the beginning and 167.2MB in the end (delta: 96.2kB). 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: 71]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 37, overapproximation of memtrack at line 71. Possible FailurePath: [L27] int state = STATE_1; [L28] char *global = 0; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L30-L33] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L72] CALL parse_input("c1") VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0] [L36] 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] [L36] COND TRUE i < 2 VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0] [L37] 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] [L37] 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] [L37] 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] [L37] 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] [L37] 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] [L37] COND TRUE strcmp(commands[i].name,input) == 0 [L38] 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] [L38] COND TRUE state >= commands[i].state_needed [L39] 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] [L39] CALL commands[i].function() [L47] char *x = (char *)malloc(sizeof(char)); [L48] COND FALSE !(!x) VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L53] COND FALSE !(\read(*global)) VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L56] global = x [L57] state = STATE_2 VAL [\at(global, Pre)={0:0}, \at(state, Pre)=0, commands={6:0}, global={-3:0}, state=1] [L39] RET commands[i].function() [L72] RET parse_input("c1") VAL [commands={6:0}, global={-3:0}, state=1] [L73] CALL parse_input("c1") VAL [\at(global, Pre)={-3:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, state=1] [L36] int i = 0; VAL [\at(global, Pre)={-3:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L36] COND TRUE i < 2 VAL [\at(global, Pre)={-3:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, state=1] [L37] EXPR commands[i].name VAL [\at(global, Pre)={-3:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={-3:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={-3:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={-3:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L37] EXPR strcmp(commands[i].name,input) VAL [\at(global, Pre)={-3:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L37] COND TRUE strcmp(commands[i].name,input) == 0 [L38] EXPR commands[i].state_needed VAL [\at(global, Pre)={-3:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L38] COND TRUE state >= commands[i].state_needed [L39] EXPR commands[i].function VAL [\at(global, Pre)={-3:0}, \at(input, Pre)={4:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, input={4:0}, state=1] [L39] CALL commands[i].function() [L47] char *x = (char *)malloc(sizeof(char)); [L48] COND FALSE !(!x) VAL [\at(global, Pre)={-3:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, state=1, x={7:0}] [L53] COND TRUE \read(*global) VAL [\at(global, Pre)={-3:0}, \at(state, Pre)=1, commands={6:0}, global={-3:0}, state=1, x={7:0}] [L56] global = x [L57] state = STATE_2 VAL [\at(global, Pre)={-3:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L39] RET commands[i].function() [L73] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L74] CALL parse_input("c2") VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L36] 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] [L36] COND TRUE i < 2 VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1] [L37] 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] [L37] 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] [L37] 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] [L37] 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] [L37] 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] [L37] COND TRUE strcmp(commands[i].name,input) == 0 [L38] EXPR commands[i].state_needed 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] [L38] COND TRUE state >= commands[i].state_needed [L39] EXPR commands[i].function VAL [\at(global, Pre)={7:0}, \at(input, Pre)={5:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, input={5:0}, state=1] [L39] CALL commands[i].function() [L47] char *x = (char *)malloc(sizeof(char)); [L48] COND FALSE !(!x) VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1, x={-6:0}] [L53] COND TRUE \read(*global) VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={7:0}, state=1, x={-6:0}] [L56] global = x [L57] state = STATE_2 VAL [\at(global, Pre)={7:0}, \at(state, Pre)=1, commands={6:0}, global={-6:0}, state=1] [L39] RET commands[i].function() [L74] RET parse_input("c2") VAL [commands={6:0}, global={-6:0}, state=1] [L75] return 0; VAL [\result=0, commands={6:0}, global={-6: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: 37]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 37]: 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: 63]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 67]: 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: 24.5s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5922 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5922 mSDsluCounter, 6747 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 599 IncrementalHoareTripleChecker+Unchecked, 5236 mSDsCounter, 726 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6783 IncrementalHoareTripleChecker+Invalid, 8108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 726 mSolverCounterUnsat, 1511 mSDtfsCounter, 6783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1547 GetRequests, 971 SyntacticMatches, 3 SemanticMatches, 573 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3875 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=478occurred in iteration=22, InterpolantAutomatonStates: 320, 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, 33 MinimizatonAttempts, 966 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 1854 NumberOfCodeBlocks, 1854 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 2026 ConstructedInterpolants, 163 QuantifiedInterpolants, 25712 SizeOfPredicates, 79 NumberOfNonLiveVariables, 4709 ConjunctsInSsa, 368 ConjunctsInUnsatCore, 60 InterpolantComputations, 16 PerfectInterpolantSequences, 333/1091 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-29 11:23:03,557 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_3.c -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 ad9008297d469fdf1b53895572d7ca26f03d4a3ba390cb2ca57d3d5734b41bc4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:23:05,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:23:05,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-29 11:23:05,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:23:05,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:23:05,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:23:05,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:23:05,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:23:05,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:23:05,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:23:05,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:23:05,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:23:05,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:23:05,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:23:05,553 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:23:05,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:23:05,553 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:23:05,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:23:05,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:23:05,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:23:05,553 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:23:05,554 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:23:05,554 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:23:05,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:23:05,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:23:05,554 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-29 11:23:05,554 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-29 11:23:05,554 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:23:05,554 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:23:05,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:23:05,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:23:05,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:05,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:05,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:23:05,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:23:05,556 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 -> ad9008297d469fdf1b53895572d7ca26f03d4a3ba390cb2ca57d3d5734b41bc4 [2025-04-29 11:23:05,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:23:05,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:23:05,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:23:05,803 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:23:05,804 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:23:05,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-bftpd/bftpd_3.c [2025-04-29 11:23:07,093 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3de6c60/ce55f53b1ecf419aaf544dfdc7fb3d5c/FLAG1bc63caa4 [2025-04-29 11:23:07,274 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:23:07,274 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-bftpd/bftpd_3.c [2025-04-29 11:23:07,276 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:23:07,276 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:23:07,280 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3de6c60/ce55f53b1ecf419aaf544dfdc7fb3d5c/FLAG1bc63caa4 [2025-04-29 11:23:08,143 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3de6c60/ce55f53b1ecf419aaf544dfdc7fb3d5c [2025-04-29 11:23:08,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:23:08,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:23:08,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:23:08,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:23:08,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:23:08,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c31c39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08, skipping insertion in model container [2025-04-29 11:23:08,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:23:08,283 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-29 11:23:08,291 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:23:08,302 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:23:08,323 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:23:08,334 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:23:08,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08 WrapperNode [2025-04-29 11:23:08,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:23:08,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:23:08,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:23:08,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:23:08,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,363 INFO L138 Inliner]: procedures = 16, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-04-29 11:23:08,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:23:08,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:23:08,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:23:08,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:23:08,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,387 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 9, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-04-29 11:23:08,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:23:08,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:23:08,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:23:08,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:23:08,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (1/1) ... [2025-04-29 11:23:08,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:08,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:08,434 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-29 11:23:08,439 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-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-04-29 11:23:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:23:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:23:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:23:08,535 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:23:08,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:23:08,771 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-04-29 11:23:08,771 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:23:08,780 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:23:08,780 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:23:08,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:23:08 BoogieIcfgContainer [2025-04-29 11:23:08,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:23:08,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:23:08,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:23:08,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:23:08,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:23:08" (1/3) ... [2025-04-29 11:23:08,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af2d4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:23:08, skipping insertion in model container [2025-04-29 11:23:08,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:08" (2/3) ... [2025-04-29 11:23:08,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af2d4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:23:08, skipping insertion in model container [2025-04-29 11:23:08,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:23:08" (3/3) ... [2025-04-29 11:23:08,789 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_3.c [2025-04-29 11:23:08,799 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:23:08,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_3.c that has 2 procedures, 61 locations, 72 edges, 1 initial locations, 1 loop locations, and 20 error locations. [2025-04-29 11:23:08,825 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:23:08,833 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;@4dd66b02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:23:08,833 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-29 11:23:08,836 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-29 11:23:08,840 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:23:08,840 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:08,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:23:08,841 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-29 11:23:08,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash -920361850, now seen corresponding path program 1 times [2025-04-29 11:23:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:08,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1871953170] [2025-04-29 11:23:08,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:08,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:08,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:08,855 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-29 11:23:08,857 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-29 11:23:08,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:23:08,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:23:08,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:08,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:08,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:23:08,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:09,051 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-29 11:23:09,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:09,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:09,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871953170] [2025-04-29 11:23:09,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871953170] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:09,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:09,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:23:09,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865781491] [2025-04-29 11:23:09,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:09,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:09,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:09,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:09,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:09,070 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-29 11:23:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:09,188 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2025-04-29 11:23:09,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:09,190 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-29 11:23:09,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:09,195 INFO L225 Difference]: With dead ends: 109 [2025-04-29 11:23:09,195 INFO L226 Difference]: Without dead ends: 105 [2025-04-29 11:23:09,196 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-29 11:23:09,198 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 51 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 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-29 11:23:09,198 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 101 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-29 11:23:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2025-04-29 11:23:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.709090909090909) internal successors, (94), 74 states have internal predecessors, (94), 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-29 11:23:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2025-04-29 11:23:09,231 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 6 [2025-04-29 11:23:09,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:09,232 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2025-04-29 11:23:09,232 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-29 11:23:09,232 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2025-04-29 11:23:09,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:23:09,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:09,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:23:09,243 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-29 11:23:09,433 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-29 11:23:09,433 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-29 11:23:09,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash -920361849, now seen corresponding path program 1 times [2025-04-29 11:23:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:09,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1534837735] [2025-04-29 11:23:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:09,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:09,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:09,436 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-29 11:23:09,437 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-29 11:23:09,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:23:09,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:23:09,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:09,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:09,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:23:09,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:09,563 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-29 11:23:09,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:09,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:09,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534837735] [2025-04-29 11:23:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534837735] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:09,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:09,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839504782] [2025-04-29 11:23:09,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:09,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:09,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:09,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:09,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:09,567 INFO L87 Difference]: Start difference. First operand 82 states and 107 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-29 11:23:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:09,699 INFO L93 Difference]: Finished difference Result 180 states and 236 transitions. [2025-04-29 11:23:09,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:23:09,700 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-29 11:23:09,700 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:09,702 INFO L225 Difference]: With dead ends: 180 [2025-04-29 11:23:09,703 INFO L226 Difference]: Without dead ends: 180 [2025-04-29 11:23:09,704 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-29 11:23:09,704 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 143 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-29 11:23:09,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 143 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-04-29 11:23:09,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 149. [2025-04-29 11:23:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 117 states have (on average 1.7606837606837606) internal successors, (206), 136 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-04-29 11:23:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2025-04-29 11:23:09,720 INFO L79 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 6 [2025-04-29 11:23:09,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:09,720 INFO L485 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2025-04-29 11:23:09,720 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-29 11:23:09,721 INFO L278 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2025-04-29 11:23:09,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:23:09,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:09,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:09,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:23:09,921 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-29 11:23:09,922 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-29 11:23:09,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1533553699, now seen corresponding path program 1 times [2025-04-29 11:23:09,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:09,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1191164296] [2025-04-29 11:23:09,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:09,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:09,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:09,924 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-29 11:23:09,925 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-29 11:23:09,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:23:09,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:23:09,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:09,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:09,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:23:09,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:10,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:10,091 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:10,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191164296] [2025-04-29 11:23:10,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191164296] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:10,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:10,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852217499] [2025-04-29 11:23:10,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:10,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:10,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:10,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:10,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:10,093 INFO L87 Difference]: Start difference. First operand 149 states and 232 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-29 11:23:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:10,285 INFO L93 Difference]: Finished difference Result 194 states and 281 transitions. [2025-04-29 11:23:10,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:10,285 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-29 11:23:10,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:10,287 INFO L225 Difference]: With dead ends: 194 [2025-04-29 11:23:10,289 INFO L226 Difference]: Without dead ends: 194 [2025-04-29 11:23:10,289 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-29 11:23:10,290 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 157 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.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:10,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 157 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-29 11:23:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 152. [2025-04-29 11:23:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.7416666666666667) internal successors, (209), 139 states have internal predecessors, (209), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-04-29 11:23:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 235 transitions. [2025-04-29 11:23:10,306 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 235 transitions. Word has length 7 [2025-04-29 11:23:10,306 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:10,306 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 235 transitions. [2025-04-29 11:23:10,306 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-29 11:23:10,307 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 235 transitions. [2025-04-29 11:23:10,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:23:10,307 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:10,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:10,313 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-29 11:23:10,507 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-29 11:23:10,507 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-29 11:23:10,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash 295524454, now seen corresponding path program 1 times [2025-04-29 11:23:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:10,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [464007393] [2025-04-29 11:23:10,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:10,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:10,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:10,511 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-29 11:23:10,512 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-29 11:23:10,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:23:10,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:23:10,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:10,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:10,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:23:10,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:10,705 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-29 11:23:10,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:10,705 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:10,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464007393] [2025-04-29 11:23:10,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464007393] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:10,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:10,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:10,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767182359] [2025-04-29 11:23:10,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:10,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:10,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:10,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:10,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:10,708 INFO L87 Difference]: Start difference. First operand 152 states and 235 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-29 11:23:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:10,856 INFO L93 Difference]: Finished difference Result 182 states and 237 transitions. [2025-04-29 11:23:10,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:10,856 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-29 11:23:10,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:10,858 INFO L225 Difference]: With dead ends: 182 [2025-04-29 11:23:10,858 INFO L226 Difference]: Without dead ends: 182 [2025-04-29 11:23:10,858 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-29 11:23:10,859 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 74 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:10,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 201 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-29 11:23:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2025-04-29 11:23:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.725) internal successors, (207), 139 states have internal predecessors, (207), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-04-29 11:23:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 233 transitions. [2025-04-29 11:23:10,866 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 233 transitions. Word has length 8 [2025-04-29 11:23:10,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:10,867 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 233 transitions. [2025-04-29 11:23:10,867 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-29 11:23:10,867 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 233 transitions. [2025-04-29 11:23:10,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:23:10,867 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:10,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:10,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:23:11,067 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-29 11:23:11,068 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-29 11:23:11,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash 571323525, now seen corresponding path program 1 times [2025-04-29 11:23:11,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:11,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891242584] [2025-04-29 11:23:11,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:11,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:11,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:11,071 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-29 11:23:11,071 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-29 11:23:11,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:23:11,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:23:11,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:11,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:11,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:23:11,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:11,175 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-29 11:23:11,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:11,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:11,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891242584] [2025-04-29 11:23:11,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891242584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:11,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:11,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:11,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791487692] [2025-04-29 11:23:11,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:11,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:11,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:11,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:11,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:11,177 INFO L87 Difference]: Start difference. First operand 152 states and 233 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-29 11:23:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:11,308 INFO L93 Difference]: Finished difference Result 234 states and 323 transitions. [2025-04-29 11:23:11,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:11,308 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-29 11:23:11,308 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:11,309 INFO L225 Difference]: With dead ends: 234 [2025-04-29 11:23:11,309 INFO L226 Difference]: Without dead ends: 234 [2025-04-29 11:23:11,309 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-29 11:23:11,310 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 130 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:11,310 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 186 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-04-29 11:23:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 185. [2025-04-29 11:23:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 151 states have (on average 1.6754966887417218) internal successors, (253), 171 states have internal predecessors, (253), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-04-29 11:23:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 279 transitions. [2025-04-29 11:23:11,325 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 279 transitions. Word has length 9 [2025-04-29 11:23:11,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:11,325 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 279 transitions. [2025-04-29 11:23:11,325 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-29 11:23:11,326 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 279 transitions. [2025-04-29 11:23:11,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:23:11,326 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:11,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:11,332 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-29 11:23:11,526 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-29 11:23:11,526 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-29 11:23:11,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash 531160136, now seen corresponding path program 1 times [2025-04-29 11:23:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:11,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [208984172] [2025-04-29 11:23:11,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:11,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:11,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:11,529 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-29 11:23:11,530 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-29 11:23:11,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:23:11,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:23:11,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:11,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:11,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:23:11,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:11,641 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-29 11:23:11,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:11,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:11,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208984172] [2025-04-29 11:23:11,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208984172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:11,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846813869] [2025-04-29 11:23:11,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:11,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:11,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:11,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:11,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:11,642 INFO L87 Difference]: Start difference. First operand 185 states and 279 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-29 11:23:11,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:11,756 INFO L93 Difference]: Finished difference Result 235 states and 302 transitions. [2025-04-29 11:23:11,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:11,757 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-29 11:23:11,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:11,758 INFO L225 Difference]: With dead ends: 235 [2025-04-29 11:23:11,758 INFO L226 Difference]: Without dead ends: 235 [2025-04-29 11:23:11,758 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-29 11:23:11,758 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 205 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-29 11:23:11,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 205 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:11,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-29 11:23:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 199. [2025-04-29 11:23:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 164 states have (on average 1.670731707317073) internal successors, (274), 185 states have internal predecessors, (274), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-04-29 11:23:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 300 transitions. [2025-04-29 11:23:11,771 INFO L79 Accepts]: Start accepts. Automaton has 199 states and 300 transitions. Word has length 10 [2025-04-29 11:23:11,772 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:11,772 INFO L485 AbstractCegarLoop]: Abstraction has 199 states and 300 transitions. [2025-04-29 11:23:11,772 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-29 11:23:11,772 INFO L278 IsEmpty]: Start isEmpty. Operand 199 states and 300 transitions. [2025-04-29 11:23:11,772 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:23:11,772 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:11,772 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:11,779 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-29 11:23:11,972 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-29 11:23:11,973 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-29 11:23:11,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash 738472334, now seen corresponding path program 1 times [2025-04-29 11:23:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:11,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427645212] [2025-04-29 11:23:11,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:11,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:11,975 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-29 11:23:11,976 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-29 11:23:12,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:23:12,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:23:12,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:12,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:12,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:23:12,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:12,178 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-29 11:23:12,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:12,402 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-29 11:23:12,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:12,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427645212] [2025-04-29 11:23:12,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427645212] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:12,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:23:12,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-04-29 11:23:12,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877199076] [2025-04-29 11:23:12,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:12,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:23:12,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:12,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:23:12,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:12,403 INFO L87 Difference]: Start difference. First operand 199 states and 300 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-29 11:23:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:12,684 INFO L93 Difference]: Finished difference Result 270 states and 357 transitions. [2025-04-29 11:23:12,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:23:12,685 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-29 11:23:12,686 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:12,688 INFO L225 Difference]: With dead ends: 270 [2025-04-29 11:23:12,688 INFO L226 Difference]: Without dead ends: 270 [2025-04-29 11:23:12,689 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-29 11:23:12,689 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 114 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:12,689 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 363 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-29 11:23:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 229. [2025-04-29 11:23:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 194 states have (on average 1.6597938144329898) internal successors, (322), 215 states have internal predecessors, (322), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-04-29 11:23:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 348 transitions. [2025-04-29 11:23:12,695 INFO L79 Accepts]: Start accepts. Automaton has 229 states and 348 transitions. Word has length 14 [2025-04-29 11:23:12,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:12,696 INFO L485 AbstractCegarLoop]: Abstraction has 229 states and 348 transitions. [2025-04-29 11:23:12,696 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-29 11:23:12,696 INFO L278 IsEmpty]: Start isEmpty. Operand 229 states and 348 transitions. [2025-04-29 11:23:12,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:23:12,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:12,696 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:12,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:12,896 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-29 11:23:12,897 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-29 11:23:12,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:12,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1417805820, now seen corresponding path program 1 times [2025-04-29 11:23:12,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:12,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129224297] [2025-04-29 11:23:12,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:12,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:12,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:12,900 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-29 11:23:12,900 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-29 11:23:12,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:23:12,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:23:12,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:12,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:12,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:23:12,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:13,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:13,444 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-29 11:23:13,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:13,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129224297] [2025-04-29 11:23:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129224297] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:13,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:23:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-04-29 11:23:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616959556] [2025-04-29 11:23:13,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:13,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:13,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:13,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:13,446 INFO L87 Difference]: Start difference. First operand 229 states and 348 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-29 11:23:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:14,498 INFO L93 Difference]: Finished difference Result 359 states and 493 transitions. [2025-04-29 11:23:14,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:23:14,498 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-29 11:23:14,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:14,500 INFO L225 Difference]: With dead ends: 359 [2025-04-29 11:23:14,501 INFO L226 Difference]: Without dead ends: 359 [2025-04-29 11:23:14,501 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-29 11:23:14,502 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 371 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:14,503 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 239 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:23:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-04-29 11:23:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 267. [2025-04-29 11:23:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 232 states have (on average 1.6551724137931034) internal successors, (384), 253 states have internal predecessors, (384), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2025-04-29 11:23:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 410 transitions. [2025-04-29 11:23:14,520 INFO L79 Accepts]: Start accepts. Automaton has 267 states and 410 transitions. Word has length 15 [2025-04-29 11:23:14,521 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:14,521 INFO L485 AbstractCegarLoop]: Abstraction has 267 states and 410 transitions. [2025-04-29 11:23:14,521 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-29 11:23:14,521 INFO L278 IsEmpty]: Start isEmpty. Operand 267 states and 410 transitions. [2025-04-29 11:23:14,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:23:14,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:14,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:14,529 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-29 11:23:14,722 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-29 11:23:14,722 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-29 11:23:14,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:14,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1002307501, now seen corresponding path program 1 times [2025-04-29 11:23:14,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:14,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [249386551] [2025-04-29 11:23:14,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:14,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:14,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:14,725 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-29 11:23:14,725 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-29 11:23:14,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:23:14,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:23:14,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:14,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:14,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:23:14,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:15,055 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-29 11:23:15,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:15,323 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-29 11:23:15,323 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:15,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249386551] [2025-04-29 11:23:15,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249386551] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:15,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:23:15,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-04-29 11:23:15,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288174342] [2025-04-29 11:23:15,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:15,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:15,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:15,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:15,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:23:15,324 INFO L87 Difference]: Start difference. First operand 267 states and 410 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-29 11:23:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:16,395 INFO L93 Difference]: Finished difference Result 473 states and 643 transitions. [2025-04-29 11:23:16,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:23:16,395 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-29 11:23:16,395 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:16,397 INFO L225 Difference]: With dead ends: 473 [2025-04-29 11:23:16,397 INFO L226 Difference]: Without dead ends: 473 [2025-04-29 11:23:16,397 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-29 11:23:16,398 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 337 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:16,398 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 429 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:23:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-04-29 11:23:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 352. [2025-04-29 11:23:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 314 states have (on average 1.6687898089171975) internal successors, (524), 336 states have internal predecessors, (524), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2025-04-29 11:23:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 556 transitions. [2025-04-29 11:23:16,408 INFO L79 Accepts]: Start accepts. Automaton has 352 states and 556 transitions. Word has length 16 [2025-04-29 11:23:16,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:16,408 INFO L485 AbstractCegarLoop]: Abstraction has 352 states and 556 transitions. [2025-04-29 11:23:16,409 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-29 11:23:16,409 INFO L278 IsEmpty]: Start isEmpty. Operand 352 states and 556 transitions. [2025-04-29 11:23:16,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:23:16,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:16,409 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-29 11:23:16,416 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-29 11:23:16,610 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-29 11:23:16,610 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-29 11:23:16,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1943920207, now seen corresponding path program 1 times [2025-04-29 11:23:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:16,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257597115] [2025-04-29 11:23:16,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:16,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:16,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:16,612 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-29 11:23:16,613 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-29 11:23:16,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:23:16,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:23:16,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:16,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:16,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:23:16,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:16,674 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-29 11:23:16,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:16,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:16,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257597115] [2025-04-29 11:23:16,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257597115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:16,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:16,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:23:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641365364] [2025-04-29 11:23:16,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:16,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:16,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:16,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:16,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:16,675 INFO L87 Difference]: Start difference. First operand 352 states and 556 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:16,694 INFO L93 Difference]: Finished difference Result 493 states and 775 transitions. [2025-04-29 11:23:16,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:16,696 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:23:16,696 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:16,698 INFO L225 Difference]: With dead ends: 493 [2025-04-29 11:23:16,698 INFO L226 Difference]: Without dead ends: 493 [2025-04-29 11:23:16,698 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-29 11:23:16,698 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 49 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 108 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-29 11:23:16,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 108 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-04-29 11:23:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 473. [2025-04-29 11:23:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 426 states have (on average 1.6690140845070423) internal successors, (711), 450 states have internal predecessors, (711), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (43), 13 states have call predecessors, (43), 13 states have call successors, (43) [2025-04-29 11:23:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 767 transitions. [2025-04-29 11:23:16,714 INFO L79 Accepts]: Start accepts. Automaton has 473 states and 767 transitions. Word has length 18 [2025-04-29 11:23:16,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:16,714 INFO L485 AbstractCegarLoop]: Abstraction has 473 states and 767 transitions. [2025-04-29 11:23:16,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:16,714 INFO L278 IsEmpty]: Start isEmpty. Operand 473 states and 767 transitions. [2025-04-29 11:23:16,714 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:23:16,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:16,715 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-29 11:23:16,721 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-29 11:23:16,915 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-29 11:23:16,915 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:16,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1943920463, now seen corresponding path program 1 times [2025-04-29 11:23:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:16,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789092092] [2025-04-29 11:23:16,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:16,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:16,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:16,918 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-29 11:23:16,918 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-29 11:23:16,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:23:16,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:23:16,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:16,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:16,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:23:16,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:16,964 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-29 11:23:16,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:16,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:16,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789092092] [2025-04-29 11:23:16,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789092092] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:16,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:16,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:16,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993546815] [2025-04-29 11:23:16,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:16,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:16,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:16,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:16,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:16,965 INFO L87 Difference]: Start difference. First operand 473 states and 767 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-29 11:23:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:16,974 INFO L93 Difference]: Finished difference Result 472 states and 761 transitions. [2025-04-29 11:23:16,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:16,975 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-29 11:23:16,975 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:16,976 INFO L225 Difference]: With dead ends: 472 [2025-04-29 11:23:16,976 INFO L226 Difference]: Without dead ends: 472 [2025-04-29 11:23:16,977 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-29 11:23:16,977 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-29 11:23:16,978 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-29 11:23:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-04-29 11:23:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-04-29 11:23:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 426 states have (on average 1.6549295774647887) internal successors, (705), 449 states have internal predecessors, (705), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (43), 13 states have call predecessors, (43), 13 states have call successors, (43) [2025-04-29 11:23:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 761 transitions. [2025-04-29 11:23:16,988 INFO L79 Accepts]: Start accepts. Automaton has 472 states and 761 transitions. Word has length 18 [2025-04-29 11:23:16,988 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:16,988 INFO L485 AbstractCegarLoop]: Abstraction has 472 states and 761 transitions. [2025-04-29 11:23:16,989 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-29 11:23:16,989 INFO L278 IsEmpty]: Start isEmpty. Operand 472 states and 761 transitions. [2025-04-29 11:23:16,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:23:16,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:16,989 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-29 11:23:16,996 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-29 11:23:17,189 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-29 11:23:17,190 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-29 11:23:17,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:17,190 INFO L85 PathProgramCache]: Analyzing trace with hash 131984341, now seen corresponding path program 1 times [2025-04-29 11:23:17,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:17,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111668527] [2025-04-29 11:23:17,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:17,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:17,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:17,192 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-29 11:23:17,193 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-29 11:23:17,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:23:17,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:23:17,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:17,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:17,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:23:17,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:17,280 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-29 11:23:17,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:17,280 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:17,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111668527] [2025-04-29 11:23:17,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111668527] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:17,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:17,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:23:17,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680537077] [2025-04-29 11:23:17,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:17,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:17,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:17,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:17,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:17,282 INFO L87 Difference]: Start difference. First operand 472 states and 761 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-29 11:23:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:17,320 INFO L93 Difference]: Finished difference Result 544 states and 848 transitions. [2025-04-29 11:23:17,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:17,321 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-29 11:23:17,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:17,322 INFO L225 Difference]: With dead ends: 544 [2025-04-29 11:23:17,323 INFO L226 Difference]: Without dead ends: 544 [2025-04-29 11:23:17,323 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-29 11:23:17,323 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 41 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:17,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:17,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-04-29 11:23:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 525. [2025-04-29 11:23:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 476 states have (on average 1.638655462184874) internal successors, (780), 500 states have internal predecessors, (780), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2025-04-29 11:23:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 840 transitions. [2025-04-29 11:23:17,336 INFO L79 Accepts]: Start accepts. Automaton has 525 states and 840 transitions. Word has length 19 [2025-04-29 11:23:17,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:17,336 INFO L485 AbstractCegarLoop]: Abstraction has 525 states and 840 transitions. [2025-04-29 11:23:17,337 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-29 11:23:17,337 INFO L278 IsEmpty]: Start isEmpty. Operand 525 states and 840 transitions. [2025-04-29 11:23:17,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:23:17,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:17,337 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-29 11:23:17,345 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-29 11:23:17,538 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-29 11:23:17,538 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:17,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash 131992285, now seen corresponding path program 1 times [2025-04-29 11:23:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:17,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974802673] [2025-04-29 11:23:17,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:17,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:17,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:17,541 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-29 11:23:17,542 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-29 11:23:17,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:23:17,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:23:17,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:17,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:17,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:23:17,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:17,588 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-29 11:23:17,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:17,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:17,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974802673] [2025-04-29 11:23:17,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974802673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:17,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:17,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:17,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999354786] [2025-04-29 11:23:17,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:17,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:17,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:17,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:17,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:17,589 INFO L87 Difference]: Start difference. First operand 525 states and 840 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-29 11:23:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:17,595 INFO L93 Difference]: Finished difference Result 480 states and 773 transitions. [2025-04-29 11:23:17,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:17,596 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-29 11:23:17,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:17,597 INFO L225 Difference]: With dead ends: 480 [2025-04-29 11:23:17,597 INFO L226 Difference]: Without dead ends: 480 [2025-04-29 11:23:17,597 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-29 11:23:17,598 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-29 11:23:17,598 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-29 11:23:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-04-29 11:23:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-04-29 11:23:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 436 states have (on average 1.635321100917431) internal successors, (713), 455 states have internal predecessors, (713), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2025-04-29 11:23:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 773 transitions. [2025-04-29 11:23:17,607 INFO L79 Accepts]: Start accepts. Automaton has 480 states and 773 transitions. Word has length 19 [2025-04-29 11:23:17,607 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:17,608 INFO L485 AbstractCegarLoop]: Abstraction has 480 states and 773 transitions. [2025-04-29 11:23:17,608 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-29 11:23:17,608 INFO L278 IsEmpty]: Start isEmpty. Operand 480 states and 773 transitions. [2025-04-29 11:23:17,608 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:23:17,608 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:17,608 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:23:17,615 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-29 11:23:17,813 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-29 11:23:17,813 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-29 11:23:17,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash 447088533, now seen corresponding path program 2 times [2025-04-29 11:23:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:17,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [529041575] [2025-04-29 11:23:17,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:23:17,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:17,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:17,816 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-29 11:23:17,818 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-29 11:23:17,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-29 11:23:17,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:23:17,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:23:17,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:17,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:23:17,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:17,889 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-29 11:23:17,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:17,931 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-29 11:23:17,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:17,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529041575] [2025-04-29 11:23:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529041575] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:17,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:23:17,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-04-29 11:23:17,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992780867] [2025-04-29 11:23:17,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:17,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:23:17,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:17,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:23:17,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:17,933 INFO L87 Difference]: Start difference. First operand 480 states and 773 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-29 11:23:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:17,998 INFO L93 Difference]: Finished difference Result 406 states and 603 transitions. [2025-04-29 11:23:17,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:17,998 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-29 11:23:17,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:17,999 INFO L225 Difference]: With dead ends: 406 [2025-04-29 11:23:18,000 INFO L226 Difference]: Without dead ends: 406 [2025-04-29 11:23:18,000 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-29 11:23:18,000 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:18,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 280 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-04-29 11:23:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 389. [2025-04-29 11:23:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 345 states have (on average 1.5130434782608695) internal successors, (522), 364 states have internal predecessors, (522), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2025-04-29 11:23:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 582 transitions. [2025-04-29 11:23:18,010 INFO L79 Accepts]: Start accepts. Automaton has 389 states and 582 transitions. Word has length 22 [2025-04-29 11:23:18,010 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:18,010 INFO L485 AbstractCegarLoop]: Abstraction has 389 states and 582 transitions. [2025-04-29 11:23:18,010 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-29 11:23:18,010 INFO L278 IsEmpty]: Start isEmpty. Operand 389 states and 582 transitions. [2025-04-29 11:23:18,011 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:23:18,011 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:18,011 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-29 11:23:18,018 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-29 11:23:18,212 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-29 11:23:18,212 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-29 11:23:18,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:18,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1175069978, now seen corresponding path program 1 times [2025-04-29 11:23:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:18,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139138818] [2025-04-29 11:23:18,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:18,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:18,215 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-29 11:23:18,215 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-29 11:23:18,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:23:18,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:23:18,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:18,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:18,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:23:18,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:18,262 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-29 11:23:18,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:18,263 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:18,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139138818] [2025-04-29 11:23:18,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139138818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:18,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:18,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12343684] [2025-04-29 11:23:18,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:18,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:18,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:18,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:18,264 INFO L87 Difference]: Start difference. First operand 389 states and 582 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-29 11:23:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:18,270 INFO L93 Difference]: Finished difference Result 277 states and 394 transitions. [2025-04-29 11:23:18,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:18,270 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-29 11:23:18,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:18,271 INFO L225 Difference]: With dead ends: 277 [2025-04-29 11:23:18,271 INFO L226 Difference]: Without dead ends: 277 [2025-04-29 11:23:18,271 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-29 11:23:18,271 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 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-29 11:23:18,272 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-04-29 11:23:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2025-04-29 11:23:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.4813278008298756) internal successors, (357), 258 states have internal predecessors, (357), 10 states have call successors, (10), 7 states have call predecessors, (10), 11 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-04-29 11:23:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 393 transitions. [2025-04-29 11:23:18,276 INFO L79 Accepts]: Start accepts. Automaton has 276 states and 393 transitions. Word has length 25 [2025-04-29 11:23:18,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:18,276 INFO L485 AbstractCegarLoop]: Abstraction has 276 states and 393 transitions. [2025-04-29 11:23:18,276 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-29 11:23:18,276 INFO L278 IsEmpty]: Start isEmpty. Operand 276 states and 393 transitions. [2025-04-29 11:23:18,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:18,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:18,277 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-29 11:23:18,283 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-29 11:23:18,477 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-29 11:23:18,478 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-29 11:23:18,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1096505428, now seen corresponding path program 1 times [2025-04-29 11:23:18,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:18,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1331236048] [2025-04-29 11:23:18,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:18,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:18,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:18,481 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-29 11:23:18,481 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-29 11:23:18,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:18,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:18,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:18,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:18,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:23:18,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:18,603 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-29 11:23:18,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:18,603 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:18,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331236048] [2025-04-29 11:23:18,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331236048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:18,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:18,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996511892] [2025-04-29 11:23:18,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:18,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:18,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:18,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:18,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:18,604 INFO L87 Difference]: Start difference. First operand 276 states and 393 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-29 11:23:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:18,675 INFO L93 Difference]: Finished difference Result 301 states and 409 transitions. [2025-04-29 11:23:18,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:23:18,676 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 27 [2025-04-29 11:23:18,676 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:18,677 INFO L225 Difference]: With dead ends: 301 [2025-04-29 11:23:18,677 INFO L226 Difference]: Without dead ends: 301 [2025-04-29 11:23:18,677 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:18,677 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 82 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:18,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 174 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-04-29 11:23:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 280. [2025-04-29 11:23:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 243 states have (on average 1.4650205761316872) internal successors, (356), 262 states have internal predecessors, (356), 10 states have call successors, (10), 7 states have call predecessors, (10), 13 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-04-29 11:23:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 392 transitions. [2025-04-29 11:23:18,686 INFO L79 Accepts]: Start accepts. Automaton has 280 states and 392 transitions. Word has length 27 [2025-04-29 11:23:18,686 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:18,686 INFO L485 AbstractCegarLoop]: Abstraction has 280 states and 392 transitions. [2025-04-29 11:23:18,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-29 11:23:18,687 INFO L278 IsEmpty]: Start isEmpty. Operand 280 states and 392 transitions. [2025-04-29 11:23:18,687 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:23:18,688 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:18,688 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-29 11:23:18,698 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-29 11:23:18,892 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-29 11:23:18,893 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-29 11:23:18,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:18,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1489532438, now seen corresponding path program 1 times [2025-04-29 11:23:18,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:18,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763689826] [2025-04-29 11:23:18,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:18,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:18,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:18,895 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-29 11:23:18,896 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-29 11:23:18,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:23:18,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:23:18,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:18,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:18,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:23:18,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:19,093 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-29 11:23:19,094 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-29 11:23:19,206 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-29 11:23:19,241 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-29 11:23:19,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:19,370 INFO L325 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-04-29 11:23:19,370 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-29 11:23:23,858 INFO L325 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-04-29 11:23:23,858 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-29 11:23:23,945 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-29 11:23:23,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:23,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763689826] [2025-04-29 11:23:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763689826] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:23,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:23:23,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2025-04-29 11:23:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369166212] [2025-04-29 11:23:23,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:23,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:23:23,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:23,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:23:23,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=3, NotChecked=0, Total=110 [2025-04-29 11:23:23,946 INFO L87 Difference]: Start difference. First operand 280 states and 392 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-29 11:23:27,959 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:23:33,296 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-29 11:23:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:33,942 INFO L93 Difference]: Finished difference Result 298 states and 388 transitions. [2025-04-29 11:23:33,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:23:33,943 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-29 11:23:33,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:33,944 INFO L225 Difference]: With dead ends: 298 [2025-04-29 11:23:33,944 INFO L226 Difference]: Without dead ends: 298 [2025-04-29 11:23:33,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=107, Invalid=195, Unknown=4, NotChecked=0, Total=306 [2025-04-29 11:23:33,944 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 186 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 38 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:33,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 63 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 81 Invalid, 17 Unknown, 0 Unchecked, 9.0s Time] [2025-04-29 11:23:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-04-29 11:23:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 285. [2025-04-29 11:23:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 249 states have (on average 1.357429718875502) internal successors, (338), 267 states have internal predecessors, (338), 10 states have call successors, (10), 7 states have call predecessors, (10), 15 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-04-29 11:23:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 377 transitions. [2025-04-29 11:23:33,950 INFO L79 Accepts]: Start accepts. Automaton has 285 states and 377 transitions. Word has length 27 [2025-04-29 11:23:33,950 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:33,950 INFO L485 AbstractCegarLoop]: Abstraction has 285 states and 377 transitions. [2025-04-29 11:23:33,950 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-29 11:23:33,950 INFO L278 IsEmpty]: Start isEmpty. Operand 285 states and 377 transitions. [2025-04-29 11:23:33,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:33,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:33,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:33,957 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-29 11:23:34,151 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-29 11:23:34,151 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:34,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash 394047059, now seen corresponding path program 1 times [2025-04-29 11:23:34,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:34,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272791437] [2025-04-29 11:23:34,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:34,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:34,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:34,154 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-29 11:23:34,154 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-29 11:23:34,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:23:34,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:34,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:34,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:34,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:23:34,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:35,766 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-29 11:23:35,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:35,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:23:35,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272791437] [2025-04-29 11:23:35,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272791437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:35,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:35,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:23:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777287794] [2025-04-29 11:23:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:35,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:23:35,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:23:35,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:23:35,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:35,767 INFO L87 Difference]: Start difference. First operand 285 states and 377 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:36,986 INFO L93 Difference]: Finished difference Result 304 states and 388 transitions. [2025-04-29 11:23:36,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:23:36,987 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-04-29 11:23:36,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:36,988 INFO L225 Difference]: With dead ends: 304 [2025-04-29 11:23:36,988 INFO L226 Difference]: Without dead ends: 304 [2025-04-29 11:23:36,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:23:36,989 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 96 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:36,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 203 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 11:23:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-04-29 11:23:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2025-04-29 11:23:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 258 states have (on average 1.3449612403100775) internal successors, (347), 276 states have internal predecessors, (347), 10 states have call successors, (10), 7 states have call predecessors, (10), 15 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-04-29 11:23:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 386 transitions. [2025-04-29 11:23:36,994 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 386 transitions. Word has length 28 [2025-04-29 11:23:36,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:36,994 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 386 transitions. [2025-04-29 11:23:36,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:36,994 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 386 transitions. [2025-04-29 11:23:36,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:23:36,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:36,995 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-29 11:23:37,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-29 11:23:37,195 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 [2025-04-29 11:23:37,195 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:23:37,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1216564983, now seen corresponding path program 1 times [2025-04-29 11:23:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:23:37,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622251348] [2025-04-29 11:23:37,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:37,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:37,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:37,199 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-29 11:23:37,200 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-29 11:23:37,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:23:37,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:23:37,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:37,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:37,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:23:37,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:38,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:38,940 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-29 11:23:39,555 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-29 11:23:39,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15